commit

Wang-Jun-Chao · Wang-Jun-Chao · commit 527c18011db6 · 2019-07-08T20:53:09.000+08:00
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/[0207][Course Schedule]/[0207][Course Schedule].iml b/[0207][Course Schedule]/[0207][Course Schedule].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/[0222][Count Complete Tree Nodes]/[0222][Count Complete Tree Nodes].iml b/[0222][Count Complete Tree Nodes]/[0222][Count Complete Tree 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/[0222][Count Complete Tree Nodes]/src/Solution.java b/[0222][Count Complete Tree Nodes]/src/Solution.java
@@ -0,0 +1,7 @@
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-08 20:52
+ **/
+public class Solution {
+
+}
diff --git a/[0240][Search a 2D Matrix II]/[0240][Search a 2D Matrix II].iml b/[0240][Search a 2D Matrix II]/[0240][Search a 2D Matrix II].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/[0241][Different Ways to Add Parentheses]/[0241][Different Ways to Add Parentheses].iml b/[0241][Different Ways to Add Parentheses]/[0241][Different Ways to Add Parentheses].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/[0292][Nim Game]/[0292][Nim Game].iml b/[0292][Nim Game]/[0292][Nim Game].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/[0292][Nim Game]/src/Solution.java b/[0292][Nim Game]/src/Solution.java
@@ -0,0 +1,39 @@
+/**
+ * https://leetcode.com/problems/nim-game/
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-08 18:39
+ **/
+public class Solution {
+    /**
+     * <pre>
+     * You are playing the following Nim Game with your friend: There is a heap of stones on the table,
+     * each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will
+     * be the winner. You will take the first turn to remove the stones.
+     *
+     * Both of you are very clever and have optimal strategies for the game. Write a function to determine
+     * whether you can win the game given the number of stones in the heap.
+     *
+     * Example:
+     *
+     * Input: 4
+     * Output: false
+     * Explanation: If there are 4 stones in the heap, then you will never win the game;
+     *              No matter 1, 2, or 3 stones you remove, the last stone will always be
+     *              removed by your friend.
+     *
+     * 这题往小说可以追溯到小学奥数或者脑筋急转弯的书中，往大说可以深究到博弈论。然而编程在这里并没有卵用，
+     * 策略在于，因为每个人都取不到4个，假设自己后走，要保证每轮自己和对方取得数量的和是4，这样就能确保每
+     * 轮完后都有4的倍数个石头被取走。这样，如果我们先走的话，先把n除4的余数个石头拿走，这样不管怎样，到最
+     * 后都会留4个下来，对方取1个你就取3个，对方取2个你就取2个，就必赢了。
+     * </pre>
+     * @param n
+     * @return
+     */
+    public boolean canWinNim(int n) {
+        return (n & 0b11) > 0;
+    }
+
+    public boolean canWinNim2(int n) {
+        return n %4 != 0;
+    }
+}
diff --git a/[0427][Construct Quad Tree]/[0427][Construct Quad Tree].iml b/[0427][Construct Quad Tree]/[0427][Construct Quad Tree].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/[0438][Find All Anagrams in a String]/[0438][Find All Anagrams in a String].iml b/[0438][Find All Anagrams in a String]/[0438][Find All Anagrams in a String].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/[0438][Find All Anagrams in a String]/src/Main.java b/[0438][Find All Anagrams in a String]/src/Main.java
@@ -0,0 +1,22 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-08 20:07
+ **/
+public class Main {
+    @Test
+    public void test1() {
+        Solution solution = new Solution();
+        Assert.assertEquals(Arrays.asList(0, 6), solution.findAnagrams("cbaebabacd", "abc"));
+    }
+
+    @Test
+    public void test2() {
+        Solution solution = new Solution();
+        Assert.assertEquals(Arrays.asList(0, 1, 2), solution.findAnagrams("abab", "ab"));
+    }
+}
diff --git a/[0438][Find All Anagrams in a String]/src/Solution.java b/[0438][Find All Anagrams in a String]/src/Solution.java
@@ -0,0 +1,81 @@
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
+import java.util.Objects;
+
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-08 18:59
+ **/
+public class Solution {
+    /**
+     * <pre>
+     * Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.
+     *
+     * Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,100.
+     *
+     * The order of output does not matter.
+     *
+     * Example 1:
+     *
+     * Input:
+     * s: "cbaebabacd" p: "abc"
+     *
+     * Output:
+     * [0, 6]
+     *
+     * Explanation:
+     * The substring with start index = 0 is "cba", which is an anagram of "abc".
+     * The substring with start index = 6 is "bac", which is an anagram of "abc".
+     * Example 2:
+     *
+     * Input:
+     * s: "abab" p: "ab"
+     *
+     * Output:
+     * [0, 1, 2]
+     *
+     * Explanation:
+     * The substring with start index = 0 is "ab", which is an anagram of "ab".
+     * The substring with start index = 1 is "ba", which is an anagram of "ab".
+     * The substring with start index = 2 is "ab", which is an anagram of "ab".
+     * </pre>
+     *
+     * @param s
+     * @param p
+     * @return
+     */
+    public List<Integer> findAnagrams(String s, String p) {
+        List<Integer> result = new LinkedList<>();
+
+        if (s.length() < p.length()) {
+            return result;
+        }
+
+        int[] pArr = new int[26];
+        int[] sArr = new int[26];
+
+        for (int i = 0; i < p.length(); i++) {
+            pArr[p.charAt(i) - 'a']++;
+        }
+
+        for (int i = 0; i < p.length(); i++) {
+            sArr[s.charAt(i) - 'a']++;
+        }
+
+        for (int i = 0; i <= s.length() - p.length(); i++) {
+            if (i > 0) {
+                sArr[s.charAt(i - 1) - 'a']--;
+                sArr[s.charAt(i + p.length() - 1) - 'a']++;
+            }
+
+            if (Arrays.equals(sArr, pArr)  ) {
+                result.add(i);
+            }
+        }
+
+        return result;
+    }
+}
diff --git a/[0438][Find All Anagrams in a String]/src/Solution2.java b/[0438][Find All Anagrams in a String]/src/Solution2.java
@@ -0,0 +1,118 @@
+import java.util.HashMap;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
+import java.util.Objects;
+
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-08 18:59
+ **/
+public class Solution2 {
+    /**
+     * <pre>
+     * Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.
+     *
+     * Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,100.
+     *
+     * The order of output does not matter.
+     *
+     * Example 1:
+     *
+     * Input:
+     * s: "cbaebabacd" p: "abc"
+     *
+     * Output:
+     * [0, 6]
+     *
+     * Explanation:
+     * The substring with start index = 0 is "cba", which is an anagram of "abc".
+     * The substring with start index = 6 is "bac", which is an anagram of "abc".
+     * Example 2:
+     *
+     * Input:
+     * s: "abab" p: "ab"
+     *
+     * Output:
+     * [0, 1, 2]
+     *
+     * Explanation:
+     * The substring with start index = 0 is "ab", which is an anagram of "ab".
+     * The substring with start index = 1 is "ba", which is an anagram of "ab".
+     * The substring with start index = 2 is "ab", which is an anagram of "ab".
+     * </pre>
+     *
+     * @param s
+     * @param p
+     * @return
+     */
+    public List<Integer> findAnagrams(String s, String p) {
+        List<Integer> result = new LinkedList<>();
+
+        if (s.length() < p.length()) {
+            return result;
+        }
+
+        Map<Character, Integer> map1 = getMap(p);
+        Map<Character, Integer> map2 = getMap(s.substring(0, p.length()));
+        for (int i = 0; i <= s.length() - p.length(); i++) {
+
+            char lastChar = s.charAt(i + p.length() - 1);
+            char prevChar;
+            if (i > 0 && (prevChar = s.charAt(i - 1)) != lastChar) {
+                Integer val = map2.get(prevChar);
+                if (val <= 1) {
+                    map2.remove(prevChar);
+                } else {
+                    map2.put(prevChar, val - 1);
+                }
+
+                val = map2.get(lastChar);
+                if (val == null) {
+                    map2.put(lastChar, 1);
+                } else {
+                    map2.put(lastChar, val + 1);
+                }
+            }
+
+            if (equals(map1, map2)) {
+                result.add(i);
+            }
+        }
+        return result;
+    }
+
+    private boolean equals(Map<Character, Integer> map1, Map<Character, Integer> map2) {
+        if (map1.size() == map2.size()) {
+            return contains(map1, map2) && contains(map2, map1);
+        }
+        return false;
+    }
+
+    /**
+     * map1是否包含map2，即map2中的(k, v)都在map1中
+     *
+     * @param map1
+     * @param map2
+     * @return
+     */
+    private boolean contains(Map<Character, Integer> map1, Map<Character, Integer> map2) {
+        for (Map.Entry<Character, Integer> e : map2.entrySet()) {
+            Integer v2 = map1.get(e.getKey());
+            if (!map1.containsKey(e.getKey()) || !Objects.equals(e.getValue(), v2)) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+
+    public Map<Character, Integer> getMap(String s) {
+        Map<Character, Integer> map = new HashMap<>();
+
+        for (int i = 0; i < s.length(); i++) {
+            map.merge(s.charAt(i), 1, Integer::sum);
+        }
+        return map;
+    }
+}
diff --git a/[0485][Max Consecutive Ones]/[0485][Max Consecutive Ones].iml b/[0485][Max Consecutive Ones]/[0485][Max Consecutive Ones].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/[0496][Next Greater Element I]/[0496][Next Greater Element I].iml b/[0496][Next Greater Element I]/[0496][Next Greater Element 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/[0504][Base 7]/[0504][Base 7].iml b/[0504][Base 7]/[0504][Base 7].iml
