commit

Wang-Jun-Chao · Wang-Jun-Chao · commit ac069b251db8 · 2019-07-06T19:29:41.000+08:00
diff --git a/.idea/encodings.xml b/.idea/encodings.xml
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/[0260][Single Number III]/[0260][Single Number III].iml b/[0260][Single Number III]/[0260][Single Number III].iml
@@ -17,5 +17,7 @@
         <SOURCES />
       </library>
     </orderEntry>
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0287][Find the Duplicate Number]/[0287][Find the Duplicate Number].iml b/[0287][Find the Duplicate Number]/[0287][Find the Duplicate Number].iml
@@ -17,5 +17,7 @@
         <SOURCES />
       </library>
     </orderEntry>
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0338][Counting Bits ]/[0338][Counting Bits ].iml b/[0338][Counting Bits ]/[0338][Counting Bits ].iml
@@ -17,5 +17,7 @@
         <SOURCES />
       </library>
     </orderEntry>
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0347][Top K Frequent Elements]/[0347][Top K Frequent Elements].iml b/[0347][Top K Frequent Elements]/[0347][Top K Frequent Elements].iml
@@ -17,5 +17,7 @@
         <SOURCES />
       </library>
     </orderEntry>
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0459][Repeated Substring Pattern]/[0459][Repeated Substring Pattern].iml b/[0459][Repeated Substring Pattern]/[0459][Repeated Substring Pattern].iml
@@ -7,5 +7,7 @@
     </content>
     <orderEntry type="inheritedJdk" />
     <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0476][Number Complement]/[0476][Number Complement].iml b/[0476][Number Complement]/[0476][Number Complement].iml
@@ -17,5 +17,7 @@
         <SOURCES />
       </library>
     </orderEntry>
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0485][Max Consecutive Ones]/[0485][Max Consecutive Ones].iml b/[0485][Max Consecutive Ones]/[0485][Max Consecutive Ones].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://$MAVEN_REPOSITORY$/junit/junit/4.12/junit-4.12.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/hamcrest/hamcrest-core/1.3/hamcrest-core-1.3.jar!/" />
+        </CLASSES>
+        <JAVADOC />
+        <SOURCES />
+      </library>
+    </orderEntry>
+  </component>
+</module>
diff --git a/[0485][Max Consecutive Ones]/src/Main.java b/[0485][Max Consecutive Ones]/src/Main.java
@@ -0,0 +1,22 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-06 19:20
+ **/
+public class Main {
+    @Test
+    public void test1() {
+        int[] nums = {1, 1, 0, 1, 1, 1};
+        Solution solution = new Solution();
+        Assert.assertEquals(3, solution.findMaxConsecutiveOnes(nums));
+    }
+
+    @Test
+    public void test2() {
+        int[] nums = {0};
+        Solution solution = new Solution();
+        Assert.assertEquals(0, solution.findMaxConsecutiveOnes(nums));
+    }
+}
diff --git a/[0485][Max Consecutive Ones]/src/Solution.java b/[0485][Max Consecutive Ones]/src/Solution.java
@@ -0,0 +1,47 @@
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-06 19:16
+ **/
+public class Solution {
+    /**
+     * <pre>
+     * Given a binary array, find the maximum number of consecutive 1s in this array.
+     *
+     * Example 1:
+     * Input: [1,1,0,1,1,1]
+     * Output: 3
+     * Explanation: The first two digits or the last three digits are consecutive 1s.
+     *     The maximum number of consecutive 1s is 3.
+     * Note:
+     *
+     * The input array will only contain 0 and 1.
+     * The length of input array is a positive integer and will not exceed 10,000
+     * </pre>
+     *
+     * @param nums
+     * @return
+     */
+    public int findMaxConsecutiveOnes(int[] nums) {
+
+        int result = 0;
+        int start = 0;
+        int end;
+        while (start < nums.length) {
+            while (start < nums.length && nums[start] != 1) {
+                start++;
+            }
+
+            end = start + 1;
+            while (end < nums.length && nums[end] == 1) {
+                end++;
+            }
+
+            if (start < nums.length) {
+                result = Math.max(result, end - start);
+            }
+            start = end;
+        }
+
+        return result;
+    }
+}
diff --git a/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml b/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml
@@ -17,5 +17,7 @@
         <SOURCES />
       </library>
     </orderEntry>
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0561][Array Partition I]/[0561][Array Partition I].iml b/[0561][Array Partition I]/[0561][Array Partition I].iml
@@ -17,5 +17,7 @@
         <SOURCES />
       </library>
     </orderEntry>
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml b/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml
@@ -7,5 +7,17 @@
     </content>
     <orderEntry type="inheritedJdk" />
     <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="module-library">
+      <library name="JUnit4">
+        <CLASSES>
+          <root url="jar://$MAVEN_REPOSITORY$/junit/junit/4.12/junit-4.12.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/hamcrest/hamcrest-core/1.3/hamcrest-core-1.3.jar!/" />
+        </CLASSES>
+        <JAVADOC />
+        <SOURCES />
+      </library>
+    </orderEntry>
+    <orderEntry type="library" name="R User Library" level="project" />
+    <orderEntry type="library" name="R Skeletons" level="application" />
   </component>
 </module>
diff --git a/[0617][Merge Two Binary Trees]/src/Main.java b/[0617][Merge Two Binary Trees]/src/Main.java
@@ -0,0 +1,34 @@
+import org.junit.Test;
+
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-04 09:00
+ **/
+public class Main {
+    @Test
+    public void test1() {
+        TreeNode t1  = new TreeNode(1);
+        t1.left = new TreeNode(3);
+        t1.left.left = new TreeNode(5);
+        t1.right = new TreeNode(2);
+
+        TreeNode t2 = new TreeNode(2);
+        t2.left = new TreeNode(1);
+        t2.left.right = new TreeNode(4);
+        t2.right = new TreeNode(3);
+        t2.right.right = new TreeNode(7);
+
+        Solution solution = new Solution();
+
+        TreeNode node = solution.mergeTrees(t1, t2);
+
+        print(node);
+    }
+    private void print(TreeNode node) {
+        if (node != null) {
+            System.out.print(node.val + ", ");
+            print(node.left);
+            print(node.right);
+        }
+    }
+}
diff --git a/[0617][Merge Two Binary Trees]/src/Solution.java b/[0617][Merge Two Binary Trees]/src/Solution.java
@@ -0,0 +1,54 @@
+
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-04 08:57
+ **/
+public class Solution {
+    /**
+     * <pre>
+     * Given two binary trees and imagine that when you put one of them to cover the other,
+     * some nodes of the two trees are overlapped while the others are not.
+     *
+     * You need to merge them into a new binary tree. The merge rule is that if two nodes overlap,
+     * then sum node values up as the new value of the merged node. Otherwise, the NOT null node
+     * will be used as the node of new tree.
+     *
+     * Example 1:
+     *
+     * Input:
+     *         Tree 1                     Tree 2
+     *           1                         2
+     *          / \                       / \
+     *         3   2                     1   3
+     *        /                           \   \
+     *       5                             4   7
+     * Output:
+     * Merged tree:
+     *      3
+     *     / \
+     *    4   5
+     *   / \   \
+     *  5   4   7
+     * </pre>
+     *
+     * @param t1
+     * @param t2
+     * @return
+     */
+    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
+        if (t1 == null) {
+            return t2;
+        }
+
+        if (t2 == null) {
+            return t1;
+        }
+
+        t1.val += t2.val;
+
+        t1.left = mergeTrees(t1.left, t2.left);
+        t1.right = mergeTrees(t1.right, t2.right);
+
+        return t1;
+    }
+}
diff --git a/[0617][Merge Two Binary Trees]/src/TreeNode.java b/[0617][Merge Two Binary Trees]/src/TreeNode.java
@@ -0,0 +1,17 @@
+
+/**
+ * Author: 王俊超
+ * Date: 2015-08-21
+ * Time: 18:45
+ * Declaration: All Rights Reserved !!!
+ */
+public class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+
+    TreeNode(int x) {
+        val = x;
+    }
+}
+
