commit

Wang-Jun-Chao · Wang-Jun-Chao · commit 743227aeddd5 · 2020-07-01T09:25:28.000+08:00
Change-Id: Id41004d654d277ea27da6318cb54af6f85131431
diff --git a/[0538][Convert BST to Greater Tree]/[0538][Convert BST to Greater Tree].iml b/[0538][Convert BST to Greater Tree]/[0538][Convert BST to Greater Tree].iml
@@ -0,0 +1,21 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="module-library">
+      <library name="JUnit4">
+        <CLASSES>
+          <root url="jar://$MODULE_DIR$/../lib/junit-4.12.jar!/" />
+          <root url="jar://$MODULE_DIR$/../lib/hamcrest-core-1.3.jar!/" />
+        </CLASSES>
+        <JAVADOC />
+        <SOURCES />
+      </library>
+    </orderEntry>
+  </component>
+</module>
diff --git a/[0538][Convert BST to Greater Tree]/src/Solution.java b/[0538][Convert BST to Greater Tree]/src/Solution.java
@@ -0,0 +1,11 @@
+package PACKAGE_NAME;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-30 10:06
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+}
diff --git a/[0538][Convert BST to Greater Tree]/src/SolutionTest.java b/[0538][Convert BST to Greater Tree]/src/SolutionTest.java
@@ -0,0 +1,12 @@
+import static org.junit.Assert.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-30 10:14
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+}
diff --git a/[0538][Convert BST to Greater Tree]/src/TreeNode.java b/[0538][Convert BST to Greater Tree]/src/TreeNode.java
@@ -0,0 +1,16 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 11:06
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+
+    TreeNode(int x) {
+        val = x;
+    }
+}
diff --git a/[0541][Reverse String II]/[0541][Reverse String II].iml b/[0541][Reverse String II]/[0541][Reverse String II].iml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
diff --git a/[0541][Reverse String II]/src/Solution.java b/[0541][Reverse String II]/src/Solution.java
@@ -0,0 +1,11 @@
+package PACKAGE_NAME;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-30 12:50
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+}
diff --git a/[0541][Reverse String II]/src/SolutionTest.java b/[0541][Reverse String II]/src/SolutionTest.java
@@ -0,0 +1,12 @@
+import static org.junit.Assert.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-30 12:54
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+}
diff --git a/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml b/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
diff --git a/[0543][Diameter of Binary Tree]/src/Solution.java b/[0543][Diameter of Binary Tree]/src/Solution.java
@@ -0,0 +1,11 @@
+package PACKAGE_NAME;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-01 08:53
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+}
diff --git a/[0543][Diameter of Binary Tree]/src/SolutionTest.java b/[0543][Diameter of Binary Tree]/src/SolutionTest.java
@@ -0,0 +1,12 @@
+import static org.junit.Assert.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-01 08:57
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+}
diff --git a/[0543][Diameter of Binary Tree]/src/TreeNode.java b/[0543][Diameter of Binary Tree]/src/TreeNode.java
@@ -0,0 +1,16 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 11:06
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+
+    TreeNode(int x) {
+        val = x;
+    }
+}
diff --git a/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml b/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
diff --git a/[0783][Minimum Distance Between BST Nodes]/src/Solution.java b/[0783][Minimum Distance Between BST Nodes]/src/Solution.java
@@ -0,0 +1,92 @@
+import java.util.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 10:09
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 解题思路
+     * root提个二叉搜索树
+     * 二叉查找树（Binary Search Tree），（又：二叉搜索树，二叉排序树）它或者是一棵空树，或者是具有下列性质的二叉树：
+     * 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值；
+     * 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值；
+     * 它的左、右子树也分别为二叉排序树。
+     *
+     * @param root
+     * @return
+     */
+    public int getMinimumDifference(TreeNode root) {
+
+        if (root == null) {
+            return 0;
+        }
+        Deque<TreeNode> s = new LinkedList<>();
+        int min = Integer.MAX_VALUE;
+        int prev = 0;
+        boolean first = true;
+        while (root != null || !s.isEmpty()) {
+            while (root != null) {
+                s.push(root);//先访问再入栈
+                root = root.left;
+            }
+            root = s.pop();
+
+            if (first) {
+                first = false;
+            } else {
+                min = Math.min(min, root.val - prev);
+            }
+
+            prev = root.val;
+            root = root.right;//如果是null，出栈并处理右子树
+        }
+
+        return min;
+    }
+
+    public int getMinimumDifference2(TreeNode root) {
+
+        if (root == null) {
+            return 0;
+        }
+
+        List<Integer> list = new ArrayList<>();
+
+        Deque<TreeNode> queue = new LinkedList<>();
+        queue.add(root);
+        while (!queue.isEmpty()) {
+            TreeNode node = queue.poll();
+            list.add(node.val);
+            if (node.right != null) {
+                queue.addFirst(node.right);
+            }
+            if (node.left != null) {
+                queue.addFirst(node.left);
+            }
+        }
+
+
+        if (list.size() == 1) {
+            return list.get(0);
+        }
+
+        list.sort(new Comparator<Integer>() {
+            @Override
+            public int compare(Integer o1, Integer o2) {
+                return o1 - o2;
+            }
+        });
+
+        int min = Integer.MAX_VALUE;
+
+        for (int i = 1; i < list.size(); i++) {
+            min = Math.min(min, Math.abs(list.get(i - 1) - list.get(i)));
+        }
+
+        return min;
+    }
+}
diff --git a/[0783][Minimum Distance Between BST Nodes]/src/TreeNode.java b/[0783][Minimum Distance Between BST Nodes]/src/TreeNode.java
@@ -0,0 +1,16 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 11:06
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+
+    TreeNode(int x) {
+        val = x;
+    }
+}
