From f514c81af82ce992f64fffc869ff316255503815 Mon Sep 17 00:00:00 2001
From: "wangjunchao.o" <wangjunchao.o@bytedance.com>
Date: Fri, 26 Jun 2020 08:54:12 +0800
Subject: [PATCH 01/19] commit

Change-Id: I63bc8e7801545b33d92bfc5d513ae134eacee1d6
---
 .idea/codeStyles/codeStyleConfig.xml          |    5 +
 .idea/encodings.xml                           |    1 +
 .idea/jarRepositories.xml                     |   20 +
 .idea/leetcode/editor.xml                     |   57 +
 .idea/modules.xml                             |    6 +
 .idea/workspace.xml                           | 1101 +++--------------
 [0000][common]/[0000][common].iml             |   26 +
 ...160][Intersection of Two Linked Lists].iml |   11 +
 .../src/ListNode.java                         |    9 +
 .../src/Solution.java                         |  129 ++
 .../[0299][Bulls and Cows].iml                |   21 +
 [0299][Bulls and Cows]/src/Solution.java      |   85 ++
 [0299][Bulls and Cows]/src/TestSolution.java  |   14 +
 .../[0371][Sum of Two Integers].iml           |   11 +
 [0371][Sum of Two Integers]/src/Solution.java |   51 +
 .../src/SolutionTest.java                     |    2 +
 .../[0392][Is Subsequence].iml                |   21 +
 [0392][Is Subsequence]/src/Solution.java      |   82 ++
 [0392][Is Subsequence]/src/SolutionTest.java  |   29 +
 .../[0441][Arranging Coins].iml               |   21 +
 [0441][Arranging Coins]/src/Solution.java     |   84 ++
 [0441][Arranging Coins]/src/SolutionTest.java |   35 +
 .../[0443][String Compression].iml            |   21 +
 [0443][String Compression]/src/Solution.java  |   76 ++
 .../src/SolutionTest.java                     |   41 +
 25 files changed, 1045 insertions(+), 914 deletions(-)
 create mode 100644 .idea/codeStyles/codeStyleConfig.xml
 create mode 100644 .idea/jarRepositories.xml
 create mode 100644 .idea/leetcode/editor.xml
 create mode 100644 [0160][Intersection of Two Linked Lists]/[0160][Intersection of Two Linked Lists].iml
 create mode 100644 [0160][Intersection of Two Linked Lists]/src/ListNode.java
 create mode 100644 [0160][Intersection of Two Linked Lists]/src/Solution.java
 create mode 100644 [0299][Bulls and Cows]/[0299][Bulls and Cows].iml
 create mode 100644 [0299][Bulls and Cows]/src/Solution.java
 create mode 100644 [0299][Bulls and Cows]/src/TestSolution.java
 create mode 100644 [0371][Sum of Two Integers]/[0371][Sum of Two Integers].iml
 create mode 100644 [0371][Sum of Two Integers]/src/Solution.java
 create mode 100644 [0371][Sum of Two Integers]/src/SolutionTest.java
 create mode 100644 [0392][Is Subsequence]/[0392][Is Subsequence].iml
 create mode 100644 [0392][Is Subsequence]/src/Solution.java
 create mode 100644 [0392][Is Subsequence]/src/SolutionTest.java
 create mode 100644 [0441][Arranging Coins]/[0441][Arranging Coins].iml
 create mode 100644 [0441][Arranging Coins]/src/Solution.java
 create mode 100644 [0441][Arranging Coins]/src/SolutionTest.java
 create mode 100644 [0443][String Compression]/[0443][String Compression].iml
 create mode 100644 [0443][String Compression]/src/Solution.java
 create mode 100644 [0443][String Compression]/src/SolutionTest.java

diff --git a/.idea/codeStyles/codeStyleConfig.xml b/.idea/codeStyles/codeStyleConfig.xml
new file mode 100644
index 0000000..a55e7a1
--- /dev/null
+++ b/.idea/codeStyles/codeStyleConfig.xml
@@ -0,0 +1,5 @@
+<component name="ProjectCodeStyleConfiguration">
+  <state>
+    <option name="PREFERRED_PROJECT_CODE_STYLE" value="Default" />
+  </state>
+</component>
\ No newline at end of file
diff --git a/.idea/encodings.xml b/.idea/encodings.xml
index f468859..a444e6c 100644
--- a/.idea/encodings.xml
+++ b/.idea/encodings.xml
@@ -125,6 +125,7 @@
     <file url="file://$PROJECT_DIR$/[0147][Insertion Sort List]/src/ListNode.java" charset="GB2312" />
     <file url="file://$PROJECT_DIR$/[0148][Sort List]/src/ListNode.java" charset="GB2312" />
     <file url="file://$PROJECT_DIR$/[0150][Evaluate Reverse Polish Notation]/src/Solution.java" charset="GB2312" />
+    <file url="file://$PROJECT_DIR$/[0155][Min Stack]/src/MinStack.java" charset="GB2312" />
     <file url="file://$PROJECT_DIR$/[0162][Find Peak Element]/src/Solution.java" charset="GB2312" />
     <file url="file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/src/TreeNode.java" charset="GB2312" />
     <file url="file://$PROJECT_DIR$/[0206][Reverse Linked List]/src/ListNode.java" charset="GB2312" />
diff --git a/.idea/jarRepositories.xml b/.idea/jarRepositories.xml
new file mode 100644
index 0000000..712ab9d
--- /dev/null
+++ b/.idea/jarRepositories.xml
@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="RemoteRepositoriesConfiguration">
+    <remote-repository>
+      <option name="id" value="central" />
+      <option name="name" value="Central Repository" />
+      <option name="url" value="https://repo.maven.apache.org/maven2" />
+    </remote-repository>
+    <remote-repository>
+      <option name="id" value="central" />
+      <option name="name" value="Maven Central repository" />
+      <option name="url" value="https://repo1.maven.org/maven2" />
+    </remote-repository>
+    <remote-repository>
+      <option name="id" value="jboss.community" />
+      <option name="name" value="JBoss Community repository" />
+      <option name="url" value="https://repository.jboss.org/nexus/content/repositories/public/" />
+    </remote-repository>
+  </component>
+</project>
\ No newline at end of file
diff --git a/.idea/leetcode/editor.xml b/.idea/leetcode/editor.xml
new file mode 100644
index 0000000..27dc992
--- /dev/null
+++ b/.idea/leetcode/editor.xml
@@ -0,0 +1,57 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="LeetcodeEditor">
+    <option name="projectConfig">
+      <map>
+        <entry key="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[160]Intersection of Two Linked Lists.java">
+          <value>
+            <LeetcodeEditor>
+              <option name="path" value="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[160]Intersection of Two Linked Lists.java" />
+              <option name="questionId" value="160" />
+            </LeetcodeEditor>
+          </value>
+        </entry>
+        <entry key="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[1]Two Sum.java">
+          <value>
+            <LeetcodeEditor>
+              <option name="path" value="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[1]Two Sum.java" />
+              <option name="questionId" value="1" />
+            </LeetcodeEditor>
+          </value>
+        </entry>
+        <entry key="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[299]Bulls and Cows.java">
+          <value>
+            <LeetcodeEditor>
+              <option name="path" value="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[299]Bulls and Cows.java" />
+              <option name="questionId" value="299" />
+            </LeetcodeEditor>
+          </value>
+        </entry>
+        <entry key="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[371]Sum of Two Integers.java">
+          <value>
+            <LeetcodeEditor>
+              <option name="path" value="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[371]Sum of Two Integers.java" />
+              <option name="questionId" value="371" />
+            </LeetcodeEditor>
+          </value>
+        </entry>
+        <entry key="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[392]Is Subsequence.java">
+          <value>
+            <LeetcodeEditor>
+              <option name="path" value="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[392]Is Subsequence.java" />
+              <option name="questionId" value="392" />
+            </LeetcodeEditor>
+          </value>
+        </entry>
+        <entry key="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[441]Arranging Coins.java">
+          <value>
+            <LeetcodeEditor>
+              <option name="path" value="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[441]Arranging Coins.java" />
+              <option name="questionId" value="441" />
+            </LeetcodeEditor>
+          </value>
+        </entry>
+      </map>
+    </option>
+  </component>
+</project>
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
index 2b7023a..1268fe5 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -146,6 +146,7 @@
       <module fileurl="file://$PROJECT_DIR$/[0153][Find Minimum In Rotated Sorted Array]/[0153][Find Minimum In Rotated Sorted Array].iml" filepath="$PROJECT_DIR$/[0153][Find Minimum In Rotated Sorted Array]/[0153][Find Minimum In Rotated Sorted Array].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0154][Find Minimum In Rotated Sorted Array II]/[0154][Find Minimum In Rotated Sorted Array II].iml" filepath="$PROJECT_DIR$/[0154][Find Minimum In Rotated Sorted Array II]/[0154][Find Minimum In Rotated Sorted Array II].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0155][Min Stack]/[0155][Min Stack].iml" filepath="$PROJECT_DIR$/[0155][Min Stack]/[0155][Min Stack].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0160][Intersection of Two Linked Lists]/[0160][Intersection of Two Linked Lists].iml" filepath="$PROJECT_DIR$/[0160][Intersection of Two Linked Lists]/[0160][Intersection of Two Linked Lists].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0162][Find Peak Element]/[0162][Find Peak Element].iml" filepath="$PROJECT_DIR$/[0162][Find Peak Element]/[0162][Find Peak Element].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0167][Two Sum II - Input array is sorted]/[0167][Two Sum II - Input array is sorted].iml" filepath="$PROJECT_DIR$/[0167][Two Sum II - Input array is sorted]/[0167][Two Sum II - Input array is sorted].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/[0173][Binary Search Tree Iterator].iml" filepath="$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/[0173][Binary Search Tree Iterator].iml" />
@@ -190,6 +191,7 @@
       <module fileurl="file://$PROJECT_DIR$/[0287][Find the Duplicate Number]/[0287][Find the Duplicate Number].iml" filepath="$PROJECT_DIR$/[0287][Find the Duplicate Number]/[0287][Find the Duplicate Number].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0290][Word Pattern]/[0290][Word Pattern].iml" filepath="$PROJECT_DIR$/[0290][Word Pattern]/[0290][Word Pattern].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0292][Nim Game]/[0292][Nim Game].iml" filepath="$PROJECT_DIR$/[0292][Nim Game]/[0292][Nim Game].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0299][Bulls and Cows]/[0299][Bulls and Cows].iml" filepath="$PROJECT_DIR$/[0299][Bulls and Cows]/[0299][Bulls and Cows].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0303][Range Sum Query - Immutable]/[0303][Range Sum Query - Immutable].iml" filepath="$PROJECT_DIR$/[0303][Range Sum Query - Immutable]/[0303][Range Sum Query - Immutable].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0326][Power of Three]/[0326][Power of Three].iml" filepath="$PROJECT_DIR$/[0326][Power of Three]/[0326][Power of Three].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0338][Counting Bits ]/[0338][Counting Bits ].iml" filepath="$PROJECT_DIR$/[0338][Counting Bits ]/[0338][Counting Bits ].iml" />
@@ -200,11 +202,13 @@
       <module fileurl="file://$PROJECT_DIR$/[0349][Intersection of Two Arrays]/[0349][Intersection of Two Arrays].iml" filepath="$PROJECT_DIR$/[0349][Intersection of Two Arrays]/[0349][Intersection of Two Arrays].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0350][Intersection of Two Arrays II]/[0350][Intersection of Two Arrays II].iml" filepath="$PROJECT_DIR$/[0350][Intersection of Two Arrays II]/[0350][Intersection of Two Arrays II].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0367][Valid Perfect Square]/[0367][Valid Perfect Square].iml" filepath="$PROJECT_DIR$/[0367][Valid Perfect Square]/[0367][Valid Perfect Square].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0371][Sum of Two Integers]/[0371][Sum of Two Integers].iml" filepath="$PROJECT_DIR$/[0371][Sum of Two Integers]/[0371][Sum of Two Integers].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0374][Guess Number Higher or Lower]/[0374][Guess Number Higher or Lower].iml" filepath="$PROJECT_DIR$/[0374][Guess Number Higher or Lower]/[0374][Guess Number Higher or Lower].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0383][Ransom Note]/[0383][Ransom Note].iml" filepath="$PROJECT_DIR$/[0383][Ransom Note]/[0383][Ransom Note].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0384][Shuffle an Array]/[0384][Shuffle an Array].iml" filepath="$PROJECT_DIR$/[0384][Shuffle an Array]/[0384][Shuffle an Array].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0387][First Unique Character in a String]/[0387][First Unique Character in a String].iml" filepath="$PROJECT_DIR$/[0387][First Unique Character in a String]/[0387][First Unique Character in a String].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0389][Find the Difference]/[0389][Find the Difference].iml" filepath="$PROJECT_DIR$/[0389][Find the Difference]/[0389][Find the Difference].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0392][Is Subsequence]/[0392][Is Subsequence].iml" filepath="$PROJECT_DIR$/[0392][Is Subsequence]/[0392][Is Subsequence].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0400][Nth Digit]/[0400][Nth Digit].iml" filepath="$PROJECT_DIR$/[0400][Nth Digit]/[0400][Nth Digit].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0401][Binary Watch]/[0401][Binary Watch].iml" filepath="$PROJECT_DIR$/[0401][Binary Watch]/[0401][Binary Watch].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0404][Sum of Left Leaves]/[0404][Sum of Left Leaves].iml" filepath="$PROJECT_DIR$/[0404][Sum of Left Leaves]/[0404][Sum of Left Leaves].iml" />
@@ -219,7 +223,9 @@
       <module fileurl="file://$PROJECT_DIR$/[0434][Number of Segments in a String]/[0434][Number of Segments in a String].iml" filepath="$PROJECT_DIR$/[0434][Number of Segments in a String]/[0434][Number of Segments in a String].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0437][Path Sum III]/[0437][Path Sum III].iml" filepath="$PROJECT_DIR$/[0437][Path Sum III]/[0437][Path Sum III].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0438][Find All Anagrams in a String]/[0438][Find All Anagrams in a String].iml" filepath="$PROJECT_DIR$/[0438][Find All Anagrams in a String]/[0438][Find All Anagrams in a String].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0441][Arranging Coins]/[0441][Arranging Coins].iml" filepath="$PROJECT_DIR$/[0441][Arranging Coins]/[0441][Arranging Coins].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/[0442][Find All Duplicates in an Array].iml" filepath="$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/[0442][Find All Duplicates in an Array].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0443][String Compression]/[0443][String Compression].iml" filepath="$PROJECT_DIR$/[0443][String Compression]/[0443][String Compression].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0448][Find All Numbers Disappeared in an Array]/[0448][Find All Numbers Disappeared in an Array].iml" filepath="$PROJECT_DIR$/[0448][Find All Numbers Disappeared in an Array]/[0448][Find All Numbers Disappeared in an Array].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0455][Assign Cookies]/[0455][Assign Cookies].iml" filepath="$PROJECT_DIR$/[0455][Assign Cookies]/[0455][Assign Cookies].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0459][Repeated Substring Pattern]/[0459][Repeated Substring Pattern].iml" filepath="$PROJECT_DIR$/[0459][Repeated Substring Pattern]/[0459][Repeated Substring Pattern].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index e736be2..f0fc058 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -1,140 +1,44 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <project version="4">
-  <component name="BookmarkManager">
-    <bookmark url="file://$PROJECT_DIR$/[0227][Basic Calculator II]/src/Solution.java" line="96" mnemonic="8" />
-  </component>
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[1089][Duplicate Zeros]/[1089][Duplicate Zeros].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Main.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[1108][Defanging an IP Address]/[1108][Defanging an IP Address].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[1108][Defanging an IP Address]/src/Main.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[1108][Defanging an IP Address]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/.idea/codeStyles/codeStyleConfig.xml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/.idea/jarRepositories.xml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/.idea/leetcode/editor.xml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0160][Intersection of Two Linked Lists]/[0160][Intersection of Two Linked Lists].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0160][Intersection of Two Linked Lists]/src/ListNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0160][Intersection of Two Linked Lists]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0299][Bulls and Cows]/[0299][Bulls and Cows].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0299][Bulls and Cows]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0299][Bulls and Cows]/src/TestSolution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0371][Sum of Two Integers]/[0371][Sum of Two Integers].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0371][Sum of Two Integers]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0371][Sum of Two Integers]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0392][Is Subsequence]/[0392][Is Subsequence].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0392][Is Subsequence]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0392][Is Subsequence]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0441][Arranging Coins]/[0441][Arranging Coins].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0441][Arranging Coins]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0441][Arranging Coins]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0443][String Compression]/[0443][String Compression].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0443][String Compression]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0443][String Compression]/src/SolutionTest.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/.idea/encodings.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/encodings.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/[0000][common]/[0000][common].iml" beforeDir="false" afterPath="$PROJECT_DIR$/[0000][common]/[0000][common].iml" afterDir="false" />
     </list>
-    <ignored path="$PROJECT_DIR$/out/" />
-    <ignored path="$PROJECT_DIR$/target/" />
-    <option name="EXCLUDED_CONVERTED_TO_IGNORED" value="true" />
     <option name="SHOW_DIALOG" value="false" />
     <option name="HIGHLIGHT_CONFLICTS" value="true" />
     <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
     <option name="LAST_RESOLUTION" value="IGNORE" />
   </component>
+  <component name="CodeStyleSettingsInfer">
+    <option name="done" value="true" />
+  </component>
   <component name="DefaultGradleProjectSettings">
     <option name="isMigrated" value="true" />
   </component>
-  <component name="FileEditorManager">
-    <leaf SIDE_TABS_SIZE_LIMIT_KEY="300">
-      <file pinned="false" current-in-tab="false">
-        <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/locks/AbstractQueuedSynchronizer.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="297">
-              <caret line="752" selection-start-line="752" selection-end-line="752" />
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="false">
-        <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/ConcurrentHashMap.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="712">
-              <caret line="2335" column="24" selection-start-line="2335" selection-start-column="24" selection-end-line="2335" selection-end-column="24" />
-              <folding>
-                <element signature="e#32334#32335#0" expanded="true" />
-                <element signature="e#32385#32386#0" expanded="true" />
-                <element signature="e#44347#44348#0" expanded="true" />
-                <element signature="e#44395#44396#0" expanded="true" />
-              </folding>
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="false">
-        <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/ConcurrentSkipListMap.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="-530">
-              <caret line="816" column="14" selection-start-line="816" selection-start-column="14" selection-end-line="816" selection-end-column="14" />
-              <folding>
-                <element signature="e#26136#26137#0" expanded="true" />
-                <element signature="e#26215#26216#0" expanded="true" />
-              </folding>
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/[1108][Defanging an IP Address]/src/Solution.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="207">
-              <caret line="15" column="6" selection-end-line="48" />
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="true">
-        <entry file="file://$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Solution.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="306">
-              <caret line="18" column="9" selection-end-line="21" />
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Main.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="204">
-              <caret line="12" column="29" selection-start-line="12" selection-start-column="29" selection-end-line="12" selection-end-column="29" />
-              <folding>
-                <element signature="imports" expanded="true" />
-              </folding>
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/[1108][Defanging an IP Address]/src/Main.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="247">
-              <caret line="19" column="65" selection-start-line="19" selection-start-column="65" selection-end-line="19" selection-end-column="65" />
-              <folding>
-                <element signature="imports" expanded="true" />
-              </folding>
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="false">
-        <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/ConcurrentNavigableMap.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="306">
-              <caret line="51" column="17" selection-start-line="51" selection-start-column="17" selection-end-line="51" selection-end-column="17" />
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="false">
-        <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/jre/lib/rt.jar!/sun/misc/Unsafe.class">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="240">
-              <caret line="42" column="25" selection-start-line="42" selection-start-column="25" selection-end-line="42" selection-end-column="25" />
-            </state>
-          </provider>
-        </entry>
-      </file>
-      <file pinned="false" current-in-tab="false">
-        <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/jre/lib/rt.jar!/sun/reflect/CallerSensitive.class">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="136">
-              <caret line="14" column="18" selection-start-line="14" selection-start-column="18" selection-end-line="14" selection-end-column="18" />
-            </state>
-          </provider>
-        </entry>
-      </file>
-    </leaf>
-  </component>
   <component name="FileTemplateManagerImpl">
     <option name="RECENT_TEMPLATES">
       <list>
@@ -142,191 +46,22 @@
       </list>
     </option>
   </component>
-  <component name="FindInProjectRecents">
-    <findStrings>
-      <find>】</find>
-      <find>excludeEnd2</find>
-      <find>28</find>
-      <find>*c</find>
-      <find>83794</find>
-      <find>gray code</find>
-      <find>gas stat</find>
-      <find>vec</find>
-      <find>atoi</find>
-      <find>/[</find>
-      <find>[</find>
-      <find>]</find>
-    </findStrings>
-    <replaceStrings>
-      <replace>]</replace>
-      <replace>nums1.length</replace>
-      <replace>nums2.length</replace>
-      <replace>nums[a]</replace>
-      <replace>nums[b]</replace>
-      <replace>nums[c]</replace>
-      <replace>array</replace>
-      <replace>/[0</replace>
-      <replace>{</replace>
-      <replace>}</replace>
-    </replaceStrings>
-    <dirStrings>
-      <dir>$PROJECT_DIR$/[128][Longest Consecutive Sequence]/src</dir>
-      <dir>$PROJECT_DIR$/[0500][Keyboard Row]/src</dir>
-    </dirStrings>
-  </component>
   <component name="Git.Settings">
     <option name="RECENT_GIT_ROOT_PATH" value="$PROJECT_DIR$" />
   </component>
-  <component name="IdeDocumentHistory">
-    <option name="CHANGED_PATHS">
-      <list>
-        <option value="$PROJECT_DIR$/[0241][Different Ways to Add Parentheses]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0427][Construct Quad Tree]/src/Soultion.java" />
-        <option value="$PROJECT_DIR$/[0427][Construct Quad Tree]/src/Node.java" />
-        <option value="$PROJECT_DIR$/[0427][Construct Quad Tree]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0427][Construct Quad Tree]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0207][Course Schedule]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0207][Course Schedule]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0292][Nim Game]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0438][Find All Anagrams in a String]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0438][Find All Anagrams in a String]/src/Solution2.java" />
-        <option value="$PROJECT_DIR$/[0438][Find All Anagrams in a String]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0222][Count Complete Tree Nodes]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0222][Count Complete Tree Nodes]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0400][Nth Digit]/src/Solution2.java" />
-        <option value="$PROJECT_DIR$/[0400][Nth Digit]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0412][Fizz Buzz]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0412][Fizz Buzz]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0434][Number of Segments in a String]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0434][Number of Segments in a String]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0459][Repeated Substring Pattern]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0459][Repeated Substring Pattern]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0969][Pancake Sorting]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0969][Pancake Sorting]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/src/TreeNode.java" />
-        <option value="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0455][Assign Cookies]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0455][Assign Cookies]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0475][Heaters]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0475][Heaters]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0482][License Key Formatting]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0482][License Key Formatting]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0492][Construct the Rectangle]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0492][Construct the Rectangle]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0227][Basic Calculator II]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0227][Basic Calculator II]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0228][Summary Ranges]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0228][Summary Ranges]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0500][Keyboard Row]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0500][Keyboard Row]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0419][Battleships in a Board]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[0419][Battleships in a Board]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/src/Solution2.java" />
-        <option value="$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[1108][Defanging an IP Address]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[1108][Defanging an IP Address]/src/Solution.java" />
-        <option value="$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Main.java" />
-        <option value="$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Solution.java" />
-      </list>
-    </option>
-  </component>
-  <component name="MavenImportPreferences">
-    <option name="importingSettings">
-      <MavenImportingSettings>
-        <option name="importAutomatically" value="true" />
-      </MavenImportingSettings>
-    </option>
-  </component>
-  <component name="ProjectFrameBounds">
-    <option name="x" value="214" />
-    <option name="y" value="51" />
-    <option name="width" value="1053" />
-    <option name="height" value="659" />
+  <component name="ProjectCodeStyleSettingsMigration">
+    <option name="version" value="1" />
   </component>
+  <component name="ProjectId" id="1diQ0TR3WBzzDmLO9X2QBaTgnNM" />
   <component name="ProjectLevelVcsManager">
     <ConfirmationsSetting value="2" id="Add" />
   </component>
-  <component name="ProjectView">
-    <navigator proportions="" version="1">
-      <showMembers ProjectPane="false" />
-      <foldersAlwaysOnTop value="true" />
-    </navigator>
-    <panes>
-      <pane id="Scope" />
-      <pane id="PackagesPane" />
-      <pane id="ProjectPane">
-        <subPane>
-          <expand>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[0442][Find All Duplicates in an Array]" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[0442][Find All Duplicates in an Array]" type="462c0819:PsiDirectoryNode" />
-              <item name="src" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[0496][Next Greater Element I]" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[0496][Next Greater Element I]" type="462c0819:PsiDirectoryNode" />
-              <item name="src" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[0500][Keyboard Row]" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[0501][Find Mode in Binary Search Tree]" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[0501][Find Mode in Binary Search Tree]" type="462c0819:PsiDirectoryNode" />
-              <item name="src" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[1089][Duplicate Zeros]" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[1108][Defanging an IP Address]" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="leetcode" type="b2602c69:ProjectViewProjectNode" />
-              <item name="leetcode" type="462c0819:PsiDirectoryNode" />
-              <item name="[1108][Defanging an IP Address]" type="462c0819:PsiDirectoryNode" />
-              <item name="src" type="462c0819:PsiDirectoryNode" />
-            </path>
-          </expand>
-          <select />
-        </subPane>
-      </pane>
-    </panes>
+  <component name="ProjectViewState">
+    <option name="hideEmptyMiddlePackages" value="true" />
+    <option name="showLibraryContents" value="true" />
   </component>
   <component name="PropertiesComponent">
-    <property name="Downloaded.Files.Path.Enabled" value="false" />
+    <property name="Downloaded.Files.Path.Enabled" value="true" />
     <property name="GO_FMT" value="true" />
     <property name="Repository.Attach.Annotations" value="false" />
     <property name="Repository.Attach.JavaDocs" value="false" />
@@ -338,10 +73,11 @@
     <property name="extract.method.default.visibility" value="private" />
     <property name="go.gopath.indexing.explicitly.defined" value="true" />
     <property name="go.import.settings.migrated" value="true" />
+    <property name="jdk.selected.JAVA_MODULE" value="14" />
     <property name="project.structure.last.edited" value="Modules" />
     <property name="project.structure.proportion" value="0.124843955" />
     <property name="project.structure.side.proportion" value="0.29248658" />
-    <property name="settings.editor.selected.configurable" value="preferences.lookFeel" />
+    <property name="settings.editor.selected.configurable" value="fileTemplates" />
   </component>
   <component name="RecentsManager">
     <key name="CreateClassDialog.RecentsKey">
@@ -355,82 +91,81 @@
       <recent name="$PROJECT_DIR$" />
     </key>
   </component>
-  <component name="RunDashboard">
-    <option name="ruleStates">
-      <list>
-        <RuleState>
-          <option name="name" value="ConfigurationTypeDashboardGroupingRule" />
-        </RuleState>
-        <RuleState>
-          <option name="name" value="StatusDashboardGroupingRule" />
-        </RuleState>
-      </list>
-    </option>
-  </component>
-  <component name="RunManager" selected="JUnit.Main.test1 (2)">
-    <configuration name="Main (2)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0419][Battleships in a Board]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.test1 (2)">
+    <configuration name="Main.test1 (2)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[1089][Duplicate Zeros]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="Main" />
-      <option name="TEST_OBJECT" value="class" />
+      <option name="METHOD_NAME" value="test1" />
+      <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
       </method>
     </configuration>
-    <configuration name="Main.test1 (2)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[1089][Duplicate Zeros]" />
+    <configuration name="SolutionTest.test1 (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0441][Arranging Coins]" />
       <option name="PACKAGE_NAME" value="" />
-      <option name="MAIN_CLASS_NAME" value="Main" />
+      <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
+        <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="Main.test1 (3)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[1108][Defanging an IP Address]" />
+    <configuration name="SolutionTest.test1 (2)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0443][String Compression]" />
       <option name="PACKAGE_NAME" value="" />
-      <option name="MAIN_CLASS_NAME" value="Main" />
+      <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
+        <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="Main.test1" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0442][Find All Duplicates in an Array]" />
+    <configuration name="SolutionTest.test1" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0392][Is Subsequence]" />
       <option name="PACKAGE_NAME" value="" />
-      <option name="MAIN_CLASS_NAME" value="Main" />
+      <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
+        <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="Main.test2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[1108][Defanging an IP Address]" />
+    <configuration name="TestSolution.test1" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0299][Bulls and Cows]" />
       <option name="PACKAGE_NAME" value="" />
-      <option name="MAIN_CLASS_NAME" value="Main" />
-      <option name="METHOD_NAME" value="test2" />
+      <option name="MAIN_CLASS_NAME" value="TestSolution" />
+      <option name="METHOD_NAME" value="test1" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
       </method>
     </configuration>
+    <configuration default="true" type="JUnit" factoryName="JUnit">
+      <option name="TEST_OBJECT" value="class" />
+      <method v="2">
+        <option name="Make" enabled="true" />
+        <option name="BSP.BeforeRunTask" enabled="true" />
+      </method>
+    </configuration>
     <list>
-      <item itemvalue="JUnit.Main (2)" />
-      <item itemvalue="JUnit.Main.test1" />
-      <item itemvalue="JUnit.Main.test1 (3)" />
-      <item itemvalue="JUnit.Main.test2" />
       <item itemvalue="JUnit.Main.test1 (2)" />
+      <item itemvalue="JUnit.TestSolution.test1" />
+      <item itemvalue="JUnit.SolutionTest.test1" />
+      <item itemvalue="JUnit.SolutionTest.test1 (1)" />
+      <item itemvalue="JUnit.SolutionTest.test1 (2)" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.test1 (2)" />
+        <item itemvalue="JUnit.SolutionTest.test1 (1)" />
+        <item itemvalue="JUnit.SolutionTest.test1" />
+        <item itemvalue="JUnit.TestSolution.test1" />
         <item itemvalue="JUnit.Main.test1 (2)" />
-        <item itemvalue="JUnit.Main.test2" />
-        <item itemvalue="JUnit.Main.test1 (3)" />
-        <item itemvalue="JUnit.Main.test1" />
-        <item itemvalue="JUnit.Main (2)" />
       </list>
     </recent_temporary>
   </component>
@@ -484,6 +219,9 @@
       <workItem from="1562658774825" duration="11207000" />
       <workItem from="1562718103934" duration="22830000" />
       <workItem from="1562853743876" duration="3513000" />
+      <workItem from="1592905214169" duration="3698000" />
+      <workItem from="1592917353315" duration="5231000" />
+      <workItem from="1592990527553" duration="8280000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -831,348 +569,341 @@
     <option name="localTasksCounter" value="89" />
     <servers />
   </component>
-  <component name="TestHistory">
-    <history-entry file="Main_test1_(1) - 2019.07.11 at 11h 36m 16s.xml">
-      <configuration name="Main.test1 (1)" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_(2) - 2019.07.11 at 13h 37m 16s.xml">
-      <configuration name="Main (2)" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_test1 - 2019.07.11 at 14h 10m 16s.xml">
-      <configuration name="Main.test1" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_test1 - 2019.07.11 at 14h 10m 38s.xml">
-      <configuration name="Main.test1" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_test1 - 2019.07.11 at 14h 12m 07s.xml">
-      <configuration name="Main.test1" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_test1_(3) - 2019.07.12 at 08h 39m 27s.xml">
-      <configuration name="Main.test1 (3)" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_test2 - 2019.07.12 at 08h 39m 58s.xml">
-      <configuration name="Main.test2" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_test1_(2) - 2019.07.12 at 08h 56m 01s.xml">
-      <configuration name="Main.test1 (2)" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_test1_(2) - 2019.07.12 at 08h 57m 00s.xml">
-      <configuration name="Main.test1 (2)" configurationId="JUnit" />
-    </history-entry>
-    <history-entry file="Main_test1_(2) - 2019.07.12 at 08h 57m 15s.xml">
-      <configuration name="Main.test1 (2)" configurationId="JUnit" />
-    </history-entry>
-  </component>
-  <component name="TimeTrackingManager">
-    <option name="totallyTimeSpent" value="302605000" />
-  </component>
-  <component name="ToolWindowManager">
-    <frame x="212" y="132" width="1053" height="659" extended-state="0" />
-    <editor active="true" />
-    <layout>
-      <window_info content_ui="combo" id="Project" order="0" sideWeight="0.4973262" visible="true" weight="0.32181638" />
-      <window_info id="JRebel" order="1" side_tool="true" />
-      <window_info id="Designer" order="2" />
-      <window_info id="UI Designer" order="3" />
-      <window_info id="Favorites" order="4" side_tool="true" />
-      <window_info id="Structure" order="5" sideWeight="0.5026738" weight="0.3573544" />
-      <window_info anchor="bottom" id="Message" order="0" />
-      <window_info anchor="bottom" id="Find" order="1" sideWeight="0.49889788" weight="0.3027523" />
-      <window_info anchor="bottom" id="Run" order="2" weight="0.2813642" />
-      <window_info anchor="bottom" id="Debug" order="3" sideWeight="0.4981631" weight="0.67155963" />
-      <window_info anchor="bottom" id="Cvs" order="4" weight="0.25" />
-      <window_info anchor="bottom" id="Inspection" order="5" weight="0.4" />
-      <window_info anchor="bottom" id="TODO" order="6" />
-      <window_info anchor="bottom" id="Version Control" order="7" weight="0.32896462" />
-      <window_info anchor="bottom" id="Database Changes" order="8" show_stripe_button="false" />
-      <window_info anchor="bottom" id="Docker" order="9" weight="0.32896462" />
-      <window_info anchor="bottom" id="Terminal" order="10" sideWeight="0.5879479" weight="0.19583334" />
-      <window_info anchor="bottom" id="Event Log" order="11" sideWeight="0.5018369" side_tool="true" weight="0.4416776" />
-      <window_info anchor="bottom" id="Messages" order="12" weight="0.327654" />
-      <window_info anchor="bottom" id="JRebel Console" order="13" side_tool="true" />
-      <window_info anchor="bottom" id="JRebel Executor" order="14" />
-      <window_info anchor="bottom" id="MyBatis Sql Log" order="15" />
-      <window_info anchor="bottom" id="Thumbnails" order="16" weight="0.2372215" />
-      <window_info anchor="bottom" id="MyBatis Log" order="17" />
-      <window_info anchor="right" id="Commander" internal_type="SLIDING" order="0" type="SLIDING" weight="0.4" />
-      <window_info anchor="right" id="Ant Build" order="1" weight="0.25" />
-      <window_info anchor="right" content_ui="combo" id="Hierarchy" order="2" weight="0.25" />
-      <window_info anchor="right" id="Palette" order="3" />
-      <window_info anchor="right" id="Database" order="4" />
-      <window_info anchor="right" id="Palette&#9;" order="5" />
-      <window_info anchor="right" id="Maven Projects" order="6" />
-      <window_info anchor="right" id="Maven" order="7" />
-      <window_info anchor="right" id="Key Promoter X" order="8" />
-      <window_info anchor="right" id="R Packages" order="9" />
-      <window_info anchor="right" id="R Graphics" order="10" />
-      <window_info anchor="right" id="SciView" order="11" />
-    </layout>
-  </component>
   <component name="TypeScriptGeneratedFilesManager">
-    <option name="version" value="1" />
+    <option name="version" value="2" />
   </component>
   <component name="VcsManagerConfiguration">
     <MESSAGE value="commit" />
     <option name="LAST_COMMIT_MESSAGE" value="commit" />
   </component>
+  <component name="WindowStateProjectService">
+    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog" timestamp="1593127395403">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog/0.0.1440.900@0.0.1440.900" timestamp="1593127395403" />
+    <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog" timestamp="1592906253060">
+      <screen x="1440" y="0" width="1920" height="1080" />
+    </state>
+    <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
+    <state width="1400" height="435" key="GridCell.Tab.0.bottom" timestamp="1593132082984">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state width="1400" height="435" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593132082984" />
+    <state width="1880" height="283" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
+    <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
+    <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
+    <state width="1400" height="435" key="GridCell.Tab.0.center" timestamp="1593132082983">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state width="1400" height="435" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593132082983" />
+    <state width="1880" height="283" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
+    <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
+    <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
+    <state width="1400" height="435" key="GridCell.Tab.0.left" timestamp="1593132082982">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state width="1400" height="435" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593132082982" />
+    <state width="1880" height="283" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
+    <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
+    <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
+    <state width="1400" height="435" key="GridCell.Tab.0.right" timestamp="1593132082983">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state width="1400" height="435" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593132082983" />
+    <state width="1880" height="283" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
+    <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
+    <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
+    <state width="1400" height="435" key="GridCell.Tab.1.bottom" timestamp="1593132083162">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state width="1400" height="435" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593132083162" />
+    <state width="1400" height="435" key="GridCell.Tab.1.center" timestamp="1593132083161">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state width="1400" height="435" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593132083161" />
+    <state width="1400" height="435" key="GridCell.Tab.1.left" timestamp="1593132083161">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state width="1400" height="435" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593132083161" />
+    <state width="1400" height="435" key="GridCell.Tab.1.right" timestamp="1593132083162">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state width="1400" height="435" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593132083162" />
+    <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog" timestamp="1593127668706">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog/0.0.1440.900@0.0.1440.900" timestamp="1593127668706" />
+    <state x="328" y="211" key="IDE.errors.dialog/44.23.1396.877@44.23.1396.877" timestamp="1592952525283" />
+    <state x="1929" y="250" key="RollbackChangesDialog" timestamp="1592905880584">
+      <screen x="1440" y="0" width="1920" height="1080" />
+    </state>
+    <state x="1929" y="250" key="RollbackChangesDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905880584" />
+    <state x="1613" y="110" width="1062" height="722" key="SettingsEditor" timestamp="1592966837093">
+      <screen x="1440" y="23" width="1920" height="1057" />
+    </state>
+    <state x="1939" y="179" width="1089" height="722" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592907781087" />
+    <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
+    <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
+    <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593129124079">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593129124079" />
+    <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905485465" />
+    <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
+    <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
+    <state x="402" y="49" width="636" height="801" key="find.popup" timestamp="1593129085788">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593129085788" />
+    <state x="0" y="127" key="new project wizard" timestamp="1593127731622">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="0" y="127" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593127731622" />
+    <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592908078144" />
+    <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
+    <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
+    <state x="504" y="218" key="search.everywhere.popup" timestamp="1593065008140">
+      <screen x="52" y="23" width="1388" height="877" />
+    </state>
+    <state x="2065" y="258" key="search.everywhere.popup/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592965788430" />
+    <state x="504" y="218" key="search.everywhere.popup/52.23.1388.877@52.23.1388.877" timestamp="1593065008140" />
+  </component>
   <component name="XDebuggerManager">
     <breakpoint-manager>
       <breakpoints>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/【237】【Delete Node in a Linked List】/src/Solution.java</url>
           <line>19</line>
-          <properties />
           <option name="timeStamp" value="2" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/【278】【First Bad Version】/src/Solution.java</url>
           <line>20</line>
-          <properties />
           <option name="timeStamp" value="4" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/【080】【Remove Duplicates from Sorted Array II】/src/Solution.java</url>
           <line>14</line>
-          <properties />
           <option name="timeStamp" value="5" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <condition expression="start2 + k - 1 &gt;= nums2.length" language="JAVA" />
           <url>file://$PROJECT_DIR$/[004][Median of Two Sorted Arrays]/src/Solution.java</url>
           <line>53</line>
-          <properties />
           <option name="timeStamp" value="11" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[128][Longest Consecutive Sequence]/src/Solution.java</url>
           <line>52</line>
-          <properties />
           <option name="timeStamp" value="12" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[031][Next Permutation]/src/Solution.java</url>
           <line>37</line>
-          <properties />
           <option name="timeStamp" value="27" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[000][common]/src/MaxSubArray.java</url>
           <line>31</line>
-          <properties />
           <option name="timeStamp" value="31" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[020][Valid Parentheses]/src/Solution.java</url>
           <line>35</line>
-          <properties />
           <option name="timeStamp" value="32" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[075][Sort Colors]/src/Solution.java</url>
           <line>36</line>
-          <properties />
           <option name="timeStamp" value="35" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[074][Search A 2D Matrix]/src/Solution.java</url>
           <line>36</line>
-          <properties />
           <option name="timeStamp" value="36" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[078][Subsets]/src/Solution.java</url>
           <line>62</line>
-          <properties />
           <option name="timeStamp" value="43" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <condition expression="index &gt;= s.length()" language="JAVA" />
           <url>file://$PROJECT_DIR$/[131][Palindrome Partitioning]/src/Solution.java</url>
           <line>48</line>
-          <properties />
           <option name="timeStamp" value="47" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0122][Best Time to Buy and Sell Stock II]/src/Solution2.java</url>
           <line>49</line>
-          <properties />
           <option name="timeStamp" value="48" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0367][Valid Perfect Square]/src/Solution.java</url>
           <line>20</line>
-          <properties />
           <option name="timeStamp" value="52" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0383][Ransom Note]/src/Solution.java</url>
           <line>39</line>
-          <properties />
           <option name="timeStamp" value="54" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/src/Solution.java</url>
           <line>9</line>
-          <properties />
           <option name="timeStamp" value="57" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/src/Solution.java</url>
           <line>17</line>
-          <properties />
           <option name="timeStamp" value="62" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/src/Solution.java</url>
           <line>18</line>
-          <properties />
           <option name="timeStamp" value="63" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/src/Solution.java</url>
           <line>20</line>
-          <properties />
           <option name="timeStamp" value="64" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/src/Solution.java</url>
           <line>22</line>
-          <properties />
           <option name="timeStamp" value="65" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/src/Solution.java</url>
           <line>24</line>
-          <properties />
           <option name="timeStamp" value="66" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0173][Binary Search Tree Iterator]/src/Solution.java</url>
           <line>41</line>
-          <properties />
           <option name="timeStamp" value="67" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0401][Binary Watch]/src/Solution.java</url>
           <line>36</line>
-          <properties />
           <option name="timeStamp" value="69" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0429][N-ary Tree Level Order Traversal]/src/Main.java</url>
           <line>38</line>
-          <properties />
           <option name="timeStamp" value="70" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0429][N-ary Tree Level Order Traversal]/src/Solution.java</url>
           <line>27</line>
-          <properties />
           <option name="timeStamp" value="71" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0230][Kth Smallest Element in a BST]/src/Main.java</url>
           <line>17</line>
-          <properties />
           <option name="timeStamp" value="74" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0414][Third Maximum Number]/src/Main.java</url>
           <line>33</line>
-          <properties />
           <option name="timeStamp" value="77" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0414][Third Maximum Number]/src/Solution.java</url>
           <line>48</line>
-          <properties />
           <option name="timeStamp" value="78" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0415][Add Strings]/src/Main.java</url>
           <line>23</line>
-          <properties />
           <option name="timeStamp" value="82" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0476][Number Complement]/src/Main.java</url>
           <line>12</line>
-          <properties />
           <option name="timeStamp" value="83" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0287][Find the Duplicate Number]/src/Solution.java</url>
           <line>32</line>
-          <properties />
           <option name="timeStamp" value="84" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0496][Next Greater Element I]/src/Solution.java</url>
           <line>62</line>
-          <properties />
           <option name="timeStamp" value="87" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0496][Next Greater Element I]/src/Solution.java</url>
           <line>49</line>
-          <properties />
           <option name="timeStamp" value="88" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0241][Different Ways to Add Parentheses]/src/Solution.java</url>
           <line>75</line>
-          <properties />
           <option name="timeStamp" value="94" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0241][Different Ways to Add Parentheses]/src/Solution.java</url>
           <line>69</line>
-          <properties />
           <option name="timeStamp" value="95" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0427][Construct Quad Tree]/src/Solution.java</url>
           <line>44</line>
-          <properties />
           <option name="timeStamp" value="100" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <condition expression="i == 3" language="JAVA" />
           <url>file://$PROJECT_DIR$/[0207][Course Schedule]/src/Solution.java</url>
           <line>64</line>
-          <properties />
           <option name="timeStamp" value="102" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0459][Repeated Substring Pattern]/src/Solution.java</url>
           <line>43</line>
-          <properties />
           <option name="timeStamp" value="103" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0475][Heaters]/src/Solution.java</url>
           <line>46</line>
-          <properties />
           <option name="timeStamp" value="104" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0227][Basic Calculator II]/src/Solution.java</url>
           <line>52</line>
-          <properties />
           <option name="timeStamp" value="105" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0500][Keyboard Row]/src/Solution.java</url>
           <line>13</line>
-          <properties />
           <option name="timeStamp" value="107" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Solution.java</url>
           <line>6</line>
-          <properties />
           <option name="timeStamp" value="108" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0392][Is Subsequence]/src/Solution.java</url>
+          <line>66</line>
+          <option name="timeStamp" value="109" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0441][Arranging Coins]/src/Solution.java</url>
+          <line>67</line>
+          <option name="timeStamp" value="111" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0443][String Compression]/src/Solution.java</url>
+          <line>57</line>
+          <option name="timeStamp" value="118" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
@@ -1278,464 +1009,6 @@
       </expression>
     </expressions>
   </component>
-  <component name="editorHistoryManager">
-    <entry file="file://$PROJECT_DIR$/[0475][Heaters]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="238">
-          <caret line="14" column="44" selection-start-line="14" selection-start-column="44" selection-end-line="14" selection-end-column="44" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0475][Heaters]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="291">
-          <caret line="58" column="13" selection-end-line="74" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/lang/CharacterData.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="161">
-          <caret line="75" column="31" selection-start-line="75" selection-start-column="31" selection-end-line="75" selection-end-column="31" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/lang/Character.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="166">
-          <caret line="6397" column="30" selection-start-line="6397" selection-start-column="30" selection-end-line="6397" selection-end-column="30" />
-          <folding>
-            <element signature="e#204938#204939#0" expanded="true" />
-            <element signature="e#204985#204986#0" expanded="true" />
-            <element signature="e#227755#227756#0" expanded="true" />
-            <element signature="e#227804#227805#0" expanded="true" />
-            <element signature="e#228990#228991#0" expanded="true" />
-            <element signature="e#229063#229064#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/lang/AbstractStringBuilder.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="150">
-          <caret line="55" column="8" selection-start-line="55" selection-start-column="8" selection-end-line="55" selection-end-column="8" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/lang/StringBuilder.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="189">
-          <caret line="406" column="38" selection-start-line="406" selection-start-column="38" selection-end-line="406" selection-end-column="38" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0482][License Key Formatting]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="394">
-          <caret line="35" column="70" selection-start-line="35" selection-start-column="70" selection-end-line="35" selection-end-column="70" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0482][License Key Formatting]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="268">
-          <caret line="71" selection-end-line="79" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0492][Construct the Rectangle]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="187">
-          <caret line="11" column="64" selection-start-line="11" selection-start-column="64" selection-end-line="11" selection-end-column="64" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0492][Construct the Rectangle]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="402">
-          <caret line="46" column="8" selection-start-line="46" selection-start-column="8" selection-end-line="46" selection-end-column="8" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0227][Basic Calculator II]/[0227][Basic Calculator II].iml">
-      <provider selected="true" editor-type-id="text-editor" />
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0227][Basic Calculator II]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="415">
-          <caret line="29" column="55" selection-start-line="29" selection-start-column="55" selection-end-line="29" selection-end-column="55" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0227][Basic Calculator II]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="384">
-          <caret line="45" selection-start-line="45" selection-end-line="45" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/Arrays.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="157">
-          <caret line="3798" column="30" selection-start-line="3798" selection-start-column="30" selection-end-line="3798" selection-end-column="30" />
-          <folding>
-            <element signature="e#177013#177014#0" expanded="true" />
-            <element signature="e#177054#177055#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0228][Summary Ranges]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="313">
-          <caret line="21" column="88" selection-start-line="21" selection-start-column="88" selection-end-line="21" selection-end-column="88" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0228][Summary Ranges]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="238">
-          <caret line="14" selection-start-line="14" selection-end-line="14" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/jre/lib/rt.jar!/sun/misc/Contended.class">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="136">
-          <caret line="14" column="18" selection-start-line="14" selection-start-column="18" selection-end-line="14" selection-end-column="18" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/locks/ReentrantLock.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="153">
-          <caret line="223" column="17" selection-start-line="223" selection-start-column="17" selection-end-line="223" selection-end-column="17" />
-          <folding>
-            <element signature="e#7116#7117#0" expanded="true" />
-            <element signature="e#7150#7151#0" expanded="true" />
-            <element signature="e#9117#9118#0" expanded="true" />
-            <element signature="e#9144#9145#0" expanded="true" />
-            <element signature="e#12210#12211#0" expanded="true" />
-            <element signature="e#12258#12259#0" expanded="true" />
-            <element signature="e#20237#20238#0" expanded="true" />
-            <element signature="e#20275#20276#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/TimerTask.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="162">
-          <caret line="35" column="22" selection-start-line="35" selection-start-column="22" selection-end-line="35" selection-end-column="22" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/Tripwire.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="74">
-          <caret line="47" column="12" selection-start-line="47" selection-start-column="12" selection-end-line="47" selection-end-column="12" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/Timer.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="170">
-          <caret line="33" column="2" selection-start-line="33" selection-start-column="2" selection-end-line="33" selection-end-column="2" />
-          <folding>
-            <element signature="imports" expanded="true" />
-            <element signature="e#4151#4396#0" expanded="true" />
-            <element signature="e#4395#4396#0" expanded="true" />
-            <element signature="e#7783#7784#0" expanded="true" />
-            <element signature="e#7829#7830#0" expanded="true" />
-            <element signature="e#26029#26030#0" expanded="true" />
-            <element signature="e#26060#26061#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/lang/String.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="178">
-          <caret line="655" column="16" selection-start-line="655" selection-start-column="16" selection-end-line="655" selection-end-column="16" />
-          <folding>
-            <element signature="e#23072#23073#0" expanded="true" />
-            <element signature="e#23112#23113#0" expanded="true" />
-            <element signature="e#82971#82972#0" expanded="true" />
-            <element signature="e#83020#83021#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0500][Keyboard Row]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="204">
-          <caret line="12" column="79" selection-start-line="12" selection-start-column="79" selection-end-line="12" selection-end-column="79" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/TreeMap.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="186">
-          <caret line="296" column="23" selection-start-line="296" selection-start-column="23" selection-end-line="296" selection-end-column="23" />
-          <folding>
-            <element signature="e#11471#11472#0" expanded="true" />
-            <element signature="e#11513#11514#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0617][Merge Two Binary Trees]/src/TreeNode.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="187">
-          <caret line="11" selection-start-line="11" selection-end-line="11" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0617][Merge Two Binary Trees]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="85">
-          <caret line="5" column="13" selection-start-line="5" selection-start-column="13" selection-end-line="5" selection-end-column="13" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0500][Keyboard Row]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="48">
-          <caret line="5" column="46" selection-start-line="5" selection-start-column="46" selection-end-line="5" selection-end-column="46" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="272">
-          <caret line="16" column="69" selection-start-line="16" selection-start-column="69" selection-end-line="16" selection-end-column="69" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/src/TreeNode.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="119">
-          <caret line="7" column="13" selection-start-line="7" selection-start-column="13" selection-end-line="7" selection-end-column="13" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="374">
-          <caret line="26" column="29" selection-end-line="51" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0419][Battleships in a Board]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="476">
-          <caret line="28" column="13" selection-end-line="34" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/src/Solution2.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="255">
-          <caret line="17" selection-start-line="17" selection-end-line="17" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/Collections.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="1768">
-          <caret line="140" column="16" selection-start-line="140" selection-start-column="16" selection-end-line="140" selection-end-column="16" />
-          <folding>
-            <element signature="e#5644#5645#0" expanded="true" />
-            <element signature="e#5675#5676#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/List.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="7701">
-          <caret line="476" column="29" selection-start-line="476" selection-start-column="29" selection-end-line="476" selection-end-column="29" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/AbstractCollection.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="1836">
-          <caret line="133" column="20" selection-start-line="133" selection-start-column="20" selection-end-line="133" selection-end-column="20" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="187">
-          <caret line="14" column="21" selection-start-line="14" selection-start-column="21" selection-end-line="14" selection-end-column="21" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0419][Battleships in a Board]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="272">
-          <caret line="17" column="48" selection-start-line="17" selection-start-column="48" selection-end-line="17" selection-end-column="48" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/SortedMap.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="4063">
-          <caret line="262" column="18" selection-start-line="262" selection-start-column="18" selection-end-line="262" selection-end-column="18" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="99">
-          <caret line="10" column="4" selection-start-line="10" selection-start-column="4" selection-end-line="10" selection-end-column="4" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/locks/AbstractOwnableSynchronizer.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="97">
-          <caret line="49" column="22" selection-start-line="49" selection-start-column="22" selection-end-line="49" selection-end-column="22" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/Semaphore.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="218">
-          <caret line="311" column="26" selection-start-line="311" selection-start-column="26" selection-end-line="311" selection-end-column="26" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/locks/AbstractQueuedSynchronizer.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="297">
-          <caret line="752" selection-start-line="752" selection-end-line="752" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/ConcurrentHashMap.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="712">
-          <caret line="2335" column="24" selection-start-line="2335" selection-start-column="24" selection-end-line="2335" selection-end-column="24" />
-          <folding>
-            <element signature="e#32334#32335#0" expanded="true" />
-            <element signature="e#32385#32386#0" expanded="true" />
-            <element signature="e#44347#44348#0" expanded="true" />
-            <element signature="e#44395#44396#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/jre/lib/rt.jar!/sun/reflect/CallerSensitive.class">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="136">
-          <caret line="14" column="18" selection-start-line="14" selection-start-column="18" selection-end-line="14" selection-end-column="18" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/jre/lib/rt.jar!/sun/misc/Unsafe.class">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="240">
-          <caret line="42" column="25" selection-start-line="42" selection-start-column="25" selection-end-line="42" selection-end-column="25" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/ConcurrentNavigableMap.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="306">
-          <caret line="51" column="17" selection-start-line="51" selection-start-column="17" selection-end-line="51" selection-end-column="17" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.8.0_172.jdk/Contents/Home/src.zip!/java/util/concurrent/ConcurrentSkipListMap.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="-530">
-          <caret line="816" column="14" selection-start-line="816" selection-start-column="14" selection-end-line="816" selection-end-column="14" />
-          <folding>
-            <element signature="e#26136#26137#0" expanded="true" />
-            <element signature="e#26215#26216#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[1108][Defanging an IP Address]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="247">
-          <caret line="19" column="65" selection-start-line="19" selection-start-column="65" selection-end-line="19" selection-end-column="65" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[1108][Defanging an IP Address]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="207">
-          <caret line="15" column="6" selection-end-line="48" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Main.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="204">
-          <caret line="12" column="29" selection-start-line="12" selection-start-column="29" selection-end-line="12" selection-end-column="29" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/[1089][Duplicate Zeros]/src/Solution.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="306">
-          <caret line="18" column="9" selection-end-line="21" />
-        </state>
-      </provider>
-    </entry>
-  </component>
   <component name="masterDetails">
     <states>
       <state key="ArtifactsStructureConfigurable.UI">
diff --git a/[0000][common]/[0000][common].iml b/[0000][common]/[0000][common].iml
index 73f33e3..2c1c83e 100644
--- a/[0000][common]/[0000][common].iml
+++ b/[0000][common]/[0000][common].iml
@@ -19,5 +19,31 @@
         <SOURCES />
       </library>
     </orderEntry>
+    <orderEntry type="module-library">
+      <library name="JUnit5.4">
+        <CLASSES>
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/jupiter/junit-jupiter/5.4.2/junit-jupiter-5.4.2.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/jupiter/junit-jupiter-api/5.4.2/junit-jupiter-api-5.4.2.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/apiguardian/apiguardian-api/1.0.0/apiguardian-api-1.0.0.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/opentest4j/opentest4j/1.1.1/opentest4j-1.1.1.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/platform/junit-platform-commons/1.4.2/junit-platform-commons-1.4.2.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/jupiter/junit-jupiter-params/5.4.2/junit-jupiter-params-5.4.2.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/jupiter/junit-jupiter-engine/5.4.2/junit-jupiter-engine-5.4.2.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/platform/junit-platform-engine/1.4.2/junit-platform-engine-1.4.2.jar!/" />
+        </CLASSES>
+        <JAVADOC />
+        <SOURCES />
+      </library>
+    </orderEntry>
+    <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>
\ No newline at end of file
diff --git a/[0160][Intersection of Two Linked Lists]/[0160][Intersection of Two Linked Lists].iml b/[0160][Intersection of Two Linked Lists]/[0160][Intersection of Two Linked Lists].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0160][Intersection of Two Linked Lists]/[0160][Intersection of Two Linked Lists].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>
\ No newline at end of file
diff --git a/[0160][Intersection of Two Linked Lists]/src/ListNode.java b/[0160][Intersection of Two Linked Lists]/src/ListNode.java
new file mode 100644
index 0000000..e49628e
--- /dev/null
+++ b/[0160][Intersection of Two Linked Lists]/src/ListNode.java	
@@ -0,0 +1,9 @@
+public class ListNode {
+    int val;
+    ListNode next;
+
+    ListNode(int x) {
+        val = x;
+        next = null;
+    }
+}
diff --git a/[0160][Intersection of Two Linked Lists]/src/Solution.java b/[0160][Intersection of Two Linked Lists]/src/Solution.java
new file mode 100644
index 0000000..9872669
--- /dev/null
+++ b/[0160][Intersection of Two Linked Lists]/src/Solution.java	
@@ -0,0 +1,129 @@
+//Write a program to find the node at which the intersection of two singly linke
+//d lists begins.
+//
+// For example, the following two linked lists:
+//
+//
+// begin to intersect at node c1.
+//
+//
+//
+// Example 1:
+//
+//
+//
+//Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2
+//, skipB = 3
+//Output: Reference of the node with value = 8
+//Input Explanation: The intersected node's value is 8 (note that this must not
+//be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. F
+//rom the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the inter
+//sected node in A; There are 3 nodes before the intersected node in B.
+//
+//
+//
+// Example 2:
+//
+//
+//
+//Input: intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skip
+//B = 1
+//Output: Reference of the node with value = 2
+//Input Explanation: The intersected node's value is 2 (note that this must not
+//be 0 if the two lists intersect). From the head of A, it reads as [0,9,1,2,4]. F
+//rom the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected
+// node in A; There are 1 node before the intersected node in B.
+//
+//
+//
+//
+// Example 3:
+//
+//
+//
+//Input: intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
+//Output: null
+//Input Explanation: From the head of A, it reads as [2,6,4]. From the head of B
+//, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be
+//0, while skipA and skipB can be arbitrary values.
+//Explanation: The two lists do not intersect, so return null.
+//
+//
+//
+//
+// Notes:
+//
+//
+// If the two linked lists have no intersection at all, return null.
+// The linked lists must retain their original structure after the function returns.
+// You may assume there are no cycles anywhere in the entire linked structure.
+// Your code should preferably run in O(n) time and use only O(1) memory.
+//
+// Related Topics Linked List
+
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) {
+ *         val = x;
+ *         next = null;
+ *     }
+ * }
+ */
+public class Solution {
+    /**
+     * 解题思路：将headA链表的尾结点链接到headB的头部，问题等价于求链表中环的入口节点，最后再还原两个表
+     */
+    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
+
+        if (headA == null || headB == null) {
+            return null;
+        }
+
+        if (headA == headB) {
+            return headA;
+        }
+
+        ListNode tailA = headA;
+        while (tailA.next != null) {
+            tailA = tailA.next;
+        }
+
+        tailA.next = headB;
+
+        // 定义快慢指针
+        ListNode fast =  headA;
+        ListNode slow = headA;
+
+        while (fast.next != null && fast.next.next != null) {
+            slow = slow.next;
+            fast = fast.next.next;
+
+            //如果有环，想遇于环中某点
+            if (fast == slow) {
+                break;
+            }
+        }
+
+        //如果没有环，return null
+        if (fast.next == null || fast.next.next == null) {
+            tailA.next = null; // 还原链表
+            return null;
+        }
+
+        slow = headA;
+        while (slow != fast) {
+            slow = slow.next;
+            fast = fast.next;
+        }
+
+
+        tailA.next = null; // 还原链表
+        return fast;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/[0299][Bulls and Cows]/[0299][Bulls and Cows].iml b/[0299][Bulls and Cows]/[0299][Bulls and Cows].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0299][Bulls and Cows]/[0299][Bulls and Cows].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>
\ No newline at end of file
diff --git a/[0299][Bulls and Cows]/src/Solution.java b/[0299][Bulls and Cows]/src/Solution.java
new file mode 100644
index 0000000..cb785ab
--- /dev/null
+++ b/[0299][Bulls and Cows]/src/Solution.java	
@@ -0,0 +1,85 @@
+//You are playing the following Bulls and Cows game with your friend: You write
+//down a number and ask your friend to guess what the number is. Each time your fr
+//iend makes a guess, you provide a hint that indicates how many digits in said gu
+//ess match your secret number exactly in both digit and position (called "bulls")
+// and how many digits match the secret number but locate in the wrong position (c
+//alled "cows"). Your friend will use successive guesses and hints to eventually d
+//erive the secret number.
+//
+// Write a function to return a hint according to the secret number and friend's
+// guess, use A to indicate the bulls and B to indicate the cows.
+//
+// Please note that both secret number and friend's guess may contain duplicate
+//digits.
+//
+// Example 1:
+//
+//
+//Input: secret = "1807", guess = "7810"
+//
+//Output: "1A3B"
+//
+//Explanation: 1 bull and 3 cows. The bull is 8, the cows are 0, 1 and 7.
+//
+// Example 2:
+//
+//
+//Input: secret = "1123", guess = "0111"
+//
+//Output: "1A1B"
+//
+//Explanation: The 1st 1 in friend's guess is a bull, the 2nd or 3rd 1 is a cow.
+//
+//
+// Note: You may assume that the secret number and your friend's guess only cont
+//ain digits, and their lengths are always equal. Related Topics Hash Table
+
+
+import java.util.HashMap;
+import java.util.Map;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public String getHint(String secret, String guess) {
+
+        // 假如参数不合法
+        if (secret == null || guess == null || secret.length() != guess.length()) {
+            throw new IllegalArgumentException("secret: " + secret + ", guess: " + guess);
+        }
+
+        Map<Integer, Character> indexMap = new HashMap<>();
+        Map<Character, Integer> countMap = new HashMap<>();
+
+        for (int i = 0; i < secret.length(); i++) {
+            char c = secret.charAt(i);
+            indexMap.put(i, c);
+            countMap.put(c, 1 + countMap.getOrDefault(c, 0)); // 记录字符出现的次数
+        }
+
+        int bull = 0;
+        int cows = 0;
+
+        // 先计算bull
+        for (int i = 0; i < guess.length(); i++) {
+            char c = guess.charAt(i);
+            if (indexMap.get(i) == c) {
+                bull++;
+                indexMap.remove(i); // 删除已经匹配过的位置
+                countMap.put(c, countMap.get(c) - 1);
+            }
+        }
+
+        // 再计算cows
+        for (int i = 0; i < guess.length(); i++) {
+            char c = guess.charAt(i);
+            // 位置没有被匹配过，并且值大于0，说明猜测的值是有的，但是位置错误了
+            if (indexMap.containsKey(i) && countMap.getOrDefault(c, 0) > 0) {
+                cows++;
+                countMap.put(c, countMap.get(c) - 1);
+            }
+        }
+
+        return bull + "A" + cows + "B";
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/[0299][Bulls and Cows]/src/TestSolution.java b/[0299][Bulls and Cows]/src/TestSolution.java
new file mode 100644
index 0000000..edc42ed
--- /dev/null
+++ b/[0299][Bulls and Cows]/src/TestSolution.java	
@@ -0,0 +1,14 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+public class TestSolution {
+    @Test
+    public void test1() {
+        String[][] data = {{"1807", "7810", "1A3B"}, {"1123", "0111", "1A1B"}, {"11", "10", "1A0B"}};
+
+        for (String[] datum : data) {
+            String result = new Solution().getHint(datum[0], datum[1]);
+            Assert.assertEquals(result, datum[2]);
+        }
+    }
+}
diff --git a/[0371][Sum of Two Integers]/[0371][Sum of Two Integers].iml b/[0371][Sum of Two Integers]/[0371][Sum of Two Integers].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0371][Sum of Two Integers]/[0371][Sum of Two Integers].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>
\ No newline at end of file
diff --git a/[0371][Sum of Two Integers]/src/Solution.java b/[0371][Sum of Two Integers]/src/Solution.java
new file mode 100644
index 0000000..be4b0f6
--- /dev/null
+++ b/[0371][Sum of Two Integers]/src/Solution.java	
@@ -0,0 +1,51 @@
+//Calculate the sum of two integers a and b, but you are not allowed to use the
+//operator + and -.
+//
+//
+// Example 1:
+//
+//
+//Input: a = 1, b = 2
+//Output: 3
+//
+//
+//
+// Example 2:
+//
+//
+//Input: a = -2, b = 3
+//Output: 1
+//
+//
+//
+// Related Topics Bit Manipulation
+
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Author: 王俊超
+ * Time: 2016-07-03 21-25 10:58
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ */
+public class Solution {
+    public int getSum(int a, int b) {
+
+        // 保存不进位值，异或运算结果
+        int xor;
+        // 保存进位结果，与运算，然后左移一位结果
+        int and;
+        do {
+            xor = a ^ b;
+            and = a & b;
+            and <<= 1;
+            a = xor;
+            b = and;
+
+        } while (and != 0);
+
+        return xor;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/[0371][Sum of Two Integers]/src/SolutionTest.java b/[0371][Sum of Two Integers]/src/SolutionTest.java
new file mode 100644
index 0000000..275433e
--- /dev/null
+++ b/[0371][Sum of Two Integers]/src/SolutionTest.java	
@@ -0,0 +1,2 @@
+public class SolutionTest {
+}
diff --git a/[0392][Is Subsequence]/[0392][Is Subsequence].iml b/[0392][Is Subsequence]/[0392][Is Subsequence].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0392][Is Subsequence]/[0392][Is Subsequence].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>
\ No newline at end of file
diff --git a/[0392][Is Subsequence]/src/Solution.java b/[0392][Is Subsequence]/src/Solution.java
new file mode 100644
index 0000000..dc4bc70
--- /dev/null
+++ b/[0392][Is Subsequence]/src/Solution.java	
@@ -0,0 +1,82 @@
+
+//Given a string s and a string t, check if s is subsequence of t.
+//
+// A subsequence of a string is a new string which is formed from the original s
+//tring by deleting some (can be none) of the characters without disturbing the re
+//lative positions of the remaining characters. (ie, "ace" is a subsequence of "ab
+//cde" while "aec" is not).
+//
+// Follow up:
+//If there are lots of incoming S, say S1, S2, ... , Sk where k >= 1B, and you w
+//ant to check one by one to see if T has its subsequence. In this scenario, how w
+//ould you change your code?
+//
+// Credits:
+//Special thanks to @pbrother for adding this problem and creating all test case
+//s.
+//
+//
+// Example 1:
+// Input: s = "abc", t = "ahbgdc"
+//Output: true
+// Example 2:
+// Input: s = "axc", t = "ahbgdc"
+//Output: false
+//
+//
+// Constraints:
+//
+//
+// 0 <= s.length <= 100
+// 0 <= t.length <= 10^4
+// Both strings consists only of lowercase characters.
+//
+// Related Topics Binary Search Dynamic Programming Greedy
+
+
+//leetcode submit region begin(Prohibit modification and deletion)
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-24 10:48
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public boolean isSubsequence(String s, String t) {
+
+        if (s == null && t == null) {
+            return true;
+        }
+
+        if (s == null || t == null ) {
+            return false;
+        }
+
+        if (s.length() == 0){
+            return true;
+        }
+
+        if (t.length() == 0) {
+            return false;
+        }
+
+        int idxT = 0;
+        int idxS = 0;
+        while (idxS < s.length() && idxT < t.length()) {
+
+            if (s.charAt(idxS) == t.charAt(idxT)) {
+                idxS++;
+                idxT++;
+            } else {
+                idxT++;
+            }
+        }
+
+
+        return idxS == s.length();
+
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/[0392][Is Subsequence]/src/SolutionTest.java b/[0392][Is Subsequence]/src/SolutionTest.java
new file mode 100644
index 0000000..7cd621c
--- /dev/null
+++ b/[0392][Is Subsequence]/src/SolutionTest.java	
@@ -0,0 +1,29 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-25 14:03
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+    @Test
+    public void test1() {
+        Object[][] data = {
+
+                {"", "", true},
+                {"", "ahbgdc", true},
+                {"ahbgdc", "", false},
+                {"abc", "ahbgdc", true},
+                {"axc", "ahbgdc", false},
+                {"leetcode", "lleettccooddee", true},
+        };
+
+        for (Object[] datum : data) {
+            Solution s = new Solution();
+            Assert.assertEquals(s.isSubsequence((String) datum[0], (String) datum[1]), datum[2]);
+        }
+    }
+}
diff --git a/[0441][Arranging Coins]/[0441][Arranging Coins].iml b/[0441][Arranging Coins]/[0441][Arranging Coins].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0441][Arranging Coins]/[0441][Arranging Coins].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>
\ No newline at end of file
diff --git a/[0441][Arranging Coins]/src/Solution.java b/[0441][Arranging Coins]/src/Solution.java
new file mode 100644
index 0000000..13f4edd
--- /dev/null
+++ b/[0441][Arranging Coins]/src/Solution.java	
@@ -0,0 +1,84 @@
+
+//You have a total of n coins that you want to form in a staircase shape, where
+//every k-th row must have exactly k coins.
+//
+// Given n, find the total number of full staircase rows that can be formed.
+//
+// n is a non-negative integer and fits within the range of a 32-bit signed inte
+//ger.
+//
+// Example 1:
+//
+//n = 5
+//
+//The coins can form the following rows:
+//¤
+//¤ ¤
+//¤ ¤
+//
+//Because the 3rd row is incomplete, we return 2.
+//
+//
+//
+// Example 2:
+//
+//n = 8
+//
+//The coins can form the following rows:
+//¤
+//¤ ¤
+//¤ ¤ ¤
+//¤ ¤
+//
+//Because the 4th row is incomplete, we return 3.
+//
+// Related Topics Math Binary Search
+
+
+//leetcode submit region begin(Prohibit modification and deletion)
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-25 14:22
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 本质是求最大的整数x，使得 x >= n - x(x + 1)/2 >= 0
+     * ==>
+     * 2x >= 2n - x^2 - x >= 0
+     * ==>
+     * x^2 + 3x >= 2n >= x^2 + x
+     *
+     * @param n
+     * @return
+     */
+    public int arrangeCoins(int n) {
+
+        if (n <= 0) {
+            return 0;
+        }
+
+        long t = 2 * (long) (n);
+
+        long x = (long) Math.sqrt(t);
+
+        while ( true ) {
+            if (x * x + 3*x < t) {
+                x++;
+                continue;
+            }
+            if (x * x + x > t) {
+                x--;
+                continue;
+            }
+
+            break;
+        }
+
+        return (int) x;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/[0441][Arranging Coins]/src/SolutionTest.java b/[0441][Arranging Coins]/src/SolutionTest.java
new file mode 100644
index 0000000..86237cf
--- /dev/null
+++ b/[0441][Arranging Coins]/src/SolutionTest.java	
@@ -0,0 +1,35 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-25 14:32
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+    @Test
+    public void test1() {
+        Solution s = new Solution();
+
+        int[][] data = {
+                {-1, 0},
+                {0, 0},
+                {1, 1},
+                {2, 1},
+                {5, 2},
+                {8, 3},
+                {10, 4},
+                {11, 4},
+                {12, 4},
+                {13, 4},
+                {14, 4},
+                {15, 5},
+        };
+
+        for(int[] d: data)  {
+            Assert.assertEquals(s.arrangeCoins(d[0]), d[1]);
+        }
+    }
+}
diff --git a/[0443][String Compression]/[0443][String Compression].iml b/[0443][String Compression]/[0443][String Compression].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0443][String Compression]/[0443][String Compression].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>
\ No newline at end of file
diff --git a/[0443][String Compression]/src/Solution.java b/[0443][String Compression]/src/Solution.java
new file mode 100644
index 0000000..487f236
--- /dev/null
+++ b/[0443][String Compression]/src/Solution.java	
@@ -0,0 +1,76 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-26 07:29
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 从向前处理
+     *
+     * @param chars
+     * @return
+     */
+    public int compress(char[] chars) {
+        if (chars == null || chars.length == 0) {
+            return 0;
+        }
+
+        int end;
+        int start = 0;
+        int length = 0;
+        while (start < chars.length) {
+            end = start + 1;
+            while (end < chars.length && chars[start] == chars[end]) {
+                end++;
+            }
+
+            String num = "" + (end - start);
+
+            length += 1;
+            if (end - start > 1) { // 有重复的字符
+                length += num.length(); // 重复字符的个数
+                int tmp = start + 1;
+                for (int i = 0; i < num.length(); i++) {
+                    chars[tmp] = num.charAt(i);
+                    tmp++;
+                }
+
+                while (tmp < end) { // 不需要的字符清零
+                    chars[tmp] = 0;
+                    tmp++;
+                }
+            }
+
+            start = end; // 开始处理下一个字符
+
+        }
+
+
+        // 找第一个0值的字符位置
+        start = 0;
+        while (start < chars.length && chars[start] != 0) {
+            start++;
+        }
+
+        end = start;
+        while (end < chars.length) {
+            // 找start位置之后第一个值不为0的位置
+            while (end < chars.length && chars[end] == 0) {
+                end++;
+            }
+
+            // 将end及之后不为0的值向前移动
+            while (end < chars.length && chars[end] != 0) {
+                chars[start] = chars[end];
+                start++;
+                end++;
+            }
+
+        }
+
+
+        return length;
+    }
+}
diff --git a/[0443][String Compression]/src/SolutionTest.java b/[0443][String Compression]/src/SolutionTest.java
new file mode 100644
index 0000000..86170a5
--- /dev/null
+++ b/[0443][String Compression]/src/SolutionTest.java	
@@ -0,0 +1,41 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-26 07:51
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+    @Test
+    public void test1() {
+        Solution s = new Solution();
+        Object[][] data = {
+//                {null,null, 0},
+//                {"","", 0},
+//                {"a","a", 1},
+//                {"aabbccc", "a2b2c3", 6},
+//                {"abbbbbbbbbbbb","ab12", 4},
+//                {"abcdefg","abcdefg", 7},
+//                {"aaab","a3b", 3},
+//                {"aaabcccc","a3bc4", 5},
+                {"aaabbbccc","a3b3c3", 6},
+        };
+
+        for (Object[] d : data) {
+
+            if (d[0] == null) {
+                Assert.assertNull(d[1]);
+                Assert.assertEquals(0, d[2]);
+                continue;
+            }
+
+            char[] arr = ((String) (d[0])).toCharArray();
+            int length = s.compress(arr);
+            Assert.assertEquals(length, d[2]);
+            Assert.assertEquals(new String(arr, 0, length), d[1]);
+        }
+    }
+}

From 605cff4fa91252f76fd3b84775bbb1c8da139f03 Mon Sep 17 00:00:00 2001
From: "wangjunchao.o" <wangjunchao.o@bytedance.com>
Date: Sun, 28 Jun 2020 07:56:39 +0800
Subject: [PATCH 02/19] commit

Change-Id: I0240eac01220703bd1ba165e51b0aee17dfad544
---
 .idea/modules.xml                             |   1 +
 .idea/workspace.xml                           | 113 ++++++++----------
 .../[0447][Number of Boomerangs].iml          |  21 ++++
 .../src/Solution.java                         |  69 +++++++++++
 .../src/SolutionTest.java                     |  26 ++++
 5 files changed, 170 insertions(+), 60 deletions(-)
 create mode 100644 [0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml
 create mode 100644 [0447][Number of Boomerangs]/src/Solution.java
 create mode 100644 [0447][Number of Boomerangs]/src/SolutionTest.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index 1268fe5..e85fdc2 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -226,6 +226,7 @@
       <module fileurl="file://$PROJECT_DIR$/[0441][Arranging Coins]/[0441][Arranging Coins].iml" filepath="$PROJECT_DIR$/[0441][Arranging Coins]/[0441][Arranging Coins].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/[0442][Find All Duplicates in an Array].iml" filepath="$PROJECT_DIR$/[0442][Find All Duplicates in an Array]/[0442][Find All Duplicates in an Array].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0443][String Compression]/[0443][String Compression].iml" filepath="$PROJECT_DIR$/[0443][String Compression]/[0443][String Compression].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml" filepath="$PROJECT_DIR$/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0448][Find All Numbers Disappeared in an Array]/[0448][Find All Numbers Disappeared in an Array].iml" filepath="$PROJECT_DIR$/[0448][Find All Numbers Disappeared in an Array]/[0448][Find All Numbers Disappeared in an Array].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0455][Assign Cookies]/[0455][Assign Cookies].iml" filepath="$PROJECT_DIR$/[0455][Assign Cookies]/[0455][Assign Cookies].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0459][Repeated Substring Pattern]/[0459][Repeated Substring Pattern].iml" filepath="$PROJECT_DIR$/[0459][Repeated Substring Pattern]/[0459][Repeated Substring Pattern].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index f0fc058..4d3d05d 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,31 +2,11 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/.idea/codeStyles/codeStyleConfig.xml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/.idea/jarRepositories.xml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/.idea/leetcode/editor.xml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0160][Intersection of Two Linked Lists]/[0160][Intersection of Two Linked Lists].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0160][Intersection of Two Linked Lists]/src/ListNode.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0160][Intersection of Two Linked Lists]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0299][Bulls and Cows]/[0299][Bulls and Cows].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0299][Bulls and Cows]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0299][Bulls and Cows]/src/TestSolution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0371][Sum of Two Integers]/[0371][Sum of Two Integers].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0371][Sum of Two Integers]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0371][Sum of Two Integers]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0392][Is Subsequence]/[0392][Is Subsequence].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0392][Is Subsequence]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0392][Is Subsequence]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0441][Arranging Coins]/[0441][Arranging Coins].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0441][Arranging Coins]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0441][Arranging Coins]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0443][String Compression]/[0443][String Compression].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0443][String Compression]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0443][String Compression]/src/SolutionTest.java" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/.idea/encodings.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/encodings.xml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0447][Number of Boomerangs]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0447][Number of Boomerangs]/src/SolutionTest.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/[0000][common]/[0000][common].iml" beforeDir="false" afterPath="$PROJECT_DIR$/[0000][common]/[0000][common].iml" afterDir="false" />
     </list>
     <option name="SHOW_DIALOG" value="false" />
     <option name="HIGHLIGHT_CONFLICTS" value="true" />
@@ -74,6 +54,7 @@
     <property name="go.gopath.indexing.explicitly.defined" value="true" />
     <property name="go.import.settings.migrated" value="true" />
     <property name="jdk.selected.JAVA_MODULE" value="14" />
+    <property name="nodejs_package_manager_path" value="npm" />
     <property name="project.structure.last.edited" value="Modules" />
     <property name="project.structure.proportion" value="0.124843955" />
     <property name="project.structure.side.proportion" value="0.29248658" />
@@ -91,19 +72,20 @@
       <recent name="$PROJECT_DIR$" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.test1 (2)">
-    <configuration name="Main.test1 (2)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[1089][Duplicate Zeros]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.test1 (3)">
+    <configuration name="SolutionTest.test1 (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0441][Arranging Coins]" />
       <option name="PACKAGE_NAME" value="" />
-      <option name="MAIN_CLASS_NAME" value="Main" />
+      <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
+        <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.test1 (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0441][Arranging Coins]" />
+    <configuration name="SolutionTest.test1 (2)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0443][String Compression]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
@@ -113,8 +95,8 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.test1 (2)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0443][String Compression]" />
+    <configuration name="SolutionTest.test1 (3)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0447][Number of Boomerangs]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
@@ -153,19 +135,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.Main.test1 (2)" />
       <item itemvalue="JUnit.TestSolution.test1" />
       <item itemvalue="JUnit.SolutionTest.test1" />
       <item itemvalue="JUnit.SolutionTest.test1 (1)" />
       <item itemvalue="JUnit.SolutionTest.test1 (2)" />
+      <item itemvalue="JUnit.SolutionTest.test1 (3)" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.test1 (3)" />
         <item itemvalue="JUnit.SolutionTest.test1 (2)" />
         <item itemvalue="JUnit.SolutionTest.test1 (1)" />
         <item itemvalue="JUnit.SolutionTest.test1" />
         <item itemvalue="JUnit.TestSolution.test1" />
-        <item itemvalue="JUnit.Main.test1 (2)" />
       </list>
     </recent_temporary>
   </component>
@@ -221,7 +203,7 @@
       <workItem from="1562853743876" duration="3513000" />
       <workItem from="1592905214169" duration="3698000" />
       <workItem from="1592917353315" duration="5231000" />
-      <workItem from="1592990527553" duration="8280000" />
+      <workItem from="1592990527553" duration="12346000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -585,58 +567,58 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1400" height="435" key="GridCell.Tab.0.bottom" timestamp="1593132082984">
+    <state width="1400" height="192" key="GridCell.Tab.0.bottom" timestamp="1593262518088">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="435" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593132082984" />
+    <state width="1400" height="192" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593262518088" />
     <state width="1880" height="283" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1400" height="435" key="GridCell.Tab.0.center" timestamp="1593132082983">
+    <state width="1400" height="192" key="GridCell.Tab.0.center" timestamp="1593262518087">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="435" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593132082983" />
+    <state width="1400" height="192" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593262518087" />
     <state width="1880" height="283" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1400" height="435" key="GridCell.Tab.0.left" timestamp="1593132082982">
+    <state width="1400" height="192" key="GridCell.Tab.0.left" timestamp="1593262518087">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="435" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593132082982" />
+    <state width="1400" height="192" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593262518087" />
     <state width="1880" height="283" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1400" height="435" key="GridCell.Tab.0.right" timestamp="1593132082983">
+    <state width="1400" height="192" key="GridCell.Tab.0.right" timestamp="1593262518088">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="435" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593132082983" />
+    <state width="1400" height="192" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593262518088" />
     <state width="1880" height="283" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1400" height="435" key="GridCell.Tab.1.bottom" timestamp="1593132083162">
+    <state width="1400" height="192" key="GridCell.Tab.1.bottom" timestamp="1593262518090">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="435" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593132083162" />
-    <state width="1400" height="435" key="GridCell.Tab.1.center" timestamp="1593132083161">
+    <state width="1400" height="192" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593262518090" />
+    <state width="1400" height="192" key="GridCell.Tab.1.center" timestamp="1593262518089">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="435" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593132083161" />
-    <state width="1400" height="435" key="GridCell.Tab.1.left" timestamp="1593132083161">
+    <state width="1400" height="192" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593262518089" />
+    <state width="1400" height="192" key="GridCell.Tab.1.left" timestamp="1593262518088">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="435" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593132083161" />
-    <state width="1400" height="435" key="GridCell.Tab.1.right" timestamp="1593132083162">
+    <state width="1400" height="192" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593262518088" />
+    <state width="1400" height="192" key="GridCell.Tab.1.right" timestamp="1593262518090">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="435" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593132083162" />
-    <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog" timestamp="1593127668706">
+    <state width="1400" height="192" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593262518090" />
+    <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog" timestamp="1593161435798">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog/0.0.1440.900@0.0.1440.900" timestamp="1593127668706" />
+    <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog/0.0.1440.900@0.0.1440.900" timestamp="1593161435798" />
     <state x="328" y="211" key="IDE.errors.dialog/44.23.1396.877@44.23.1396.877" timestamp="1592952525283" />
     <state x="1929" y="250" key="RollbackChangesDialog" timestamp="1592905880584">
       <screen x="1440" y="0" width="1920" height="1080" />
@@ -649,27 +631,28 @@
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593129124079">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593161844244">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593129124079" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593161844244" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905485465" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="402" y="49" width="636" height="801" key="find.popup" timestamp="1593129085788">
+    <state x="402" y="49" width="636" height="801" key="find.popup" timestamp="1593262516580">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593129085788" />
-    <state x="0" y="127" key="new project wizard" timestamp="1593127731622">
+    <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
+    <state x="0" y="127" key="new project wizard" timestamp="1593161264383">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="0" y="127" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593127731622" />
+    <state x="0" y="127" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593161264383" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592908078144" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
-    <state x="504" y="218" key="search.everywhere.popup" timestamp="1593065008140">
-      <screen x="52" y="23" width="1388" height="877" />
+    <state x="469" y="200" key="search.everywhere.popup" timestamp="1593162973634">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
+    <state x="469" y="200" key="search.everywhere.popup/0.0.1440.900@0.0.1440.900" timestamp="1593162973634" />
     <state x="2065" y="258" key="search.everywhere.popup/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592965788430" />
     <state x="504" y="218" key="search.everywhere.popup/52.23.1388.877@52.23.1388.877" timestamp="1593065008140" />
   </component>
@@ -904,6 +887,16 @@
           <line>57</line>
           <option name="timeStamp" value="118" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0447][Number of Boomerangs]/src/Solution.java</url>
+          <line>47</line>
+          <option name="timeStamp" value="119" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0447][Number of Boomerangs]/src/Solution.java</url>
+          <line>65</line>
+          <option name="timeStamp" value="120" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
diff --git a/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml b/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].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>
\ No newline at end of file
diff --git a/[0447][Number of Boomerangs]/src/Solution.java b/[0447][Number of Boomerangs]/src/Solution.java
new file mode 100644
index 0000000..a8e26cd
--- /dev/null
+++ b/[0447][Number of Boomerangs]/src/Solution.java	
@@ -0,0 +1,69 @@
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-26 16:47
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public int numberOfBoomerangs(int[][] points) {
+        int count = 0;
+        if (points == null || points.length < 2){
+            return count;
+        }
+        Map<Integer, Integer> map = new HashMap<>();
+
+        for (int i = 0; i < points.length; i++) {
+            for (int j = 0; j < points.length; j++) {
+
+                if (i == j) {
+                    continue;
+                }
+                int square = square(points[i], points[j]);
+                if (!map.containsKey(square)) {
+                    map.put(square, 1);
+                } else {
+                    count += map.get(square) * 2; // A
+                    int oldCount = map.get(square);
+                    map.put(square, oldCount + 1);
+                }
+            }
+
+            // 如果不在A处理，那么对于大于1的value，取组合值
+            // C(2, n) * 2 = 1*2*...*(n-2)*2
+            // 放在A处理进行了分散处理
+
+            map.clear();
+        }
+
+        return count;
+
+    }
+
+    public int numberOfBoomerangsSlow(int[][] points) {
+
+        int answer = 0;
+        for (int i = 0; i < points.length; i++) {
+            for (int j = i + 1; j < points.length; j++) {
+                for (int k = 0; k < points.length; k++) {
+                    if (k != i && k != j && square(points[k], points[i]) == square(points[k], points[j])) {
+                        answer += 2;
+                    }
+                }
+            }
+        }
+
+        return answer;
+    }
+
+    public int square(int[] a, int[] b) {
+        int x = a[0] - b[0];
+        int y = a[1] - b[1];
+
+        return x * x + y * y;
+    }
+
+}
diff --git a/[0447][Number of Boomerangs]/src/SolutionTest.java b/[0447][Number of Boomerangs]/src/SolutionTest.java
new file mode 100644
index 0000000..b961285
--- /dev/null
+++ b/[0447][Number of Boomerangs]/src/SolutionTest.java	
@@ -0,0 +1,26 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-26 16:55
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+    @Test
+    public void test1() {
+        Solution s = new Solution();
+        Object[][] data = {
+//                {new int[][]{{0, 0}, {1, 0}, {2, 0}}, 2},
+//                {new int[][]{{1, 1}, {2, 2}, {3, 3}}, 2},
+                {new int[][]{{0, 0}, {1, 0}, {-1, 0}, {0, 1}, {0, -1}}, 20}
+        };
+
+        for (Object[] d : data) {
+            Assert.assertEquals(d[1], s.numberOfBoomerangs((int[][]) d[0]));
+        }
+
+    }
+}

From c00675dcbc69d00b82b6523f29ec124220126f4b Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Sun, 28 Jun 2020 07:58:21 +0800
Subject: [PATCH 03/19] commit

Change-Id: Ife16b8b946583af83883888d12d19c370e020c4f
---
 [0000][common]/src/MaxSubArray.java           |   2 +-
 [0001][Two Sum]/src/Main.java                 |   3 +-
 [0001][Two Sum]/src/Solution.java             |   2 +-
 .../src/Solution.java                         |   2 +-
 [0013][Roman To Integer]/src/Solution.java    |  27 +++--
 [0014][Longest Common Prefix]/src/Main.java   |   2 +-
 .../src/Solution.java                         |   2 +-
 [0015][3 Sum]/src/Main.java                   |   2 +-
 [0015][3 Sum]/src/Solution.java               |   2 +-
 [0016][3 Sum Closest]/src/Main.java           |   2 +-
 [0016][3 Sum Closest]/src/Solution.java       |  14 +--
 [0018][4 Sum]/src/Solution.java               |   4 +-
 .../src/Solution.java                         |   1 -
 .../src/Solution.java                         |   2 -
 .../src/Solution.java                         |   2 -
 .../src/Main.java                             |   5 +-
 [0037][Sudoku Solver]/src/Solution.java       |  28 ++---
 [0039][Combination Sum]/src/Solution.java     |   8 +-
 .../src/Solution.java                         |   1 +
 [0042][Trapping Rain Water]/src/Solution.java |   1 +
 [0046][Permutations]/src/Solution.java        |   1 -
 [0047][Permutations II]/src/Solution.java     |   3 +-
 [0049][Group Anagrams]/src/Solution.java      |   6 +-
 [0055][Jump Game]/src/Solution.java           |   4 +-
 [0056][Merge Intervals]/src/Solution.java     |   5 +-
 [0057][Insert Interval]/src/Solution.java     |   2 -
 [0070][Climbing Stairs]/src/Solution.java     |   1 +
 [0073][Set Matrix Zeroes]/src/Solution.java   |   2 +-
 [0079][Word Search]/src/Main.java             |   4 +-
 [0079][Word Search]/src/Solution.java         |   2 +-
 .../src/Main.java                             |   2 +-
 .../src/Solution.java                         |   2 +-
 .../src/Solution2.java                        |   1 +
 .../src/Solution.java                         |   1 +
 [0086][Partition List]/src/ListNode.java      |   5 +-
 [0089][Gray Code]/src/Main.java               |   2 +-
 [0090][Subsets II]/src/Main.java              |   2 -
 .../src/ListNode.java                         |   5 +-
 .../src/Main.java                             |   4 +-
 .../src/Solution.java                         |   4 +-
 .../src/TreeNode.java                         |   2 +-
 .../src/Solution2.java                        |  18 +--
 [0100][Same Tree]/src/TreeNode.java           |   7 +-
 .../src/Main.java                             |   6 +-
 .../src/Solution.java                         |   1 -
 .../src/TreeNode.java                         |   7 +-
 [0126][Word Ladder II]/src/Main.java          |   6 +-
 [0126][Word Ladder II]/src/Solution.java      |   8 +-
 [0126][Word Ladder II]/src/Solution2.java     |  10 +-
 [0126][Word Ladder II]/src/Solution3.java     |   6 +-
 [0127][Word Ladder]/src/Solution.java         |   6 +-
 [0130][Surrounded Regions]/src/Solution.java  |   1 -
 [0131][Palindrome Partitioning]/src/Main.java |   2 -
 [0136][Single Number]/src/Solution.java       |   8 +-
 .../src/Main.java                             |   4 +-
 .../src/Solution.java                         |   2 +-
 [0141][Linked List Cycle]/src/ListNode.java   |   3 +-
 .../src/ListNode.java                         |   3 +-
 [0143][Reorder List]/src/ListNode.java        |   2 +-
 [0143][Reorder List]/src/Solution.java        |   1 +
 .../src/Main.java                             |   4 +-
 .../src/Solution.java                         |   1 -
 .../src/Solution.java                         |  15 +--
 .../src/Solution.java                         |   1 +
 .../src/BSTIterator.java                      |   8 +-
 .../src/Solution.java                         |  22 ++--
 [0191][Number Of 1 Bits]/src/Solution.java    |  12 +-
 [0200][Number Of Islands]/src/Solution.java   |  47 ++++----
 [0202][Happy Number ]/src/Solution.java       |  12 +-
 [0206][Reverse Linked List]/src/Solution.java |   1 +
 [0207][Course Schedule]/src/Main.java         |   2 +-
 [0207][Course Schedule]/src/Solution.java     |   8 +-
 .../src/Main.java                             |   4 +-
 .../src/Solution.java                         |  34 +++---
 [0216][Combination Sum III]/src/Solution.java |  59 +++++----
 [0217][Contains Duplicate ]/src/Solution.java |  20 +--
 .../src/Solution.java                         |  28 ++---
 [0223][Rectangle Area]/src/Solution.java      |  34 +++---
 .../src/MyQueue.java                          |   3 +-
 .../src/ListNode.java                         |   2 +-
 .../src/Solution.java                         |   2 +-
 [0234][Palindrome Linked List]/src/Test.java  |  14 +--
 .../src/TreeNode.java                         |   2 +-
 .../src/ListNode.java                         |   2 +-
 .../src/Solution.java                         |   1 +
 .../src/Test.java                             |   4 +-
 .../src/Solution.java                         |   9 +-
 .../src/Solution.java                         |   2 +-
 .../src/Solution.java                         |   1 +
 .../src/VersionControl.java                   |   2 +-
 [0292][Nim Game]/src/Solution.java            |   4 +-
 .../src/NumArray.java                         |   4 +-
 [0326][Power of Three]/src/Solution.java      |   2 +-
 [0326][Power of Three]/src/Test.java          |   4 +-
 [0338][Counting Bits ]/src/Solution.java      |   1 +
 [0344][Reverse String]/src/Solution.java      |   2 +-
 .../src/Solution.java                         |   8 +-
 [0371][Sum of Two Integers]/src/Solution.java |   1 +
 .../src/Solution.java                         |   1 +
 .../src/Solution.java                         |   3 +-
 [0389][Find the Difference]/src/Solution.java |   1 +
 [0392][Is Subsequence]/src/Solution.java      |   5 +-
 [0400][Nth Digit]/src/Solution2.java          |   2 +
 [0401][Binary Watch]/src/Main.java            |   1 -
 [0404][Sum of Left Leaves]/src/Main.java      |   2 +-
 [0404][Sum of Left Leaves]/src/Solution.java  |   4 +-
 .../src/Main.java                             |   6 +-
 [0409][Longest Palindrome]/src/Solution2.java |   1 +
 [0412][Fizz Buzz]/src/Solution.java           |   1 +
 [0415][Add Strings]/src/Solution.java         | 114 +++++++++---------
 [0419][Battleships in a Board]/src/Main.java  |   6 +-
 .../src/Solution.java                         |   6 +-
 [0427][Construct Quad Tree]/src/Node.java     |   8 +-
 [0427][Construct Quad Tree]/src/Solution.java |   2 +-
 .../src/Main.java                             |   1 -
 .../src/Node.java                             |   2 +-
 .../src/Solution.java                         |   1 +
 [0437][Path Sum III]/src/Main.java            |  16 +--
 [0437][Path Sum III]/src/TreeNode.java        |   2 +-
 .../src/Solution.java                         |   5 +-
 .../src/Solution2.java                        |   6 +-
 [0441][Arranging Coins]/src/Solution.java     |   5 +-
 [0441][Arranging Coins]/src/SolutionTest.java |   2 +-
 .../src/Solution.java                         |   9 +-
 .../src/Solution2.java                        |   2 +-
 .../src/SolutionTest.java                     |   2 +-
 .../src/Solution.java                         |   2 +-
 [0455][Assign Cookies]/src/Solution.java      |   2 +
 [0461][Hamming Distance]/src/Solution.java    |   1 +
 [0463][Island Perimeter]/src/Solution2.java   |   1 +
 [0475][Heaters]/src/Solution.java             |   1 +
 [0476][Number Complement]/src/Solution.java   |   1 +
 .../src/Solution.java                         |   3 +-
 .../src/Solution.java                         |   1 +
 [0500][Keyboard Row]/src/Solution.java        |   2 +-
 .../src/Solution.java                         |  12 +-
 .../src/TreeNode.java                         |   1 -
 [0504][Base 7]/src/Solution.java              |   1 +
 [0561][Array Partition I]/src/Main.java       |   4 +-
 [0561][Array Partition I]/src/Solution.java   |   4 +-
 [0617][Merge Two Binary Trees]/src/Main.java  |   3 +-
 .../src/Solution.java                         |   1 -
 .../src/TreeNode.java                         |   1 -
 [0969][Pancake Sorting]/src/Solution.java     |   2 +
 .../src/Solution.java                         |   3 +
 .../src/TreeNode.java                         |   2 +-
 [1089][Duplicate Zeros]/src/Solution.java     |   2 +-
 .../src/Solution.java                         |   4 +-
 148 files changed, 459 insertions(+), 466 deletions(-)

diff --git a/[0000][common]/src/MaxSubArray.java b/[0000][common]/src/MaxSubArray.java
index e19a385..9a12bb0 100644
--- a/[0000][common]/src/MaxSubArray.java
+++ b/[0000][common]/src/MaxSubArray.java
@@ -7,7 +7,7 @@
  * @time: 2019-06-16 11:16
  **/
 public class MaxSubArray {
-    public  int[] solve(int[] array) {
+    public int[] solve(int[] array) {
         if (array == null || array.length < 1) {
             return null;
         }
diff --git a/[0001][Two Sum]/src/Main.java b/[0001][Two Sum]/src/Main.java
index 7c82290..da4a59c 100644
--- a/[0001][Two Sum]/src/Main.java	
+++ b/[0001][Two Sum]/src/Main.java	
@@ -25,9 +25,10 @@ public void test2() {
         int[] result = new Solution().twoSum(new int[]{3, 2, 4}, 6);
         System.out.println("[" + result[0] + " ," + result[1] + "]");
     }
+
     @Test
     public void test3() {
-        int[] nums = {876,879,155,291,431,296,592,965,502,173,869,504,258,342,192,478,270,341,811,794,472,625,229,829,122,858,738,481,102,946,305,399,216,752,413,352,271,193,534,508,152,989,154,456,168,510,391,28,317,409,609,532,784,160,696,105,245,231,20,17,81,781,79,816,918,838,123,602,338,997,192,947,388,515,510,441,175,539,708,980,207,336,524,610,3,427,282,84,953,855,117,737,288,371,623,484,738,874,426,202,481,132,499,500,89,786,276,221,857,398,242,639,771,149,758,775,39,836,70,903,193,959,169,851,798,815,755,498,308,70,217,765,504,498,56,547,578,977,882,909,9,874,223,39,429,982,129,712,77,996,43,613,800,810,73,993,763,978,912,255,468,937,987,701,155,347,980,147,698,41,353,178,396,241,71,482,40,593,993,959,193,544,376,752,804,194,800,837,673,261,348,963,918,217,945,271,493,538,203,54,850,753,954,312,584,399,504,62,124,790,542,239,662,410,12,362,798,726,798,780,785,737,280,931,452,643,362,190,975,520,219,330,290,451,22,756,837,787,758,661,75,697,419,485,290,84,401,447,400,311,121,216,574,724,733,496,680,831,736,43,578,201,109,197,125,66,739,339,925,148,381,513,152,305,603,516,979,133,993,430,167,826,526,290,562,559,947,448,903,289,259,221,915,71,879,639,390,588,496,430,778,722,421,821,436,621,959,728,81,117,202,17,408,829,438,970,93,738,838,902,248,128,903,800,567,829,3,407,306,773,71,323,492,305,301,28,220,455,320,478,873,483,521,260,460,342,846,577,874,530,588,965,985,606,410,443,662,81,667,27,912,602,957,822,164,489,942,414,549,991,747,680,498,831,805,89,846,467,909,7,651,250,534,984,587,348,150,329,194,20,519,250,232,224,378,539,83,177,872,130,419,387,654,917,259,447,979,184,965,51,349,422,983,682,172,177,177,484,652,930,495,65,511,318,621,297,803,476,370,826,328,150,354,393,900,340,73,781,70,260,293,862,335,395,51,326,363,78,968,446,565,683,654,767,719,324,2,617,451,56,789,464,119,53,269,369,137,612,54,217,719,823,601,663,310,594,301,636,22,333,351,126,810,812,827,634,441,534,434,967,637,795,335,965,876,778,987,217,451,264,341,566,656,612,413,682,429,161,801,167,309,846,754,541,9,711,707,848,989,580,20,431,163,252,200,54,56,666,425,592,513,230,894,20,260,282,297,129,414,326,577,184,698,620,138,131,236,848,995,879,354,107,67,92,260,531,757,640,305,848,959,416,109,513,769,131,501,197,225,358,67,663,761,742,83,648,230,59,873,231,228,470,503,615,245,258,84,832,132,156,324,27,583,766,676,130,978,306,387,733,592,763,592,487,504,493,139,897,290,432,976,946,24,586,104,648,333,2,359,166,968,990,39,353,376,839,9,75,874,203,762,489,21,14,888,570,449,539,772,919,697,883,278,18,151,113,148,330,158,772,852,93,288,213,299,338,297,862,371,708,815,108,326,115,923,541,144,521,441,99,773,950,519,948,258,328,624,936,681,935,328,70,826,110,153,236,191,222,340,653,918,976,857,184,193,397,39,190,147,763,760,95,917,559,529,680,376,389,215,705,586,205,653,324,960,33,404,888,680,95,263,860,150,683,930,588,9,690,919,745,815,331,425,879,648,398,2,997,865,429,399,264,704,699,333,126,753,565,529,35,520,94,401,552,592,543,864,23,764,763,51,631,348,198,255,73,281,996,371,23,581,84,367,469,604,716,393,942,764,239,502,501,973,438,760,398,158,853,178,348,659,1000,739,296,444,587,528,355,867,615,847,885,160,357,618,959,330,82,182,59,224,355,250,270,447,534,97,590,284,909,406,954,419,909,158,626,818,350,994,609,540,957,152,827,830,386,380,318,580,853,440,789,432,710,955,381,241,930,880,632,750,876,189,662,127,434,38,144,20,424,27,466,538,158,416,508,990,650,698,990,970,663,121,9,713,489,977,530,694,141,930,169,695,305,567,368,777,442,668,746,618,86,592,185,328,772,213,644,440,178,243,774,467,991,455,404,919,197,830,568,661,826,841,695,52,982,515,47,47,198,9,272,425,975,472,9,302,338,470,542,247,492,367,180,708,521,592,58,572,887,670,314,191,280,256,845,971,157,725,862,452,76,200,538,44,324,992,459,196,18,64,147,423,187,191,246,305,973,802,832,436,444,242,979,351,733,459,825,833,691,372,861,617,618,190,57,848,527,56,378,533,308,430,473,701,401,871,790,459,216,983,305,61,391,251,447,661,951,150,28,572,206,299,477,703,301,227,960,866,450,335,337,852,906,956,873,893,867,196,131,456,608,688,840,569,91,922,606,961,906,836,168,838,91,607,186,754,708,477,248,138,211,458,17,509,645,629,816,47,185,661,856,508,984,320,763,297,9,446,970,472,12,386,476,686,940,387,721,546,206,110,349,88,781,150,308,136,809,670,291,767,889,926,999,832,462,706,13,9,753,458,309,984,404,801,366,56,611,38,691,174,670,306,229,12,151,697,415,180,655,418,975,781,40,448,625,775,722,350,163,397,634,102,961,322,354,836,652,877,997,397,957,640,70,467,976,901,792,173,869,248,829,919,89,324,9,639,560,744,890,846,452,197,558,756,988,771,573,494,64,423,348,296,587,327,909,371,24,369,174,132,197,412,142,257,790,770,171,875,724,608,329,256,626,868,22,311,499,933,173,78,631,931,191,132,970,194,778,33,832,75,76,63,271,905,164,970,716,216,828,56,131,898,565,791,47,634,205,118,280,605,896,433,38,39,303,242,746,673,541,759,588,990,586,244,152,586,371,666,361,691,815,658,537,371,482,656,117,316,327,368,657,848,557,761,221,147,673,945,914,976,579,804,405,182,89,429,133,485,939,586,452,20,292,108,747,188,899,293,125,976,573,162,592,880,241,685,191,539,361,430,84,791,903,475,96,388,485,416,583,944,939,987,939,545,474,272,494,664,543,480,812,212,400,728,28,379,410,127,607,59,614,883,509,695,765,533,665,754,848,268,159,678,807,325,125,92,208,216,337,697,778,466,861,22,950,74,804,925,617,159,73,676,712,558,487,711,774,383,817,737,555,811,304,743,27,67,535,426,766,615,102,437,765,291,718,641,951,255,375,442,204,108,455,592,364,457,758,486,593,780,277,789,323,404,473,258,953,318,898,555,390,727,510,783,427,806,92,33,474,858,851,783,12,752,356,942,307,235,397,915,502,939};
+        int[] nums = {876, 879, 155, 291, 431, 296, 592, 965, 502, 173, 869, 504, 258, 342, 192, 478, 270, 341, 811, 794, 472, 625, 229, 829, 122, 858, 738, 481, 102, 946, 305, 399, 216, 752, 413, 352, 271, 193, 534, 508, 152, 989, 154, 456, 168, 510, 391, 28, 317, 409, 609, 532, 784, 160, 696, 105, 245, 231, 20, 17, 81, 781, 79, 816, 918, 838, 123, 602, 338, 997, 192, 947, 388, 515, 510, 441, 175, 539, 708, 980, 207, 336, 524, 610, 3, 427, 282, 84, 953, 855, 117, 737, 288, 371, 623, 484, 738, 874, 426, 202, 481, 132, 499, 500, 89, 786, 276, 221, 857, 398, 242, 639, 771, 149, 758, 775, 39, 836, 70, 903, 193, 959, 169, 851, 798, 815, 755, 498, 308, 70, 217, 765, 504, 498, 56, 547, 578, 977, 882, 909, 9, 874, 223, 39, 429, 982, 129, 712, 77, 996, 43, 613, 800, 810, 73, 993, 763, 978, 912, 255, 468, 937, 987, 701, 155, 347, 980, 147, 698, 41, 353, 178, 396, 241, 71, 482, 40, 593, 993, 959, 193, 544, 376, 752, 804, 194, 800, 837, 673, 261, 348, 963, 918, 217, 945, 271, 493, 538, 203, 54, 850, 753, 954, 312, 584, 399, 504, 62, 124, 790, 542, 239, 662, 410, 12, 362, 798, 726, 798, 780, 785, 737, 280, 931, 452, 643, 362, 190, 975, 520, 219, 330, 290, 451, 22, 756, 837, 787, 758, 661, 75, 697, 419, 485, 290, 84, 401, 447, 400, 311, 121, 216, 574, 724, 733, 496, 680, 831, 736, 43, 578, 201, 109, 197, 125, 66, 739, 339, 925, 148, 381, 513, 152, 305, 603, 516, 979, 133, 993, 430, 167, 826, 526, 290, 562, 559, 947, 448, 903, 289, 259, 221, 915, 71, 879, 639, 390, 588, 496, 430, 778, 722, 421, 821, 436, 621, 959, 728, 81, 117, 202, 17, 408, 829, 438, 970, 93, 738, 838, 902, 248, 128, 903, 800, 567, 829, 3, 407, 306, 773, 71, 323, 492, 305, 301, 28, 220, 455, 320, 478, 873, 483, 521, 260, 460, 342, 846, 577, 874, 530, 588, 965, 985, 606, 410, 443, 662, 81, 667, 27, 912, 602, 957, 822, 164, 489, 942, 414, 549, 991, 747, 680, 498, 831, 805, 89, 846, 467, 909, 7, 651, 250, 534, 984, 587, 348, 150, 329, 194, 20, 519, 250, 232, 224, 378, 539, 83, 177, 872, 130, 419, 387, 654, 917, 259, 447, 979, 184, 965, 51, 349, 422, 983, 682, 172, 177, 177, 484, 652, 930, 495, 65, 511, 318, 621, 297, 803, 476, 370, 826, 328, 150, 354, 393, 900, 340, 73, 781, 70, 260, 293, 862, 335, 395, 51, 326, 363, 78, 968, 446, 565, 683, 654, 767, 719, 324, 2, 617, 451, 56, 789, 464, 119, 53, 269, 369, 137, 612, 54, 217, 719, 823, 601, 663, 310, 594, 301, 636, 22, 333, 351, 126, 810, 812, 827, 634, 441, 534, 434, 967, 637, 795, 335, 965, 876, 778, 987, 217, 451, 264, 341, 566, 656, 612, 413, 682, 429, 161, 801, 167, 309, 846, 754, 541, 9, 711, 707, 848, 989, 580, 20, 431, 163, 252, 200, 54, 56, 666, 425, 592, 513, 230, 894, 20, 260, 282, 297, 129, 414, 326, 577, 184, 698, 620, 138, 131, 236, 848, 995, 879, 354, 107, 67, 92, 260, 531, 757, 640, 305, 848, 959, 416, 109, 513, 769, 131, 501, 197, 225, 358, 67, 663, 761, 742, 83, 648, 230, 59, 873, 231, 228, 470, 503, 615, 245, 258, 84, 832, 132, 156, 324, 27, 583, 766, 676, 130, 978, 306, 387, 733, 592, 763, 592, 487, 504, 493, 139, 897, 290, 432, 976, 946, 24, 586, 104, 648, 333, 2, 359, 166, 968, 990, 39, 353, 376, 839, 9, 75, 874, 203, 762, 489, 21, 14, 888, 570, 449, 539, 772, 919, 697, 883, 278, 18, 151, 113, 148, 330, 158, 772, 852, 93, 288, 213, 299, 338, 297, 862, 371, 708, 815, 108, 326, 115, 923, 541, 144, 521, 441, 99, 773, 950, 519, 948, 258, 328, 624, 936, 681, 935, 328, 70, 826, 110, 153, 236, 191, 222, 340, 653, 918, 976, 857, 184, 193, 397, 39, 190, 147, 763, 760, 95, 917, 559, 529, 680, 376, 389, 215, 705, 586, 205, 653, 324, 960, 33, 404, 888, 680, 95, 263, 860, 150, 683, 930, 588, 9, 690, 919, 745, 815, 331, 425, 879, 648, 398, 2, 997, 865, 429, 399, 264, 704, 699, 333, 126, 753, 565, 529, 35, 520, 94, 401, 552, 592, 543, 864, 23, 764, 763, 51, 631, 348, 198, 255, 73, 281, 996, 371, 23, 581, 84, 367, 469, 604, 716, 393, 942, 764, 239, 502, 501, 973, 438, 760, 398, 158, 853, 178, 348, 659, 1000, 739, 296, 444, 587, 528, 355, 867, 615, 847, 885, 160, 357, 618, 959, 330, 82, 182, 59, 224, 355, 250, 270, 447, 534, 97, 590, 284, 909, 406, 954, 419, 909, 158, 626, 818, 350, 994, 609, 540, 957, 152, 827, 830, 386, 380, 318, 580, 853, 440, 789, 432, 710, 955, 381, 241, 930, 880, 632, 750, 876, 189, 662, 127, 434, 38, 144, 20, 424, 27, 466, 538, 158, 416, 508, 990, 650, 698, 990, 970, 663, 121, 9, 713, 489, 977, 530, 694, 141, 930, 169, 695, 305, 567, 368, 777, 442, 668, 746, 618, 86, 592, 185, 328, 772, 213, 644, 440, 178, 243, 774, 467, 991, 455, 404, 919, 197, 830, 568, 661, 826, 841, 695, 52, 982, 515, 47, 47, 198, 9, 272, 425, 975, 472, 9, 302, 338, 470, 542, 247, 492, 367, 180, 708, 521, 592, 58, 572, 887, 670, 314, 191, 280, 256, 845, 971, 157, 725, 862, 452, 76, 200, 538, 44, 324, 992, 459, 196, 18, 64, 147, 423, 187, 191, 246, 305, 973, 802, 832, 436, 444, 242, 979, 351, 733, 459, 825, 833, 691, 372, 861, 617, 618, 190, 57, 848, 527, 56, 378, 533, 308, 430, 473, 701, 401, 871, 790, 459, 216, 983, 305, 61, 391, 251, 447, 661, 951, 150, 28, 572, 206, 299, 477, 703, 301, 227, 960, 866, 450, 335, 337, 852, 906, 956, 873, 893, 867, 196, 131, 456, 608, 688, 840, 569, 91, 922, 606, 961, 906, 836, 168, 838, 91, 607, 186, 754, 708, 477, 248, 138, 211, 458, 17, 509, 645, 629, 816, 47, 185, 661, 856, 508, 984, 320, 763, 297, 9, 446, 970, 472, 12, 386, 476, 686, 940, 387, 721, 546, 206, 110, 349, 88, 781, 150, 308, 136, 809, 670, 291, 767, 889, 926, 999, 832, 462, 706, 13, 9, 753, 458, 309, 984, 404, 801, 366, 56, 611, 38, 691, 174, 670, 306, 229, 12, 151, 697, 415, 180, 655, 418, 975, 781, 40, 448, 625, 775, 722, 350, 163, 397, 634, 102, 961, 322, 354, 836, 652, 877, 997, 397, 957, 640, 70, 467, 976, 901, 792, 173, 869, 248, 829, 919, 89, 324, 9, 639, 560, 744, 890, 846, 452, 197, 558, 756, 988, 771, 573, 494, 64, 423, 348, 296, 587, 327, 909, 371, 24, 369, 174, 132, 197, 412, 142, 257, 790, 770, 171, 875, 724, 608, 329, 256, 626, 868, 22, 311, 499, 933, 173, 78, 631, 931, 191, 132, 970, 194, 778, 33, 832, 75, 76, 63, 271, 905, 164, 970, 716, 216, 828, 56, 131, 898, 565, 791, 47, 634, 205, 118, 280, 605, 896, 433, 38, 39, 303, 242, 746, 673, 541, 759, 588, 990, 586, 244, 152, 586, 371, 666, 361, 691, 815, 658, 537, 371, 482, 656, 117, 316, 327, 368, 657, 848, 557, 761, 221, 147, 673, 945, 914, 976, 579, 804, 405, 182, 89, 429, 133, 485, 939, 586, 452, 20, 292, 108, 747, 188, 899, 293, 125, 976, 573, 162, 592, 880, 241, 685, 191, 539, 361, 430, 84, 791, 903, 475, 96, 388, 485, 416, 583, 944, 939, 987, 939, 545, 474, 272, 494, 664, 543, 480, 812, 212, 400, 728, 28, 379, 410, 127, 607, 59, 614, 883, 509, 695, 765, 533, 665, 754, 848, 268, 159, 678, 807, 325, 125, 92, 208, 216, 337, 697, 778, 466, 861, 22, 950, 74, 804, 925, 617, 159, 73, 676, 712, 558, 487, 711, 774, 383, 817, 737, 555, 811, 304, 743, 27, 67, 535, 426, 766, 615, 102, 437, 765, 291, 718, 641, 951, 255, 375, 442, 204, 108, 455, 592, 364, 457, 758, 486, 593, 780, 277, 789, 323, 404, 473, 258, 953, 318, 898, 555, 390, 727, 510, 783, 427, 806, 92, 33, 474, 858, 851, 783, 12, 752, 356, 942, 307, 235, 397, 915, 502, 939};
         int target = 28;
         int[] result = new Solution().twoSum(nums, target);
         System.out.println("[" + result[0] + " ," + result[1] + "]");
diff --git a/[0001][Two Sum]/src/Solution.java b/[0001][Two Sum]/src/Solution.java
index 5380a2f..707bcc7 100644
--- a/[0001][Two Sum]/src/Solution.java	
+++ b/[0001][Two Sum]/src/Solution.java	
@@ -62,7 +62,7 @@ public int[] twoSum(int[] nums, int target) {
                     List<Integer> list = map.get(num);
                     result[0] = Math.min(list.get(0), list.get(1));
                     result[1] = Math.max(list.get(0), list.get(1));
-                } else if (gap != num){
+                } else if (gap != num) {
                     result[0] = Math.min(map.get(num).get(0), map.get(gap).get(0));
                     result[1] = Math.max(map.get(num).get(0), map.get(gap).get(0));
                 }
diff --git a/[0010][Regular Expression Matching]/src/Solution.java b/[0010][Regular Expression Matching]/src/Solution.java
index b462e2f..8116492 100644
--- a/[0010][Regular Expression Matching]/src/Solution.java	
+++ b/[0010][Regular Expression Matching]/src/Solution.java	
@@ -44,7 +44,7 @@ public boolean isMatch(String s, String p) {
         match[s.length()] = true;
         for (int i = p.length() - 1; i >= 0; i--) {
             if (p.charAt(i) == '*') {
-                for (int j = s.length() - 1; j >= 0; j--)  {
+                for (int j = s.length() - 1; j >= 0; j--) {
                     match[j] = match[j] || match[j + 1]
                             && (p.charAt(i - 1) == '.' || s.charAt(j) == p.charAt(i - 1));
                 }
diff --git a/[0013][Roman To Integer]/src/Solution.java b/[0013][Roman To Integer]/src/Solution.java
index f47e222..eee8be3 100644
--- a/[0013][Roman To Integer]/src/Solution.java	
+++ b/[0013][Roman To Integer]/src/Solution.java	
@@ -34,22 +34,31 @@ public int romanToInt(String s) {
                 // 要减去两倍之前前值才能回到真实值
                 result += charToInt(s.charAt(i)) - 2 * charToInt(s.charAt(i - 1));
             } else {
-                result  += charToInt(s.charAt(i));
+                result += charToInt(s.charAt(i));
             }
         }
 
         return result;
     }
+
     private int charToInt(char c) {
         switch (c) {
-            case 'I': return 1;
-            case 'V': return 5;
-            case 'X': return 10;
-            case 'L': return 50;
-            case 'C': return 100;
-            case 'D': return 500;
-            case 'M': return 1000;
-            default: return 0;
+            case 'I':
+                return 1;
+            case 'V':
+                return 5;
+            case 'X':
+                return 10;
+            case 'L':
+                return 50;
+            case 'C':
+                return 100;
+            case 'D':
+                return 500;
+            case 'M':
+                return 1000;
+            default:
+                return 0;
         }
     }
 }
diff --git a/[0014][Longest Common Prefix]/src/Main.java b/[0014][Longest Common Prefix]/src/Main.java
index 5a40b00..8b1b6f7 100644
--- a/[0014][Longest Common Prefix]/src/Main.java	
+++ b/[0014][Longest Common Prefix]/src/Main.java	
@@ -15,6 +15,6 @@ public void test1() {
     @Test
     public void test2() {
         Solution solution = new Solution();
-        Assert.assertEquals("", solution.longestCommonPrefix(new String[]{"dog","racecar","car"}));
+        Assert.assertEquals("", solution.longestCommonPrefix(new String[]{"dog", "racecar", "car"}));
     }
 }
diff --git a/[0014][Longest Common Prefix]/src/Solution.java b/[0014][Longest Common Prefix]/src/Solution.java
index c7fd1ef..05c3523 100644
--- a/[0014][Longest Common Prefix]/src/Solution.java	
+++ b/[0014][Longest Common Prefix]/src/Solution.java	
@@ -46,7 +46,7 @@ public String longestCommonPrefix(String[] strs) {
             }
         }
 
-        for (String s: strs) {
+        for (String s : strs) {
             for (int i = 0; i < result.length(); i++) {
                 if (result.charAt(i) != s.charAt(i)) {
                     result = result.substring(0, i);
diff --git a/[0015][3 Sum]/src/Main.java b/[0015][3 Sum]/src/Main.java
index fc64650..1b6cc33 100644
--- a/[0015][3 Sum]/src/Main.java	
+++ b/[0015][3 Sum]/src/Main.java	
@@ -41,7 +41,7 @@ public void test4() {
     @Test
     public void test5() {
         Solution solution = new Solution();
-        System.out.println(solution.threeSum(new int[]{82597,-9243,62390,83030,-97960,-26521,-61011,83390,-38677,12333,75987,46091,83794,19355,-71037,-6242,-28801,324,1202,-90885,-2989,-95597,-34333,35528,5680,89093,-90606,50360,-29393,-27012,53313,65213,99818,-82405,-41661,-3333,-51952,72135,-1523,26377,74685,96992,92263,15929,5467,-99555,-43348,-41689,-60383,-3990,32165,65265,-72973,-58372,12741,-48568,-46596,72419,-1859,34153,62937,81310,-61823,-96770,-54944,8845,-91184,24208,-29078,31495,65258,14198,85395,70506,-40908,56740,-12228,-40072,32429,93001,68445,-73927,25731,-91859,-24150,10093,-60271,-81683,-18126,51055,48189,-6468,25057,81194,-58628,74042,66158,-14452,-49851,-43667,11092,39189,-17025,-79173,13606,83172,92647,-59741,19343,-26644,-57607,82908,-20655,1637,80060,98994,39331,-31274,-61523,91225,-72953,13211,-75116,-98421,-41571,-69074,99587,39345,42151,-2460,98236,15690,-52507,-95803,-48935,-46492,-45606,-79254,-99851,52533,73486,39948,-7240,71815,-585,-96252,90990,-93815,93340,-71848,58733,-14859,-83082,-75794,-82082,-24871,-15206,91207,-56469,-93618,67131,-8682,75719,87429,-98757,-7535,-24890,-94160,85003,33928,75538,97456,-66424,-60074,-8527,-28697,-22308,2246,-70134,-82319,-10184,87081,-34949,-28645,-47352,-83966,-60418,-15293,-53067,-25921,55172,75064,95859,48049,34311,-86931,-38586,33686,-36714,96922,76713,-22165,-80585,-34503,-44516,39217,-28457,47227,-94036,43457,24626,-87359,26898,-70819,30528,-32397,-69486,84912,-1187,-98986,-32958,4280,-79129,-65604,9344,58964,50584,71128,-55480,24986,15086,-62360,-42977,-49482,-77256,-36895,-74818,20,3063,-49426,28152,-97329,6086,86035,-88743,35241,44249,19927,-10660,89404,24179,-26621,-6511,57745,-28750,96340,-97160,-97822,-49979,52307,79462,94273,-24808,77104,9255,-83057,77655,21361,55956,-9096,48599,-40490,-55107,2689,29608,20497,66834,-34678,23553,-81400,-66630,-96321,-34499,-12957,-20564,25610,-4322,-58462,20801,53700,71527,24669,-54534,57879,-3221,33636,3900,97832,-27688,-98715,5992,24520,-55401,-57613,-69926,57377,-77610,20123,52174,860,60429,-91994,-62403,-6218,-90610,-37263,-15052,62069,-96465,44254,89892,-3406,19121,-41842,-87783,-64125,-56120,73904,-22797,-58118,-4866,5356,75318,46119,21276,-19246,-9241,-97425,57333,-15802,93149,25689,-5532,95716,39209,-87672,-29470,-16324,-15331,27632,-39454,56530,-16000,29853,46475,78242,-46602,83192,-73440,-15816,50964,-36601,89758,38375,-40007,-36675,-94030,67576,46811,-64919,45595,76530,40398,35845,41791,67697,-30439,-82944,63115,33447,-36046,-50122,-34789,43003,-78947,-38763,-89210,32756,-20389,-31358,-90526,-81607,88741,86643,98422,47389,-75189,13091,95993,-15501,94260,-25584,-1483,-67261,-70753,25160,89614,-90620,-48542,83889,-12388,-9642,-37043,-67663,28794,-8801,13621,12241,55379,84290,21692,-95906,-85617,-17341,-63767,80183,-4942,-51478,30997,-13658,8838,17452,-82869,-39897,68449,31964,98158,-49489,62283,-62209,-92792,-59342,55146,-38533,20496,62667,62593,36095,-12470,5453,-50451,74716,-17902,3302,-16760,-71642,-34819,96459,-72860,21638,47342,-69897,-40180,44466,76496,84659,13848,-91600,-90887,-63742,-2156,-84981,-99280,94326,-33854,92029,-50811,98711,-36459,-75555,79110,-88164,-97397,-84217,97457,64387,30513,-53190,-83215,252,2344,-27177,-92945,-89010,82662,-11670,86069,53417,42702,97082,3695,-14530,-46334,17910,77999,28009,-12374,15498,-46941,97088,-35030,95040,92095,-59469,-24761,46491,67357,-66658,37446,-65130,-50416,99197,30925,27308,54122,-44719,12582,-99525,-38446,-69050,-22352,94757,-56062,33684,-40199,-46399,96842,-50881,-22380,-65021,40582,53623,-76034,77018,-97074,-84838,-22953,-74205,79715,-33920,-35794,-91369,73421,-82492,63680,-14915,-33295,37145,76852,-69442,60125,-74166,74308,-1900,-30195,-16267,-60781,-27760,5852,38917,25742,-3765,49097,-63541,98612,-92865,-30248,9612,-8798,53262,95781,-42278,-36529,7252,-27394,-5021,59178,80934,-48480,-75131,-54439,-19145,-48140,98457,-6601,-51616,-89730,78028,32083,-48904,16822,-81153,-8832,48720,-80728,-45133,-86647,-4259,-40453,2590,28613,50523,-4105,-27790,-74579,-17223,63721,33489,-47921,97628,-97691,-14782,-65644,18008,-93651,-71266,80990,-76732,-47104,35368,28632,59818,-86269,-89753,34557,-92230,-5933,-3487,-73557,-13174,-43981,-43630,-55171,30254,-83710,-99583,-13500,71787,5017,-25117,-78586,86941,-3251,-23867,-36315,75973,86272,-45575,77462,-98836,-10859,70168,-32971,-38739,-12761,93410,14014,-30706,-77356,-85965,-62316,63918,-59914,-64088,1591,-10957,38004,15129,-83602,-51791,34381,-89382,-26056,8942,5465,71458,-73805,-87445,-19921,-80784,69150,-34168,28301,-68955,18041,6059,82342,9947,39795,44047,-57313,48569,81936,-2863,-80932,32976,-86454,-84207,33033,32867,9104,-16580,-25727,80157,-70169,53741,86522,84651,68480,84018,61932,7332,-61322,-69663,76370,41206,12326,-34689,17016,82975,-23386,39417,72793,44774,-96259,3213,79952,29265,-61492,-49337,14162,65886,3342,-41622,-62659,-90402,-24751,88511,54739,-21383,-40161,-96610,-24944,-602,-76842,-21856,69964,43994,-15121,-85530,12718,13170,-13547,69222,62417,-75305,-81446,-38786,-52075,-23110,97681,-82800,-53178,11474,35857,94197,-58148,-23689,32506,92154,-64536,-73930,-77138,97446,-83459,70963,22452,68472,-3728,-25059,-49405,95129,-6167,12808,99918,30113,-12641,-26665,86362,-33505,50661,26714,33701,89012,-91540,40517,-12716,-57185,-87230,29914,-59560,13200,-72723,58272,23913,-45586,-96593,-26265,-2141,31087,81399,92511,-34049,20577,2803,26003,8940,42117,40887,-82715,38269,40969,-50022,72088,21291,-67280,-16523,90535,18669,94342,-39568,-88080,-99486,-20716,23108,-28037,63342,36863,-29420,-44016,75135,73415,16059,-4899,86893,43136,-7041,33483,-67612,25327,40830,6184,61805,4247,81119,-22854,-26104,-63466,63093,-63685,60369,51023,51644,-16350,74438,-83514,99083,10079,-58451,-79621,48471,67131,-86940,99093,11855,-22272,-67683,-44371,9541,18123,37766,-70922,80385,-57513,-76021,-47890,36154,72935,84387,-92681,-88303,-7810,59902,-90,-64704,-28396,-66403,8860,13343,33882,85680,7228,28160,-14003,54369,-58893,92606,-63492,-10101,64714,58486,29948,-44679,-22763,10151,-56695,4031,-18242,-36232,86168,-14263,9883,47124,47271,92761,-24958,-73263,-79661,-69147,-18874,29546,-92588,-85771,26451,-86650,-43306,-59094,-47492,-34821,-91763,-47670,33537,22843,67417,-759,92159,63075,94065,-26988,55276,65903,30414,-67129,-99508,-83092,-91493,-50426,14349,-83216,-76090,32742,-5306,-93310,-60750,-60620,-45484,-21108,-58341,-28048,-52803,69735,78906,81649,32565,-86804,-83202,-65688,-1760,89707,93322,-72750,84134,71900,-37720,19450,-78018,22001,-23604,26276,-21498,65892,-72117,-89834,-23867,55817,-77963,42518,93123,-83916,63260,-2243,-97108,85442,-36775,17984,-58810,99664,-19082,93075,-69329,87061,79713,16296,70996,13483,-74582,49900,-27669,-40562,1209,-20572,34660,83193,75579,7344,64925,88361,60969,3114,44611,-27445,53049,-16085,-92851,-53306,13859,-33532,86622,-75666,-18159,-98256,51875,-42251,-27977,-18080,23772,38160,41779,9147,94175,99905,-85755,62535,-88412,-52038,-68171,93255,-44684,-11242,-104,31796,62346,-54931,-55790,-70032,46221,56541,-91947,90592,93503,4071,20646,4856,-63598,15396,-50708,32138,-85164,38528,-89959,53852,57915,-42421,-88916,-75072,67030,-29066,49542,-71591,61708,-53985,-43051,28483,46991,-83216,80991,-46254,-48716,39356,-8270,-47763,-34410,874,-1186,-7049,28846,11276,21960,-13304,-11433,-4913,55754,79616,70423,-27523,64803,49277,14906,-97401,-92390,91075,70736,21971,-3303,55333,-93996,76538,54603,-75899,98801,46887,35041,48302,-52318,55439,24574,14079,-24889,83440,14961,34312,-89260,-22293,-81271,-2586,-71059,-10640,-93095,-5453,-70041,66543,74012,-11662,-52477,-37597,-70919,92971,-17452,-67306,-80418,7225,-89296,24296,86547,37154,-10696,74436,-63959,58860,33590,-88925,-97814,-83664,85484,-8385,-50879,57729,-74728,-87852,-15524,-91120,22062,28134,80917,32026,49707,-54252,-44319,-35139,13777,44660,85274,25043,58781,-89035,-76274,6364,-63625,72855,43242,-35033,12820,-27460,77372,-47578,-61162,-70758,-1343,-4159,64935,56024,-2151,43770,19758,-30186,-86040,24666,-62332,-67542,73180,-25821,-27826,-45504,-36858,-12041,20017,-24066,-56625,-52097,-47239,-90694,8959,7712,-14258,-5860,55349,61808,-4423,-93703,64681,-98641,-25222,46999,-83831,-54714,19997,-68477,66073,51801,-66491,52061,-52866,79907,-39736,-68331,68937,91464,98892,910,93501,31295,-85873,27036,-57340,50412,21,-2445,29471,71317,82093,-94823,-54458,-97410,39560,-7628,66452,39701,54029,37906,46773,58296,60370,-61090,85501,-86874,71443,-72702,-72047,14848,34102,77975,-66294,-36576,31349,52493,-70833,-80287,94435,39745,-98291,84524,-18942,10236,93448,50846,94023,-6939,47999,14740,30165,81048,84935,-19177,-13594,32289,62628,-90612,-542,-66627,64255,71199,-83841,-82943,-73885,8623,-67214,-9474,-35249,62254,-14087,-90969,21515,-83303,94377,-91619,19956,-98810,96727,-91939,29119,-85473,-82153,-69008,44850,74299,-76459,-86464,8315,-49912,-28665,59052,-69708,76024,-92738,50098,18683,-91438,18096,-19335,35659,91826,15779,-73070,67873,-12458,-71440,-46721,54856,97212,-81875,35805,36952,68498,81627,-34231,81712,27100,-9741,-82612,18766,-36392,2759,41728,69743,26825,48355,-17790,17165,56558,3295,-24375,55669,-16109,24079,73414,48990,-11931,-78214,90745,19878,35673,-15317,-89086,94675,-92513,88410,-93248,-19475,-74041,-19165,32329,-26266,-46828,-18747,45328,8990,-78219,-25874,-74801,-44956,-54577,-29756,-99822,-35731,-18348,-68915,-83518,-53451,95471,-2954,-13706,-8763,-21642,-37210,16814,-60070,-42743,27697,-36333,-42362,11576,85742,-82536,68767,-56103,-63012,71396,-78464,-68101,-15917,-11113,-3596,77626,-60191,-30585,-73584,6214,-84303,18403,23618,-15619,-89755,-59515,-59103,-74308,-63725,-29364,-52376,-96130,70894,-12609,50845,-2314,42264,-70825,64481,55752,4460,-68603,-88701,4713,-50441,-51333,-77907,97412,-66616,-49430,60489,-85262,-97621,-18980,44727,-69321,-57730,66287,-92566,-64427,-14270,11515,-92612,-87645,61557,24197,-81923,-39831,-10301,-23640,-76219,-68025,92761,-76493,68554,-77734,-95620,-11753,-51700,98234,-68544,-61838,29467,46603,-18221,-35441,74537,40327,-58293,75755,-57301,-7532,-94163,18179,-14388,-22258,-46417,-48285,18242,-77551,82620,250,-20060,-79568,-77259,82052,-98897,-75464,48773,-79040,-11293,45941,-67876,-69204,-46477,-46107,792,60546,-34573,-12879,-94562,20356,-48004,-62429,96242,40594,2099,99494,25724,-39394,-2388,-18563,-56510,-83570,-29214,3015,74454,74197,76678,-46597,60630,-76093,37578,-82045,-24077,62082,-87787,-74936,58687,12200,-98952,70155,-77370,21710,-84625,-60556,-84128,925,65474,-15741,-94619,88377,89334,44749,22002,-45750,-93081,-14600,-83447,46691,85040,-66447,-80085,56308,44310,24979,-29694,57991,4675,-71273,-44508,13615,-54710,23552,-78253,-34637,50497,68706,81543,-88408,-21405,6001,-33834,-21570,-46692,-25344,20310,71258,-97680,11721,59977,59247,-48949,98955,-50276,-80844,-27935,-76102,55858,-33492,40680,66691,-33188,8284,64893,-7528,6019,-85523,8434,-64366,-56663,26862,30008,-7611,-12179,-70076,21426,-11261,-36864,-61937,-59677,929,-21052,3848,-20888,-16065,98995,-32293,-86121,-54564,77831,68602,74977,31658,40699,29755,98424,80358,-69337,26339,13213,-46016,-18331,64713,-46883,-58451,-70024,-92393,-4088,70628,-51185,71164,-75791,-1636,-29102,-16929,-87650,-84589,-24229,-42137,-15653,94825,13042,88499,-47100,-90358,-7180,29754,-65727,-42659,-85560,-9037,-52459,20997,-47425,17318,21122,20472,-23037,65216,-63625,-7877,-91907,24100,-72516,22903,-85247,-8938,73878,54953,87480,-31466,-99524,35369,-78376,89984,-15982,94045,-7269,23319,-80456,-37653,-76756,2909,81936,54958,-12393,60560,-84664,-82413,66941,-26573,-97532,64460,18593,-85789,-38820,-92575,-43663,-89435,83272,-50585,13616,-71541,-53156,727,-27644,16538,34049,57745,34348,35009,16634,-18791,23271,-63844,95817,21781,16590,59669,15966,-6864,48050,-36143,97427,-59390,96931,78939,-1958,50777,43338,-51149,39235,-27054,-43492,67457,-83616,37179,10390,85818,2391,73635,87579,-49127,-81264,-79023,-81590,53554,-74972,-83940,-13726,-39095,29174,78072,76104,47778,25797,-29515,-6493,-92793,22481,-36197,-65560,42342,15750,97556,99634,-56048,-35688,13501,63969,-74291,50911,39225,93702,-3490,-59461,-30105,-46761,-80113,92906,-68487,50742,36152,-90240,-83631,24597,-50566,-15477,18470,77038,40223,-80364,-98676,70957,-63647,99537,13041,31679,86631,37633,-16866,13686,-71565,21652,-46053,-80578,-61382,68487,-6417,4656,20811,67013,-30868,-11219,46,74944,14627,56965,42275,-52480,52162,-84883,-52579,-90331,92792,42184,-73422,-58440,65308,-25069,5475,-57996,59557,-17561,2826,-56939,14996,-94855,-53707,99159,43645,-67719,-1331,21412,41704,31612,32622,1919,-69333,-69828,22422,-78842,57896,-17363,27979,-76897,35008,46482,-75289,65799,20057,7170,41326,-76069,90840,-81253,-50749,3649,-42315,45238,-33924,62101,96906,58884,-7617,-28689,-66578,62458,50876,-57553,6739,41014,-64040,-34916,37940,13048,-97478,-11318,-89440,-31933,-40357,-59737,-76718,-14104,-31774,28001,4103,41702,-25120,-31654,63085,-3642,84870,-83896,-76422,-61520,12900,88678,85547,33132,-88627,52820,63915,-27472,78867,-51439,33005,-23447,-3271,-39308,39726,-74260,-31874,-36893,93656,910,-98362,60450,-88048,99308,13947,83996,-90415,-35117,70858,-55332,-31721,97528,82982,-86218,6822,25227,36946,97077,-4257,-41526,56795,89870,75860,-70802,21779,14184,-16511,-89156,-31422,71470,69600,-78498,74079,-19410,40311,28501,26397,-67574,-32518,68510,38615,19355,-6088,-97159,-29255,-92523,3023,-42536,-88681,64255,41206,44119,52208,39522,-52108,91276,-70514,83436,63289,-79741,9623,99559,12642,85950,83735,-21156,-67208,98088,-7341,-27763,-30048,-44099,-14866,-45504,-91704,19369,13700,10481,-49344,-85686,33994,19672,36028,60842,66564,-24919,33950,-93616,-47430,-35391,-28279,56806,74690,39284,-96683,-7642,-75232,37657,-14531,-86870,-9274,-26173,98640,88652,64257,46457,37814,-19370,9337,-22556,-41525,39105,-28719,51611,-93252,98044,-90996,21710,-47605,-64259,-32727,53611,-31918,-3555,33316,-66472,21274,-37731,-2919,15016,48779,-88868,1897,41728,46344,-89667,37848,68092,-44011,85354,-43776,38739,-31423,-66330,65167,-22016,59405,34328,-60042,87660,-67698,-59174,-1408,-46809,-43485,-88807,-60489,13974,22319,55836,-62995,-37375,-4185,32687,-36551,-75237,58280,26942,-73756,71756,78775,-40573,14367,-71622,-77338,24112,23414,-7679,-51721,87492,85066,-21612,57045,10673,-96836,52461,-62218,-9310,65862,-22748,89906,-96987,-98698,26956,-43428,46141,47456,28095,55952,67323,-36455,-60202,-43302,-82932,42020,77036,10142,60406,70331,63836,58850,-66752,52109,21395,-10238,-98647,-41962,27778,69060,98535,-28680,-52263,-56679,66103,-42426,27203,80021,10153,58678,36398,63112,34911,20515,62082,-15659,-40785,27054,43767,-20289,65838,-6954,-60228,-72226,52236,-35464,25209,-15462,-79617,-41668,-84083,62404,-69062,18913,46545,20757,13805,24717,-18461,-47009,-25779,68834,64824,34473,39576,31570,14861,-15114,-41233,95509,68232,67846,84902,-83060,17642,-18422,73688,77671,-26930,64484,-99637,73875,6428,21034,-73471,19664,-68031,15922,-27028,48137,54955,-82793,-41144,-10218,-24921,-28299,-2288,68518,-54452,15686,-41814,66165,-72207,-61986,80020,50544,-99500,16244,78998,40989,14525,-56061,-24692,-94790,21111,37296,-90794,72100,70550,-31757,17708,-74290,61910,78039,-78629,-25033,73172,-91953,10052,64502,99585,-1741,90324,-73723,68942,28149,30218,24422,16659,10710,-62594,94249,96588,46192,34251,73500,-65995,-81168,41412,-98724,-63710,-54696,-52407,19746,45869,27821,-94866,-76705,-13417,-61995,-71560,43450,67384,-8838,-80293,-28937,23330,-89694,-40586,46918,80429,-5475,78013,25309,-34162,37236,-77577,86744,26281,-29033,-91813,35347,13033,-13631,-24459,3325,-71078,-75359,81311,19700,47678,-74680,-84113,45192,35502,37675,19553,76522,-51098,-18211,89717,4508,-82946,27749,85995,89912,-53678,-64727,-14778,32075,-63412,-40524,86440,-2707,-36821,63850,-30883,67294,-99468,-23708,34932,34386,98899,29239,-23385,5897,54882,98660,49098,70275,17718,88533,52161,63340,50061,-89457,19491,-99156,24873,-17008,64610,-55543,50495,17056,-10400,-56678,-29073,-42960,-76418,98562,-88104,-96255,10159,-90724,54011,12052,45871,-90933,-69420,67039,37202,78051,-52197,-40278,-58425,65414,-23394,-1415,6912,-53447,7352,17307,-78147,63727,98905,55412,-57658,-32884,-44878,22755,39730,3638,35111,39777,74193,38736,-11829,-61188,-92757,55946,-71232,-63032,-83947,39147,-96684,-99233,25131,-32197,24406,-55428,-61941,25874,-69453,64483,-19644,-68441,12783,87338,-48676,66451,-447,-61590,50932,-11270,29035,65698,-63544,10029,80499,-9461,86368,91365,-81810,-71914,-52056,-13782,44240,-30093,-2437,24007,67581,-17365,-69164,-8420,-69289,-29370,48010,90439,13141,69243,50668,39328,61731,78266,-81313,17921,-38196,55261,9948,-24970,75712,-72106,28696,7461,31621,61047,51476,56512,11839,-96916,-82739,28924,-99927,58449,37280,69357,11219,-32119,-62050,-48745,-83486,-52376,42668,82659,68882,38773,46269,-96005,97630,25009,-2951,-67811,99801,81587,-79793,-18547,-83086,69512,33127,-92145,-88497,47703,59527,1909,88785,-88882,69188,-46131,-5589,-15086,36255,-53238,-33009,82664,53901,35939,-42946,-25571,33298,69291,53199,74746,-40127,-39050,91033,51717,-98048,87240,36172,65453,-94425,-63694,-30027,59004,88660,3649,-20267,-52565,-67321,34037,4320,91515,-56753,60115,27134,68617,-61395,-26503,-98929,-8849,-63318,10709,-16151,61905,-95785,5262,23670,-25277,90206,-19391,45735,37208,-31992,-92450,18516,-90452,-58870,-58602,93383,14333,17994,82411,-54126,-32576,35440,-60526,-78764,-25069,-9022,-394,92186,-38057,55328,-61569,67780,77169,19546,-92664,-94948,44484,-13439,83529,27518,-48333,72998,38342,-90553,-98578,-76906,81515,-16464,78439,92529,35225,-39968,-10130,-7845,-32245,-74955,-74996,67731,-13897,-82493,33407,93619,59560,-24404,-57553,19486,-45341,34098,-24978,-33612,79058,71847,76713,-95422,6421,-96075,-59130,-28976,-16922,-62203,69970,68331,21874,40551,89650,51908,58181,66480,-68177,34323,-3046,-49656,-59758,43564,-10960,-30796,15473,-20216,46085,-85355,41515,-30669,-87498,57711,56067,63199,-83805,62042,91213,-14606,4394,-562,74913,10406,96810,-61595,32564,31640,-9732,42058,98052,-7908,-72330,1558,-80301,34878,32900,3939,-8824,88316,20937,21566,-3218,-66080,-31620,86859,54289,90476,-42889,-15016,-18838,75456,30159,-67101,42328,-92703,85850,-5475,23470,-80806,68206,17764,88235,46421,-41578,74005,-81142,80545,20868,-1560,64017,83784,68863,-97516,-13016,-72223,79630,-55692,82255,88467,28007,-34686,-69049,-41677,88535,-8217,68060,-51280,28971,49088,49235,26905,-81117,-44888,40623,74337,-24662,97476,79542,-72082,-35093,98175,-61761,-68169,59697,-62542,-72965,59883,-64026,-37656,-92392,-12113,-73495,98258,68379,-21545,64607,-70957,-92254,-97460,-63436,-8853,-19357,-51965,-76582,12687,-49712,45413,-60043,33496,31539,-57347,41837,67280,-68813,52088,-13155,-86430,-15239,-45030,96041,18749,-23992,46048,35243,-79450,85425,-58524,88781,-39454,53073,-48864,-82289,39086,82540,-11555,25014,-5431,-39585,-89526,2705,31953,-81611,36985,-56022,68684,-27101,11422,64655,-26965,-63081,-13840,-91003,-78147,-8966,41488,1988,99021,-61575,-47060,65260,-23844,-21781,-91865,-19607,44808,2890,63692,-88663,-58272,15970,-65195,-45416,-48444,-78226,-65332,-24568,42833,-1806,-71595,80002,-52250,30952,48452,-90106,31015,-22073,62339,63318,78391,28699,77900,-4026,-76870,-45943,33665,9174,-84360,-22684,-16832,-67949,-38077,-38987,-32847,51443,-53580,-13505,9344,-92337,26585,70458,-52764,-67471,-68411,-1119,-2072,-93476,67981,40887,-89304,-12235,41488,1454,5355,-34855,-72080,24514,-58305,3340,34331,8731,77451,-64983,-57876,82874,62481,-32754,-39902,22451,-79095,-23904,78409,-7418,77916}));
+        System.out.println(solution.threeSum(new int[]{82597, -9243, 62390, 83030, -97960, -26521, -61011, 83390, -38677, 12333, 75987, 46091, 83794, 19355, -71037, -6242, -28801, 324, 1202, -90885, -2989, -95597, -34333, 35528, 5680, 89093, -90606, 50360, -29393, -27012, 53313, 65213, 99818, -82405, -41661, -3333, -51952, 72135, -1523, 26377, 74685, 96992, 92263, 15929, 5467, -99555, -43348, -41689, -60383, -3990, 32165, 65265, -72973, -58372, 12741, -48568, -46596, 72419, -1859, 34153, 62937, 81310, -61823, -96770, -54944, 8845, -91184, 24208, -29078, 31495, 65258, 14198, 85395, 70506, -40908, 56740, -12228, -40072, 32429, 93001, 68445, -73927, 25731, -91859, -24150, 10093, -60271, -81683, -18126, 51055, 48189, -6468, 25057, 81194, -58628, 74042, 66158, -14452, -49851, -43667, 11092, 39189, -17025, -79173, 13606, 83172, 92647, -59741, 19343, -26644, -57607, 82908, -20655, 1637, 80060, 98994, 39331, -31274, -61523, 91225, -72953, 13211, -75116, -98421, -41571, -69074, 99587, 39345, 42151, -2460, 98236, 15690, -52507, -95803, -48935, -46492, -45606, -79254, -99851, 52533, 73486, 39948, -7240, 71815, -585, -96252, 90990, -93815, 93340, -71848, 58733, -14859, -83082, -75794, -82082, -24871, -15206, 91207, -56469, -93618, 67131, -8682, 75719, 87429, -98757, -7535, -24890, -94160, 85003, 33928, 75538, 97456, -66424, -60074, -8527, -28697, -22308, 2246, -70134, -82319, -10184, 87081, -34949, -28645, -47352, -83966, -60418, -15293, -53067, -25921, 55172, 75064, 95859, 48049, 34311, -86931, -38586, 33686, -36714, 96922, 76713, -22165, -80585, -34503, -44516, 39217, -28457, 47227, -94036, 43457, 24626, -87359, 26898, -70819, 30528, -32397, -69486, 84912, -1187, -98986, -32958, 4280, -79129, -65604, 9344, 58964, 50584, 71128, -55480, 24986, 15086, -62360, -42977, -49482, -77256, -36895, -74818, 20, 3063, -49426, 28152, -97329, 6086, 86035, -88743, 35241, 44249, 19927, -10660, 89404, 24179, -26621, -6511, 57745, -28750, 96340, -97160, -97822, -49979, 52307, 79462, 94273, -24808, 77104, 9255, -83057, 77655, 21361, 55956, -9096, 48599, -40490, -55107, 2689, 29608, 20497, 66834, -34678, 23553, -81400, -66630, -96321, -34499, -12957, -20564, 25610, -4322, -58462, 20801, 53700, 71527, 24669, -54534, 57879, -3221, 33636, 3900, 97832, -27688, -98715, 5992, 24520, -55401, -57613, -69926, 57377, -77610, 20123, 52174, 860, 60429, -91994, -62403, -6218, -90610, -37263, -15052, 62069, -96465, 44254, 89892, -3406, 19121, -41842, -87783, -64125, -56120, 73904, -22797, -58118, -4866, 5356, 75318, 46119, 21276, -19246, -9241, -97425, 57333, -15802, 93149, 25689, -5532, 95716, 39209, -87672, -29470, -16324, -15331, 27632, -39454, 56530, -16000, 29853, 46475, 78242, -46602, 83192, -73440, -15816, 50964, -36601, 89758, 38375, -40007, -36675, -94030, 67576, 46811, -64919, 45595, 76530, 40398, 35845, 41791, 67697, -30439, -82944, 63115, 33447, -36046, -50122, -34789, 43003, -78947, -38763, -89210, 32756, -20389, -31358, -90526, -81607, 88741, 86643, 98422, 47389, -75189, 13091, 95993, -15501, 94260, -25584, -1483, -67261, -70753, 25160, 89614, -90620, -48542, 83889, -12388, -9642, -37043, -67663, 28794, -8801, 13621, 12241, 55379, 84290, 21692, -95906, -85617, -17341, -63767, 80183, -4942, -51478, 30997, -13658, 8838, 17452, -82869, -39897, 68449, 31964, 98158, -49489, 62283, -62209, -92792, -59342, 55146, -38533, 20496, 62667, 62593, 36095, -12470, 5453, -50451, 74716, -17902, 3302, -16760, -71642, -34819, 96459, -72860, 21638, 47342, -69897, -40180, 44466, 76496, 84659, 13848, -91600, -90887, -63742, -2156, -84981, -99280, 94326, -33854, 92029, -50811, 98711, -36459, -75555, 79110, -88164, -97397, -84217, 97457, 64387, 30513, -53190, -83215, 252, 2344, -27177, -92945, -89010, 82662, -11670, 86069, 53417, 42702, 97082, 3695, -14530, -46334, 17910, 77999, 28009, -12374, 15498, -46941, 97088, -35030, 95040, 92095, -59469, -24761, 46491, 67357, -66658, 37446, -65130, -50416, 99197, 30925, 27308, 54122, -44719, 12582, -99525, -38446, -69050, -22352, 94757, -56062, 33684, -40199, -46399, 96842, -50881, -22380, -65021, 40582, 53623, -76034, 77018, -97074, -84838, -22953, -74205, 79715, -33920, -35794, -91369, 73421, -82492, 63680, -14915, -33295, 37145, 76852, -69442, 60125, -74166, 74308, -1900, -30195, -16267, -60781, -27760, 5852, 38917, 25742, -3765, 49097, -63541, 98612, -92865, -30248, 9612, -8798, 53262, 95781, -42278, -36529, 7252, -27394, -5021, 59178, 80934, -48480, -75131, -54439, -19145, -48140, 98457, -6601, -51616, -89730, 78028, 32083, -48904, 16822, -81153, -8832, 48720, -80728, -45133, -86647, -4259, -40453, 2590, 28613, 50523, -4105, -27790, -74579, -17223, 63721, 33489, -47921, 97628, -97691, -14782, -65644, 18008, -93651, -71266, 80990, -76732, -47104, 35368, 28632, 59818, -86269, -89753, 34557, -92230, -5933, -3487, -73557, -13174, -43981, -43630, -55171, 30254, -83710, -99583, -13500, 71787, 5017, -25117, -78586, 86941, -3251, -23867, -36315, 75973, 86272, -45575, 77462, -98836, -10859, 70168, -32971, -38739, -12761, 93410, 14014, -30706, -77356, -85965, -62316, 63918, -59914, -64088, 1591, -10957, 38004, 15129, -83602, -51791, 34381, -89382, -26056, 8942, 5465, 71458, -73805, -87445, -19921, -80784, 69150, -34168, 28301, -68955, 18041, 6059, 82342, 9947, 39795, 44047, -57313, 48569, 81936, -2863, -80932, 32976, -86454, -84207, 33033, 32867, 9104, -16580, -25727, 80157, -70169, 53741, 86522, 84651, 68480, 84018, 61932, 7332, -61322, -69663, 76370, 41206, 12326, -34689, 17016, 82975, -23386, 39417, 72793, 44774, -96259, 3213, 79952, 29265, -61492, -49337, 14162, 65886, 3342, -41622, -62659, -90402, -24751, 88511, 54739, -21383, -40161, -96610, -24944, -602, -76842, -21856, 69964, 43994, -15121, -85530, 12718, 13170, -13547, 69222, 62417, -75305, -81446, -38786, -52075, -23110, 97681, -82800, -53178, 11474, 35857, 94197, -58148, -23689, 32506, 92154, -64536, -73930, -77138, 97446, -83459, 70963, 22452, 68472, -3728, -25059, -49405, 95129, -6167, 12808, 99918, 30113, -12641, -26665, 86362, -33505, 50661, 26714, 33701, 89012, -91540, 40517, -12716, -57185, -87230, 29914, -59560, 13200, -72723, 58272, 23913, -45586, -96593, -26265, -2141, 31087, 81399, 92511, -34049, 20577, 2803, 26003, 8940, 42117, 40887, -82715, 38269, 40969, -50022, 72088, 21291, -67280, -16523, 90535, 18669, 94342, -39568, -88080, -99486, -20716, 23108, -28037, 63342, 36863, -29420, -44016, 75135, 73415, 16059, -4899, 86893, 43136, -7041, 33483, -67612, 25327, 40830, 6184, 61805, 4247, 81119, -22854, -26104, -63466, 63093, -63685, 60369, 51023, 51644, -16350, 74438, -83514, 99083, 10079, -58451, -79621, 48471, 67131, -86940, 99093, 11855, -22272, -67683, -44371, 9541, 18123, 37766, -70922, 80385, -57513, -76021, -47890, 36154, 72935, 84387, -92681, -88303, -7810, 59902, -90, -64704, -28396, -66403, 8860, 13343, 33882, 85680, 7228, 28160, -14003, 54369, -58893, 92606, -63492, -10101, 64714, 58486, 29948, -44679, -22763, 10151, -56695, 4031, -18242, -36232, 86168, -14263, 9883, 47124, 47271, 92761, -24958, -73263, -79661, -69147, -18874, 29546, -92588, -85771, 26451, -86650, -43306, -59094, -47492, -34821, -91763, -47670, 33537, 22843, 67417, -759, 92159, 63075, 94065, -26988, 55276, 65903, 30414, -67129, -99508, -83092, -91493, -50426, 14349, -83216, -76090, 32742, -5306, -93310, -60750, -60620, -45484, -21108, -58341, -28048, -52803, 69735, 78906, 81649, 32565, -86804, -83202, -65688, -1760, 89707, 93322, -72750, 84134, 71900, -37720, 19450, -78018, 22001, -23604, 26276, -21498, 65892, -72117, -89834, -23867, 55817, -77963, 42518, 93123, -83916, 63260, -2243, -97108, 85442, -36775, 17984, -58810, 99664, -19082, 93075, -69329, 87061, 79713, 16296, 70996, 13483, -74582, 49900, -27669, -40562, 1209, -20572, 34660, 83193, 75579, 7344, 64925, 88361, 60969, 3114, 44611, -27445, 53049, -16085, -92851, -53306, 13859, -33532, 86622, -75666, -18159, -98256, 51875, -42251, -27977, -18080, 23772, 38160, 41779, 9147, 94175, 99905, -85755, 62535, -88412, -52038, -68171, 93255, -44684, -11242, -104, 31796, 62346, -54931, -55790, -70032, 46221, 56541, -91947, 90592, 93503, 4071, 20646, 4856, -63598, 15396, -50708, 32138, -85164, 38528, -89959, 53852, 57915, -42421, -88916, -75072, 67030, -29066, 49542, -71591, 61708, -53985, -43051, 28483, 46991, -83216, 80991, -46254, -48716, 39356, -8270, -47763, -34410, 874, -1186, -7049, 28846, 11276, 21960, -13304, -11433, -4913, 55754, 79616, 70423, -27523, 64803, 49277, 14906, -97401, -92390, 91075, 70736, 21971, -3303, 55333, -93996, 76538, 54603, -75899, 98801, 46887, 35041, 48302, -52318, 55439, 24574, 14079, -24889, 83440, 14961, 34312, -89260, -22293, -81271, -2586, -71059, -10640, -93095, -5453, -70041, 66543, 74012, -11662, -52477, -37597, -70919, 92971, -17452, -67306, -80418, 7225, -89296, 24296, 86547, 37154, -10696, 74436, -63959, 58860, 33590, -88925, -97814, -83664, 85484, -8385, -50879, 57729, -74728, -87852, -15524, -91120, 22062, 28134, 80917, 32026, 49707, -54252, -44319, -35139, 13777, 44660, 85274, 25043, 58781, -89035, -76274, 6364, -63625, 72855, 43242, -35033, 12820, -27460, 77372, -47578, -61162, -70758, -1343, -4159, 64935, 56024, -2151, 43770, 19758, -30186, -86040, 24666, -62332, -67542, 73180, -25821, -27826, -45504, -36858, -12041, 20017, -24066, -56625, -52097, -47239, -90694, 8959, 7712, -14258, -5860, 55349, 61808, -4423, -93703, 64681, -98641, -25222, 46999, -83831, -54714, 19997, -68477, 66073, 51801, -66491, 52061, -52866, 79907, -39736, -68331, 68937, 91464, 98892, 910, 93501, 31295, -85873, 27036, -57340, 50412, 21, -2445, 29471, 71317, 82093, -94823, -54458, -97410, 39560, -7628, 66452, 39701, 54029, 37906, 46773, 58296, 60370, -61090, 85501, -86874, 71443, -72702, -72047, 14848, 34102, 77975, -66294, -36576, 31349, 52493, -70833, -80287, 94435, 39745, -98291, 84524, -18942, 10236, 93448, 50846, 94023, -6939, 47999, 14740, 30165, 81048, 84935, -19177, -13594, 32289, 62628, -90612, -542, -66627, 64255, 71199, -83841, -82943, -73885, 8623, -67214, -9474, -35249, 62254, -14087, -90969, 21515, -83303, 94377, -91619, 19956, -98810, 96727, -91939, 29119, -85473, -82153, -69008, 44850, 74299, -76459, -86464, 8315, -49912, -28665, 59052, -69708, 76024, -92738, 50098, 18683, -91438, 18096, -19335, 35659, 91826, 15779, -73070, 67873, -12458, -71440, -46721, 54856, 97212, -81875, 35805, 36952, 68498, 81627, -34231, 81712, 27100, -9741, -82612, 18766, -36392, 2759, 41728, 69743, 26825, 48355, -17790, 17165, 56558, 3295, -24375, 55669, -16109, 24079, 73414, 48990, -11931, -78214, 90745, 19878, 35673, -15317, -89086, 94675, -92513, 88410, -93248, -19475, -74041, -19165, 32329, -26266, -46828, -18747, 45328, 8990, -78219, -25874, -74801, -44956, -54577, -29756, -99822, -35731, -18348, -68915, -83518, -53451, 95471, -2954, -13706, -8763, -21642, -37210, 16814, -60070, -42743, 27697, -36333, -42362, 11576, 85742, -82536, 68767, -56103, -63012, 71396, -78464, -68101, -15917, -11113, -3596, 77626, -60191, -30585, -73584, 6214, -84303, 18403, 23618, -15619, -89755, -59515, -59103, -74308, -63725, -29364, -52376, -96130, 70894, -12609, 50845, -2314, 42264, -70825, 64481, 55752, 4460, -68603, -88701, 4713, -50441, -51333, -77907, 97412, -66616, -49430, 60489, -85262, -97621, -18980, 44727, -69321, -57730, 66287, -92566, -64427, -14270, 11515, -92612, -87645, 61557, 24197, -81923, -39831, -10301, -23640, -76219, -68025, 92761, -76493, 68554, -77734, -95620, -11753, -51700, 98234, -68544, -61838, 29467, 46603, -18221, -35441, 74537, 40327, -58293, 75755, -57301, -7532, -94163, 18179, -14388, -22258, -46417, -48285, 18242, -77551, 82620, 250, -20060, -79568, -77259, 82052, -98897, -75464, 48773, -79040, -11293, 45941, -67876, -69204, -46477, -46107, 792, 60546, -34573, -12879, -94562, 20356, -48004, -62429, 96242, 40594, 2099, 99494, 25724, -39394, -2388, -18563, -56510, -83570, -29214, 3015, 74454, 74197, 76678, -46597, 60630, -76093, 37578, -82045, -24077, 62082, -87787, -74936, 58687, 12200, -98952, 70155, -77370, 21710, -84625, -60556, -84128, 925, 65474, -15741, -94619, 88377, 89334, 44749, 22002, -45750, -93081, -14600, -83447, 46691, 85040, -66447, -80085, 56308, 44310, 24979, -29694, 57991, 4675, -71273, -44508, 13615, -54710, 23552, -78253, -34637, 50497, 68706, 81543, -88408, -21405, 6001, -33834, -21570, -46692, -25344, 20310, 71258, -97680, 11721, 59977, 59247, -48949, 98955, -50276, -80844, -27935, -76102, 55858, -33492, 40680, 66691, -33188, 8284, 64893, -7528, 6019, -85523, 8434, -64366, -56663, 26862, 30008, -7611, -12179, -70076, 21426, -11261, -36864, -61937, -59677, 929, -21052, 3848, -20888, -16065, 98995, -32293, -86121, -54564, 77831, 68602, 74977, 31658, 40699, 29755, 98424, 80358, -69337, 26339, 13213, -46016, -18331, 64713, -46883, -58451, -70024, -92393, -4088, 70628, -51185, 71164, -75791, -1636, -29102, -16929, -87650, -84589, -24229, -42137, -15653, 94825, 13042, 88499, -47100, -90358, -7180, 29754, -65727, -42659, -85560, -9037, -52459, 20997, -47425, 17318, 21122, 20472, -23037, 65216, -63625, -7877, -91907, 24100, -72516, 22903, -85247, -8938, 73878, 54953, 87480, -31466, -99524, 35369, -78376, 89984, -15982, 94045, -7269, 23319, -80456, -37653, -76756, 2909, 81936, 54958, -12393, 60560, -84664, -82413, 66941, -26573, -97532, 64460, 18593, -85789, -38820, -92575, -43663, -89435, 83272, -50585, 13616, -71541, -53156, 727, -27644, 16538, 34049, 57745, 34348, 35009, 16634, -18791, 23271, -63844, 95817, 21781, 16590, 59669, 15966, -6864, 48050, -36143, 97427, -59390, 96931, 78939, -1958, 50777, 43338, -51149, 39235, -27054, -43492, 67457, -83616, 37179, 10390, 85818, 2391, 73635, 87579, -49127, -81264, -79023, -81590, 53554, -74972, -83940, -13726, -39095, 29174, 78072, 76104, 47778, 25797, -29515, -6493, -92793, 22481, -36197, -65560, 42342, 15750, 97556, 99634, -56048, -35688, 13501, 63969, -74291, 50911, 39225, 93702, -3490, -59461, -30105, -46761, -80113, 92906, -68487, 50742, 36152, -90240, -83631, 24597, -50566, -15477, 18470, 77038, 40223, -80364, -98676, 70957, -63647, 99537, 13041, 31679, 86631, 37633, -16866, 13686, -71565, 21652, -46053, -80578, -61382, 68487, -6417, 4656, 20811, 67013, -30868, -11219, 46, 74944, 14627, 56965, 42275, -52480, 52162, -84883, -52579, -90331, 92792, 42184, -73422, -58440, 65308, -25069, 5475, -57996, 59557, -17561, 2826, -56939, 14996, -94855, -53707, 99159, 43645, -67719, -1331, 21412, 41704, 31612, 32622, 1919, -69333, -69828, 22422, -78842, 57896, -17363, 27979, -76897, 35008, 46482, -75289, 65799, 20057, 7170, 41326, -76069, 90840, -81253, -50749, 3649, -42315, 45238, -33924, 62101, 96906, 58884, -7617, -28689, -66578, 62458, 50876, -57553, 6739, 41014, -64040, -34916, 37940, 13048, -97478, -11318, -89440, -31933, -40357, -59737, -76718, -14104, -31774, 28001, 4103, 41702, -25120, -31654, 63085, -3642, 84870, -83896, -76422, -61520, 12900, 88678, 85547, 33132, -88627, 52820, 63915, -27472, 78867, -51439, 33005, -23447, -3271, -39308, 39726, -74260, -31874, -36893, 93656, 910, -98362, 60450, -88048, 99308, 13947, 83996, -90415, -35117, 70858, -55332, -31721, 97528, 82982, -86218, 6822, 25227, 36946, 97077, -4257, -41526, 56795, 89870, 75860, -70802, 21779, 14184, -16511, -89156, -31422, 71470, 69600, -78498, 74079, -19410, 40311, 28501, 26397, -67574, -32518, 68510, 38615, 19355, -6088, -97159, -29255, -92523, 3023, -42536, -88681, 64255, 41206, 44119, 52208, 39522, -52108, 91276, -70514, 83436, 63289, -79741, 9623, 99559, 12642, 85950, 83735, -21156, -67208, 98088, -7341, -27763, -30048, -44099, -14866, -45504, -91704, 19369, 13700, 10481, -49344, -85686, 33994, 19672, 36028, 60842, 66564, -24919, 33950, -93616, -47430, -35391, -28279, 56806, 74690, 39284, -96683, -7642, -75232, 37657, -14531, -86870, -9274, -26173, 98640, 88652, 64257, 46457, 37814, -19370, 9337, -22556, -41525, 39105, -28719, 51611, -93252, 98044, -90996, 21710, -47605, -64259, -32727, 53611, -31918, -3555, 33316, -66472, 21274, -37731, -2919, 15016, 48779, -88868, 1897, 41728, 46344, -89667, 37848, 68092, -44011, 85354, -43776, 38739, -31423, -66330, 65167, -22016, 59405, 34328, -60042, 87660, -67698, -59174, -1408, -46809, -43485, -88807, -60489, 13974, 22319, 55836, -62995, -37375, -4185, 32687, -36551, -75237, 58280, 26942, -73756, 71756, 78775, -40573, 14367, -71622, -77338, 24112, 23414, -7679, -51721, 87492, 85066, -21612, 57045, 10673, -96836, 52461, -62218, -9310, 65862, -22748, 89906, -96987, -98698, 26956, -43428, 46141, 47456, 28095, 55952, 67323, -36455, -60202, -43302, -82932, 42020, 77036, 10142, 60406, 70331, 63836, 58850, -66752, 52109, 21395, -10238, -98647, -41962, 27778, 69060, 98535, -28680, -52263, -56679, 66103, -42426, 27203, 80021, 10153, 58678, 36398, 63112, 34911, 20515, 62082, -15659, -40785, 27054, 43767, -20289, 65838, -6954, -60228, -72226, 52236, -35464, 25209, -15462, -79617, -41668, -84083, 62404, -69062, 18913, 46545, 20757, 13805, 24717, -18461, -47009, -25779, 68834, 64824, 34473, 39576, 31570, 14861, -15114, -41233, 95509, 68232, 67846, 84902, -83060, 17642, -18422, 73688, 77671, -26930, 64484, -99637, 73875, 6428, 21034, -73471, 19664, -68031, 15922, -27028, 48137, 54955, -82793, -41144, -10218, -24921, -28299, -2288, 68518, -54452, 15686, -41814, 66165, -72207, -61986, 80020, 50544, -99500, 16244, 78998, 40989, 14525, -56061, -24692, -94790, 21111, 37296, -90794, 72100, 70550, -31757, 17708, -74290, 61910, 78039, -78629, -25033, 73172, -91953, 10052, 64502, 99585, -1741, 90324, -73723, 68942, 28149, 30218, 24422, 16659, 10710, -62594, 94249, 96588, 46192, 34251, 73500, -65995, -81168, 41412, -98724, -63710, -54696, -52407, 19746, 45869, 27821, -94866, -76705, -13417, -61995, -71560, 43450, 67384, -8838, -80293, -28937, 23330, -89694, -40586, 46918, 80429, -5475, 78013, 25309, -34162, 37236, -77577, 86744, 26281, -29033, -91813, 35347, 13033, -13631, -24459, 3325, -71078, -75359, 81311, 19700, 47678, -74680, -84113, 45192, 35502, 37675, 19553, 76522, -51098, -18211, 89717, 4508, -82946, 27749, 85995, 89912, -53678, -64727, -14778, 32075, -63412, -40524, 86440, -2707, -36821, 63850, -30883, 67294, -99468, -23708, 34932, 34386, 98899, 29239, -23385, 5897, 54882, 98660, 49098, 70275, 17718, 88533, 52161, 63340, 50061, -89457, 19491, -99156, 24873, -17008, 64610, -55543, 50495, 17056, -10400, -56678, -29073, -42960, -76418, 98562, -88104, -96255, 10159, -90724, 54011, 12052, 45871, -90933, -69420, 67039, 37202, 78051, -52197, -40278, -58425, 65414, -23394, -1415, 6912, -53447, 7352, 17307, -78147, 63727, 98905, 55412, -57658, -32884, -44878, 22755, 39730, 3638, 35111, 39777, 74193, 38736, -11829, -61188, -92757, 55946, -71232, -63032, -83947, 39147, -96684, -99233, 25131, -32197, 24406, -55428, -61941, 25874, -69453, 64483, -19644, -68441, 12783, 87338, -48676, 66451, -447, -61590, 50932, -11270, 29035, 65698, -63544, 10029, 80499, -9461, 86368, 91365, -81810, -71914, -52056, -13782, 44240, -30093, -2437, 24007, 67581, -17365, -69164, -8420, -69289, -29370, 48010, 90439, 13141, 69243, 50668, 39328, 61731, 78266, -81313, 17921, -38196, 55261, 9948, -24970, 75712, -72106, 28696, 7461, 31621, 61047, 51476, 56512, 11839, -96916, -82739, 28924, -99927, 58449, 37280, 69357, 11219, -32119, -62050, -48745, -83486, -52376, 42668, 82659, 68882, 38773, 46269, -96005, 97630, 25009, -2951, -67811, 99801, 81587, -79793, -18547, -83086, 69512, 33127, -92145, -88497, 47703, 59527, 1909, 88785, -88882, 69188, -46131, -5589, -15086, 36255, -53238, -33009, 82664, 53901, 35939, -42946, -25571, 33298, 69291, 53199, 74746, -40127, -39050, 91033, 51717, -98048, 87240, 36172, 65453, -94425, -63694, -30027, 59004, 88660, 3649, -20267, -52565, -67321, 34037, 4320, 91515, -56753, 60115, 27134, 68617, -61395, -26503, -98929, -8849, -63318, 10709, -16151, 61905, -95785, 5262, 23670, -25277, 90206, -19391, 45735, 37208, -31992, -92450, 18516, -90452, -58870, -58602, 93383, 14333, 17994, 82411, -54126, -32576, 35440, -60526, -78764, -25069, -9022, -394, 92186, -38057, 55328, -61569, 67780, 77169, 19546, -92664, -94948, 44484, -13439, 83529, 27518, -48333, 72998, 38342, -90553, -98578, -76906, 81515, -16464, 78439, 92529, 35225, -39968, -10130, -7845, -32245, -74955, -74996, 67731, -13897, -82493, 33407, 93619, 59560, -24404, -57553, 19486, -45341, 34098, -24978, -33612, 79058, 71847, 76713, -95422, 6421, -96075, -59130, -28976, -16922, -62203, 69970, 68331, 21874, 40551, 89650, 51908, 58181, 66480, -68177, 34323, -3046, -49656, -59758, 43564, -10960, -30796, 15473, -20216, 46085, -85355, 41515, -30669, -87498, 57711, 56067, 63199, -83805, 62042, 91213, -14606, 4394, -562, 74913, 10406, 96810, -61595, 32564, 31640, -9732, 42058, 98052, -7908, -72330, 1558, -80301, 34878, 32900, 3939, -8824, 88316, 20937, 21566, -3218, -66080, -31620, 86859, 54289, 90476, -42889, -15016, -18838, 75456, 30159, -67101, 42328, -92703, 85850, -5475, 23470, -80806, 68206, 17764, 88235, 46421, -41578, 74005, -81142, 80545, 20868, -1560, 64017, 83784, 68863, -97516, -13016, -72223, 79630, -55692, 82255, 88467, 28007, -34686, -69049, -41677, 88535, -8217, 68060, -51280, 28971, 49088, 49235, 26905, -81117, -44888, 40623, 74337, -24662, 97476, 79542, -72082, -35093, 98175, -61761, -68169, 59697, -62542, -72965, 59883, -64026, -37656, -92392, -12113, -73495, 98258, 68379, -21545, 64607, -70957, -92254, -97460, -63436, -8853, -19357, -51965, -76582, 12687, -49712, 45413, -60043, 33496, 31539, -57347, 41837, 67280, -68813, 52088, -13155, -86430, -15239, -45030, 96041, 18749, -23992, 46048, 35243, -79450, 85425, -58524, 88781, -39454, 53073, -48864, -82289, 39086, 82540, -11555, 25014, -5431, -39585, -89526, 2705, 31953, -81611, 36985, -56022, 68684, -27101, 11422, 64655, -26965, -63081, -13840, -91003, -78147, -8966, 41488, 1988, 99021, -61575, -47060, 65260, -23844, -21781, -91865, -19607, 44808, 2890, 63692, -88663, -58272, 15970, -65195, -45416, -48444, -78226, -65332, -24568, 42833, -1806, -71595, 80002, -52250, 30952, 48452, -90106, 31015, -22073, 62339, 63318, 78391, 28699, 77900, -4026, -76870, -45943, 33665, 9174, -84360, -22684, -16832, -67949, -38077, -38987, -32847, 51443, -53580, -13505, 9344, -92337, 26585, 70458, -52764, -67471, -68411, -1119, -2072, -93476, 67981, 40887, -89304, -12235, 41488, 1454, 5355, -34855, -72080, 24514, -58305, 3340, 34331, 8731, 77451, -64983, -57876, 82874, 62481, -32754, -39902, 22451, -79095, -23904, 78409, -7418, 77916}));
     }
 
 
diff --git a/[0015][3 Sum]/src/Solution.java b/[0015][3 Sum]/src/Solution.java
index 4d788fd..5595514 100644
--- a/[0015][3 Sum]/src/Solution.java	
+++ b/[0015][3 Sum]/src/Solution.java	
@@ -73,7 +73,7 @@ public List<List<Integer>> threeSum(int[] nums) {
             // nums[a-1]�Ѿ���ѡ���ˣ�������ѡ��
             do {
                 ++a;
-            }while (a < nums.length - 2 && nums[a - 1] == nums[a]);
+            } while (a < nums.length - 2 && nums[a - 1] == nums[a]);
         }
         return result;
     }
diff --git a/[0016][3 Sum Closest]/src/Main.java b/[0016][3 Sum Closest]/src/Main.java
index ecb9b20..86ada0f 100644
--- a/[0016][3 Sum Closest]/src/Main.java	
+++ b/[0016][3 Sum Closest]/src/Main.java	
@@ -7,6 +7,6 @@
 public class Main {
     public static void main(String[] args) {
         Solution solution = new Solution();
-        System.out.println(solution.threeSumClosest(new int[]{0, 1 , 2}, 3));
+        System.out.println(solution.threeSumClosest(new int[]{0, 1, 2}, 3));
     }
 }
diff --git a/[0016][3 Sum Closest]/src/Solution.java b/[0016][3 Sum Closest]/src/Solution.java
index 84df103..42019e7 100644
--- a/[0016][3 Sum Closest]/src/Solution.java	
+++ b/[0016][3 Sum Closest]/src/Solution.java	
@@ -1,6 +1,4 @@
-import java.util.ArrayList;
 import java.util.Arrays;
-import java.util.List;
 
 /**
  * Author: ������
@@ -47,7 +45,7 @@ public int threeSumClosest(int[] nums, int target) {
 
 
         // i��ʾ����ȡ��i������Ϊ���
-        for (int i = 0; i < nums.length - 2;) {
+        for (int i = 0; i < nums.length - 2; ) {
             // �ڶ��������ܵ���ʼλ��
             int j = i + 1;
             // �������������ǽ���λ��
@@ -76,21 +74,21 @@ public int threeSumClosest(int[] nums, int target) {
 
                 // �ʹ���target
                 if (sum > target) {
-                   do {
-                       k--; // �ҵ���ͬ��ֵ
-                   }while (j < k && nums[k]==nums[k + 1]);
+                    do {
+                        k--; // �ҵ���ͬ��ֵ
+                    } while (j < k && nums[k] == nums[k + 1]);
                 }
                 // ����target
                 else {
                     do {
                         j++;
-                    }while (j < k && nums[j - 1] == nums[j]);
+                    } while (j < k && nums[j - 1] == nums[j]);
                 }
             }
 
             do {
                 i++;
-            }while (i < nums.length - 2 && nums[i - 1] == nums[i]);
+            } while (i < nums.length - 2 && nums[i - 1] == nums[i]);
         }
 
         return (int) result;
diff --git a/[0018][4 Sum]/src/Solution.java b/[0018][4 Sum]/src/Solution.java
index f4e4785..6d14161 100644
--- a/[0018][4 Sum]/src/Solution.java	
+++ b/[0018][4 Sum]/src/Solution.java	
@@ -49,7 +49,7 @@ public List<List<Integer>> fourSum(int[] num, int target) {
         Arrays.sort(num);
 
         // ��һ������
-        for (int i = 0; i < num.length - 3;) {
+        for (int i = 0; i < num.length - 3; ) {
             // ���ĸ�����
             for (int j = num.length - 1; j > i + 2; j--) {
                 // ���ĸ�����ʹ�ò��ظ�
@@ -98,7 +98,7 @@ public List<List<Integer>> fourSum(int[] num, int target) {
             // ��ͬ��������Ϊ����ֻ��ʹ��һ��
             do {
                 i++;
-            }while (i < num.length - 2 && num[i - 1] == num[i]);
+            } while (i < num.length - 2 && num[i - 1] == num[i]);
         }
         return result;
     }
diff --git a/[0022][Generate Parentheses]/src/Solution.java b/[0022][Generate Parentheses]/src/Solution.java
index 75a6eb1..ff49de9 100644
--- a/[0022][Generate Parentheses]/src/Solution.java	
+++ b/[0022][Generate Parentheses]/src/Solution.java	
@@ -1,5 +1,4 @@
 import java.util.ArrayList;
-import java.util.LinkedList;
 import java.util.List;
 
 /**
diff --git a/[0023][Merge K Sorted Lists]/src/Solution.java b/[0023][Merge K Sorted Lists]/src/Solution.java
index f5c8571..ef06cbb 100644
--- a/[0023][Merge K Sorted Lists]/src/Solution.java	
+++ b/[0023][Merge K Sorted Lists]/src/Solution.java	
@@ -1,6 +1,4 @@
-import java.util.ArrayList;
 import java.util.Comparator;
-import java.util.List;
 import java.util.PriorityQueue;
 
 /**
diff --git a/[0032][Longest Valid Parentheses]/src/Solution.java b/[0032][Longest Valid Parentheses]/src/Solution.java
index 2e4f5d1..ba8947c 100644
--- a/[0032][Longest Valid Parentheses]/src/Solution.java	
+++ b/[0032][Longest Valid Parentheses]/src/Solution.java	
@@ -1,5 +1,3 @@
-import java.util.Deque;
-import java.util.LinkedList;
 import java.util.Stack;
 
 /**
diff --git a/[0033][Search In Rotated Sorted Array]/src/Main.java b/[0033][Search In Rotated Sorted Array]/src/Main.java
index 7665c43..d522524 100644
--- a/[0033][Search In Rotated Sorted Array]/src/Main.java	
+++ b/[0033][Search In Rotated Sorted Array]/src/Main.java	
@@ -4,9 +4,8 @@
  **/
 public class Main {
     public static void main(String[] args) {
-       int[] nums = {4,5,6,7,0,1,2}
-       ;
-       Solution2 solution = new Solution2();
+        int[] nums = {4, 5, 6, 7, 0, 1, 2};
+        Solution2 solution = new Solution2();
 
         System.out.println(solution.search(nums, 4));
         System.out.println(solution.search(nums, 3));
diff --git a/[0037][Sudoku Solver]/src/Solution.java b/[0037][Sudoku Solver]/src/Solution.java
index 299431d..8485787 100644
--- a/[0037][Sudoku Solver]/src/Solution.java	
+++ b/[0037][Sudoku Solver]/src/Solution.java	
@@ -4,26 +4,26 @@
  **/
 public class Solution {
     public void solveSudoku(char[][] board) {
-        if(board == null || board.length == 0) {
+        if (board == null || board.length == 0) {
             return;
         }
         solve(board);
     }
 
-    public boolean solve(char[][] board){
-        for(int i = 0; i < board.length; i++){
-            for(int j = 0; j < board[0].length; j++){
-                if(board[i][j] == '.'){
+    public boolean solve(char[][] board) {
+        for (int i = 0; i < board.length; i++) {
+            for (int j = 0; j < board[0].length; j++) {
+                if (board[i][j] == '.') {
                     // 尝试1到9的数字
-                    for(char c = '1'; c <= '9'; c++){
-                        if(isValid(board, i, j, c)){
+                    for (char c = '1'; c <= '9'; c++) {
+                        if (isValid(board, i, j, c)) {
                             // 将字符放入单元格
                             board[i][j] = c;
 
                             // 如果字符可以放入单元格返回true
-                            if(solve(board)){
+                            if (solve(board)) {
                                 return true;
-                            }else { // 如果字符不能放入单元格就是还原成点号
+                            } else { // 如果字符不能放入单元格就是还原成点号
                                 board[i][j] = '.';
                             }
                         }
@@ -35,18 +35,18 @@ public boolean solve(char[][] board){
         return true;
     }
 
-    private boolean isValid(char[][] board, int row, int col, char c){
-        for(int i = 0; i < 9; i++) {
+    private boolean isValid(char[][] board, int row, int col, char c) {
+        for (int i = 0; i < 9; i++) {
             // 检查行
-            if(board[i][col] != '.' && board[i][col] == c) {
+            if (board[i][col] != '.' && board[i][col] == c) {
                 return false;
             }
             // 检查列
-            if(board[row][i] != '.' && board[row][i] == c) {
+            if (board[row][i] != '.' && board[row][i] == c) {
                 return false;
             }
             // 检查3*3的单元格
-            if(board[3 * (row / 3) + i / 3][ 3 * (col / 3) + i % 3] != '.'
+            if (board[3 * (row / 3) + i / 3][3 * (col / 3) + i % 3] != '.'
                     && board[3 * (row / 3) + i / 3][3 * (col / 3) + i % 3] == c) {
                 return false;
             }
diff --git a/[0039][Combination Sum]/src/Solution.java b/[0039][Combination Sum]/src/Solution.java
index 05d51b7..48c86b6 100644
--- a/[0039][Combination Sum]/src/Solution.java	
+++ b/[0039][Combination Sum]/src/Solution.java	
@@ -22,15 +22,15 @@ public List<List<Integer>> combinationSum(int[] nums, int target) {
     // nums:输入的数组
     // remain:剩下的值
     // start:可用的值在数组中的起始位置
-    private void backtrack(List<List<Integer>> list, List<Integer> tempList, int [] nums, int remain, int start){
+    private void backtrack(List<List<Integer>> list, List<Integer> tempList, int[] nums, int remain, int start) {
         // 不够减
-        if(remain < 0) {
+        if (remain < 0) {
             return;
-        } else if(remain == 0) { // 刚好够减
+        } else if (remain == 0) { // 刚好够减
             list.add(new LinkedList<>(tempList));
         } else {
             // 从剩下的数中一个一个尝试
-            for(int i = start; i < nums.length; i++){
+            for (int i = start; i < nums.length; i++) {
                 // 假设这个值是临时结果中的一个值
                 tempList.add(nums[i]);
                 // 处理下一步
diff --git a/[0041][First Missing Positive]/src/Solution.java b/[0041][First Missing Positive]/src/Solution.java
index b551643..d8f7546 100644
--- a/[0041][First Missing Positive]/src/Solution.java	
+++ b/[0041][First Missing Positive]/src/Solution.java	
@@ -23,6 +23,7 @@ public class Solution {
      * 本质上是桶排序(bucket sort)，每当A[i]!= i+1 的时候，将A[i] 与A[A[i]-1] 交换，
      * 直到无法交换为止，终止条件是A[i]== A[A[i]-1]。
      * </pre>
+     *
      * @param nums
      * @return
      */
diff --git a/[0042][Trapping Rain Water]/src/Solution.java b/[0042][Trapping Rain Water]/src/Solution.java
index 810a76c..597d513 100644
--- a/[0042][Trapping Rain Water]/src/Solution.java	
+++ b/[0042][Trapping Rain Water]/src/Solution.java	
@@ -79,6 +79,7 @@ int trap2(int[] height) {
      * =============
      * 0123456789012
      * </pre>
+     *
      * @param height
      * @return
      */
diff --git a/[0046][Permutations]/src/Solution.java b/[0046][Permutations]/src/Solution.java
index b08b4bb..4f8f1ad 100644
--- a/[0046][Permutations]/src/Solution.java
+++ b/[0046][Permutations]/src/Solution.java
@@ -1,5 +1,4 @@
 import java.util.ArrayList;
-import java.util.Collections;
 import java.util.LinkedList;
 import java.util.List;
 
diff --git a/[0047][Permutations II]/src/Solution.java b/[0047][Permutations II]/src/Solution.java
index 859454a..8775cef 100644
--- a/[0047][Permutations II]/src/Solution.java	
+++ b/[0047][Permutations II]/src/Solution.java	
@@ -11,7 +11,7 @@ public class Solution {
     public List<List<Integer>> permuteUnique(int[] nums) {
         List<List<Integer>> res = new ArrayList<>();
 
-        if (nums == null || nums.length == 0){
+        if (nums == null || nums.length == 0) {
             return res;
         }
 
@@ -26,6 +26,7 @@ public List<List<Integer>> permuteUnique(int[] nums) {
 
     /**
      * 时间复杂度：n!
+     *
      * @param nums
      * @param used
      * @param list
diff --git a/[0049][Group Anagrams]/src/Solution.java b/[0049][Group Anagrams]/src/Solution.java
index 3ff45ad..ef5973e 100644
--- a/[0049][Group Anagrams]/src/Solution.java	
+++ b/[0049][Group Anagrams]/src/Solution.java	
@@ -1,8 +1,4 @@
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.HashMap;
-import java.util.List;
-import java.util.Map;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
diff --git a/[0055][Jump Game]/src/Solution.java b/[0055][Jump Game]/src/Solution.java
index 09109fc..73b2d82 100644
--- a/[0055][Jump Game]/src/Solution.java	
+++ b/[0055][Jump Game]/src/Solution.java	
@@ -30,6 +30,7 @@ public class Solution {
     public boolean canJump(int[] nums) {
         return canJump2(nums);
     }
+
     public boolean canJump1(int[] nums) {
         if (nums == null || nums.length < 2) {
             return true;
@@ -42,7 +43,7 @@ public boolean canJump1(int[] nums) {
         for (int i = 0; i < nums.length; i++) {
             // i不能比lastPos大，否则说明不能走到i，走不到i也就不能走到最后
             // 如果在i位置可以移动的距离比已经记录到的最大距离还要大，那么更新最大的移动距离
-            if (i <= lastPos && i + nums[i] > lastPos ) {
+            if (i <= lastPos && i + nums[i] > lastPos) {
                 lastPos = i + nums[i];
             } else if (i > lastPos) {
                 return false;
@@ -55,6 +56,7 @@ public boolean canJump1(int[] nums) {
 
     /**
      * 逆向，从最高层下楼梯，一层一层下降，看最后能不能下降到第0 层。
+     *
      * @param nums
      * @return
      */
diff --git a/[0056][Merge Intervals]/src/Solution.java b/[0056][Merge Intervals]/src/Solution.java
index 312eac5..7f0df6a 100644
--- a/[0056][Merge Intervals]/src/Solution.java	
+++ b/[0056][Merge Intervals]/src/Solution.java	
@@ -1,4 +1,7 @@
-import java.util.*;
+import java.util.Collections;
+import java.util.Comparator;
+import java.util.LinkedList;
+import java.util.List;
 
 /**
  * Author: ������
diff --git a/[0057][Insert Interval]/src/Solution.java b/[0057][Insert Interval]/src/Solution.java
index d158b09..7486cdb 100644
--- a/[0057][Insert Interval]/src/Solution.java	
+++ b/[0057][Insert Interval]/src/Solution.java	
@@ -1,5 +1,3 @@
-import com.sun.org.apache.bcel.internal.generic.IF_ACMPEQ;
-
 import java.util.LinkedList;
 import java.util.List;
 
diff --git a/[0070][Climbing Stairs]/src/Solution.java b/[0070][Climbing Stairs]/src/Solution.java
index 570efe8..a475bb0 100644
--- a/[0070][Climbing Stairs]/src/Solution.java	
+++ b/[0070][Climbing Stairs]/src/Solution.java	
@@ -12,6 +12,7 @@ public class Solution {
      * - �ӵ�n - 1 ��ǰ��2 ����
      * ��ˣ���f(n) = f(n - 1) + f(n - 2)��
      * </pre>
+     *
      * @param n
      * @return
      */
diff --git a/[0073][Set Matrix Zeroes]/src/Solution.java b/[0073][Set Matrix Zeroes]/src/Solution.java
index 1d25618..e0d6ab2 100644
--- a/[0073][Set Matrix Zeroes]/src/Solution.java	
+++ b/[0073][Set Matrix Zeroes]/src/Solution.java	
@@ -20,7 +20,7 @@ public void setZeroes(int[][] matrix) {
                     }
 
                     // ��ǵ�һ��Ҫ������
-                    if (j == 0){
+                    if (j == 0) {
                         colFlag = true;
                     }
 
diff --git a/[0079][Word Search]/src/Main.java b/[0079][Word Search]/src/Main.java
index 2491d90..52d523d 100644
--- a/[0079][Word Search]/src/Main.java	
+++ b/[0079][Word Search]/src/Main.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-20
  * Time: 08:02
  * Declaration: All Rights Reserved !!!
@@ -8,7 +8,7 @@ public class Main {
     public static void main(String[] args) {
         Solution solution = new Solution();
         System.out.println(solution.exist(new char[][]{
-                "abc".toCharArray(),"aed".toCharArray(),"afg".toCharArray()
+                "abc".toCharArray(), "aed".toCharArray(), "afg".toCharArray()
         }, "abcdefg"));
     }
 }
diff --git a/[0079][Word Search]/src/Solution.java b/[0079][Word Search]/src/Solution.java
index e510517..ad373b1 100644
--- a/[0079][Word Search]/src/Solution.java	
+++ b/[0079][Word Search]/src/Solution.java	
@@ -76,7 +76,7 @@ private boolean search(char[][] board, boolean[][] visited, int row, int col, St
             visited[row][col] = true;
             idx[0]++;
             // ���ϣ��ң��£����ĸ������������
-            hasPath = search(board, visited, row - 1, col, word, idx ) // ��
+            hasPath = search(board, visited, row - 1, col, word, idx) // ��
                     || search(board, visited, row, col + 1, word, idx) // ��
                     || search(board, visited, row + 1, col, word, idx) // ��
                     || search(board, visited, row, col - 1, word, idx); // ��
diff --git a/[0080][Remove Duplicates from Sorted Array II]/src/Main.java b/[0080][Remove Duplicates from Sorted Array II]/src/Main.java
index 83f9e74..db6c257 100644
--- a/[0080][Remove Duplicates from Sorted Array II]/src/Main.java	
+++ b/[0080][Remove Duplicates from Sorted Array II]/src/Main.java	
@@ -9,7 +9,7 @@ public static void main(String[] args) {
         Solution solution = new Solution();
         int[] nums = {1, 1, 1, 2, 2, 3};
         int i = solution.removeDuplicates(nums);
-        System.out.println(i + ": "+ Arrays.toString(nums));
+        System.out.println(i + ": " + Arrays.toString(nums));
 
     }
 }
diff --git a/[0080][Remove Duplicates from Sorted Array II]/src/Solution.java b/[0080][Remove Duplicates from Sorted Array II]/src/Solution.java
index 9109816..ecd3151 100644
--- a/[0080][Remove Duplicates from Sorted Array II]/src/Solution.java	
+++ b/[0080][Remove Duplicates from Sorted Array II]/src/Solution.java	
@@ -13,7 +13,7 @@ public int removeDuplicates(int[] nums) {
 
         int index = 2;
         for (int i = 2; i < nums.length; i++) {
-            if (nums[index - 2] < nums[i] ) {
+            if (nums[index - 2] < nums[i]) {
                 nums[index] = nums[i];
                 index++;
             }
diff --git a/[0080][Remove Duplicates from Sorted Array II]/src/Solution2.java b/[0080][Remove Duplicates from Sorted Array II]/src/Solution2.java
index c3e4f83..449987a 100644
--- a/[0080][Remove Duplicates from Sorted Array II]/src/Solution2.java	
+++ b/[0080][Remove Duplicates from Sorted Array II]/src/Solution2.java	
@@ -2,6 +2,7 @@
  * @author: wangjunchao(王俊超)
  * @time: 2019-06-12 22:53
  **/
+
 /**
  * 删除重复出现的数字，使之最多出现两次
  */
diff --git a/[0081][Search In Rotated Sorted Array II]/src/Solution.java b/[0081][Search In Rotated Sorted Array II]/src/Solution.java
index 3a86418..1c71ba1 100644
--- a/[0081][Search In Rotated Sorted Array II]/src/Solution.java	
+++ b/[0081][Search In Rotated Sorted Array II]/src/Solution.java	
@@ -16,6 +16,7 @@ public class Solution {
      * "����ת����������ֵ"�ĺ�������������е�ֵ�����ظ�
      * дһ������ȷ��һ��������ֵ�Ƿ���������
      * </pre>
+     *
      * @param nums
      * @param target
      * @return
diff --git a/[0086][Partition List]/src/ListNode.java b/[0086][Partition List]/src/ListNode.java
index b0946e7..63ee591 100644
--- a/[0086][Partition List]/src/ListNode.java	
+++ b/[0086][Partition List]/src/ListNode.java	
@@ -7,5 +7,8 @@
 public class ListNode {
     int val;
     ListNode next;
-    ListNode(int x) { val = x; }
+
+    ListNode(int x) {
+        val = x;
+    }
 }
diff --git a/[0089][Gray Code]/src/Main.java b/[0089][Gray Code]/src/Main.java
index ba43581..6349221 100644
--- a/[0089][Gray Code]/src/Main.java	
+++ b/[0089][Gray Code]/src/Main.java	
@@ -11,7 +11,7 @@ public static void main(String[] args) {
         Solution solution = new Solution();
         List<Integer> result = solution.grayCode(2);
 
-        for (Integer i: result) {
+        for (Integer i : result) {
             System.out.printf("%s\n", Integer.toBinaryString(i));
         }
     }
diff --git a/[0090][Subsets II]/src/Main.java b/[0090][Subsets II]/src/Main.java
index c656a4c..4af3b37 100644
--- a/[0090][Subsets II]/src/Main.java	
+++ b/[0090][Subsets II]/src/Main.java	
@@ -1,7 +1,5 @@
 import org.junit.Test;
 
-import java.util.Arrays;
-
 /**
  * @author: wangjunchao(王俊超)
  * @time: 2019-06-19 17:33
diff --git a/[0092][Reverse Linked List II]/src/ListNode.java b/[0092][Reverse Linked List II]/src/ListNode.java
index 69ec703..8f1581b 100644
--- a/[0092][Reverse Linked List II]/src/ListNode.java	
+++ b/[0092][Reverse Linked List II]/src/ListNode.java	
@@ -7,5 +7,8 @@
 public class ListNode {
     int val;
     ListNode next;
-    ListNode(int x) { val = x; }
+
+    ListNode(int x) {
+        val = x;
+    }
 }
diff --git a/[0095][Unique Binary Search Trees II]/src/Main.java b/[0095][Unique Binary Search Trees II]/src/Main.java
index 97ab220..de39bd8 100644
--- a/[0095][Unique Binary Search Trees II]/src/Main.java	
+++ b/[0095][Unique Binary Search Trees II]/src/Main.java	
@@ -15,7 +15,7 @@ public void test1() {
     }
 
     private void print(List<TreeNode> generateTrees) {
-        for (TreeNode node:generateTrees) {
+        for (TreeNode node : generateTrees) {
             print(node);
             System.out.println();
         }
@@ -23,7 +23,7 @@ private void print(List<TreeNode> generateTrees) {
 
     private void print(TreeNode node) {
         if (node != null) {
-            System.out.print(node +", ");
+            System.out.print(node + ", ");
 
             if (node.left == null && node.right == null) {
                 return;
diff --git a/[0095][Unique Binary Search Trees II]/src/Solution.java b/[0095][Unique Binary Search Trees II]/src/Solution.java
index 07c646e..d3ca6f6 100644
--- a/[0095][Unique Binary Search Trees II]/src/Solution.java	
+++ b/[0095][Unique Binary Search Trees II]/src/Solution.java	
@@ -31,8 +31,8 @@ private List<TreeNode> trees(int start, int end) {
             List<TreeNode> left = trees(start, i - 1);
             List<TreeNode> right = trees(i + 1, end);
 
-            for(TreeNode l : left) {
-                for (TreeNode r: right) {
+            for (TreeNode l : left) {
+                for (TreeNode r : right) {
                     TreeNode root = new TreeNode(i);
                     root.left = l;
                     root.right = r;
diff --git a/[0095][Unique Binary Search Trees II]/src/TreeNode.java b/[0095][Unique Binary Search Trees II]/src/TreeNode.java
index 8c356eb..2878b91 100644
--- a/[0095][Unique Binary Search Trees II]/src/TreeNode.java	
+++ b/[0095][Unique Binary Search Trees II]/src/TreeNode.java	
@@ -3,7 +3,7 @@
  * @time: 2019-06-28 16:14
  **/
 public class TreeNode {
-    int      val;
+    int val;
     TreeNode left;
     TreeNode right;
 
diff --git a/[0096][Unique Binary Search Trees]/src/Solution2.java b/[0096][Unique Binary Search Trees]/src/Solution2.java
index 753d48c..31624d1 100644
--- a/[0096][Unique Binary Search Trees]/src/Solution2.java	
+++ b/[0096][Unique Binary Search Trees]/src/Solution2.java	
@@ -7,18 +7,18 @@
 public class Solution2 {
     /**
      * Given n, how many structurally unique BST's (binary search trees) that store values 1...n?
-     *
+     * <p>
      * For example,
      * Given n = 3, there are a total of 5 unique BST's.
-     *  1         3     3      2      1
-     *   \       /     /      / \      \
-     *   3     2     1       1   3      2
-     *  /     /       \                 \
+     * 1         3     3      2      1
+     * \       /     /      / \      \
+     * 3     2     1       1   3      2
+     * /     /       \                 \
      * 2     1         2                 3
-     *
+     * <p>
      * ���ƹ�ʽ
      * f(k)*f(n-1-k)��f(k)��ʾ�������������k����㣬���е���״��f(k)��f(n-1-k)��ʾ��������n-1-k�����
-     *
+     * <p>
      * f(n) = 2*f(n-1) + f(1)*f(n-2) + f(2)f(n-3) + f(3)f(n-4) + ... +f(n-2)*f(1)
      *
      * @param n
@@ -41,8 +41,8 @@ public int numTrees(int n) {
         for (int i = 2; i <= n; i++) {
             // ��f(i)
             result[i] = 2 * result[i - 1];
-            for (int j = 1; j <= i - 1 ; j++) {
-                result[i] += result[j]*result[i - 1 -j];
+            for (int j = 1; j <= i - 1; j++) {
+                result[i] += result[j] * result[i - 1 - j];
             }
 
         }
diff --git a/[0100][Same Tree]/src/TreeNode.java b/[0100][Same Tree]/src/TreeNode.java
index 58ea6f4..a4b81b6 100644
--- a/[0100][Same Tree]/src/TreeNode.java	
+++ b/[0100][Same Tree]/src/TreeNode.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-08-21
  * Time: 18:40
  * Declaration: All Rights Reserved !!!
@@ -8,5 +8,8 @@ public class TreeNode {
     int val;
     TreeNode left;
     TreeNode right;
-    TreeNode(int x) { val = x; }
+
+    TreeNode(int x) {
+        val = x;
+    }
 }
diff --git a/[0106][Construct Binary Tree From Inorder And Postorder Traversal]/src/Main.java b/[0106][Construct Binary Tree From Inorder And Postorder Traversal]/src/Main.java
index 232e3c8..c3569f8 100644
--- a/[0106][Construct Binary Tree From Inorder And Postorder Traversal]/src/Main.java	
+++ b/[0106][Construct Binary Tree From Inorder And Postorder Traversal]/src/Main.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-23
  * Time: 10:32
  * Declaration: All Rights Reserved !!!
@@ -7,8 +7,8 @@
 public class Main {
     public static void main(String[] args) {
         Solution solution = new Solution();
-        int[] inorder = {1,2,3,4};
-        int[] postorder = {3,2,4,1};
+        int[] inorder = {1, 2, 3, 4};
+        int[] postorder = {3, 2, 4, 1};
 
         TreeNode root = solution.buildTree(inorder, postorder);
         print(root);
diff --git a/[0106][Construct Binary Tree From Inorder And Postorder Traversal]/src/Solution.java b/[0106][Construct Binary Tree From Inorder And Postorder Traversal]/src/Solution.java
index 83cccad..d6415c7 100644
--- a/[0106][Construct Binary Tree From Inorder And Postorder Traversal]/src/Solution.java	
+++ b/[0106][Construct Binary Tree From Inorder And Postorder Traversal]/src/Solution.java	
@@ -1,4 +1,3 @@
-
 /**
  * Author: ������
  * Date: 2015-06-23
diff --git a/[0114][Flatten Binary Tree To Linked List]/src/TreeNode.java b/[0114][Flatten Binary Tree To Linked List]/src/TreeNode.java
index c988e88..463b6fe 100644
--- a/[0114][Flatten Binary Tree To Linked List]/src/TreeNode.java	
+++ b/[0114][Flatten Binary Tree To Linked List]/src/TreeNode.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-08-21
  * Time: 19:02
  * Declaration: All Rights Reserved !!!
@@ -8,5 +8,8 @@ public class TreeNode {
     int val;
     TreeNode left;
     TreeNode right;
-    TreeNode(int x) { val = x; }
+
+    TreeNode(int x) {
+        val = x;
+    }
 }
diff --git a/[0126][Word Ladder II]/src/Main.java b/[0126][Word Ladder II]/src/Main.java
index 356b93f..87f620f 100644
--- a/[0126][Word Ladder II]/src/Main.java	
+++ b/[0126][Word Ladder II]/src/Main.java	
@@ -1,7 +1,5 @@
-import org.junit.Assert;
 import org.junit.Test;
 
-import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.LinkedList;
 import java.util.List;
@@ -25,7 +23,7 @@ public void test2() {
         Solution solution = new Solution();
         String beginWord = "hot";
         String endWord = "dog";
-        List<String> wordList = new LinkedList<>(Arrays.asList("hot","dog","dot"));
+        List<String> wordList = new LinkedList<>(Arrays.asList("hot", "dog", "dot"));
         System.out.println(solution.findLadders(beginWord, endWord, wordList));
     }
 
@@ -34,7 +32,7 @@ public void test3() {
         Solution solution = new Solution();
         String beginWord = "cet";
         String endWord = "ism";
-        String[] words = {"kid","tag","pup","ail","tun","woo","erg","luz","brr","gay","sip","kay","per","val","mes","ohs","now","boa","cet","pal","bar","die","war","hay","eco","pub","lob","rue","fry","lit","rex","jan","cot","bid","ali","pay","col","gum","ger","row","won","dan","rum","fad","tut","sag","yip","sui","ark","has","zip","fez","own","ump","dis","ads","max","jaw","out","btu","ana","gap","cry","led","abe","box","ore","pig","fie","toy","fat","cal","lie","noh","sew","ono","tam","flu","mgm","ply","awe","pry","tit","tie","yet","too","tax","jim","san","pan","map","ski","ova","wed","non","wac","nut","why","bye","lye","oct","old","fin","feb","chi","sap","owl","log","tod","dot","bow","fob","for","joe","ivy","fan","age","fax","hip","jib","mel","hus","sob","ifs","tab","ara","dab","jag","jar","arm","lot","tom","sax","tex","yum","pei","wen","wry","ire","irk","far","mew","wit","doe","gas","rte","ian","pot","ask","wag","hag","amy","nag","ron","soy","gin","don","tug","fay","vic","boo","nam","ave","buy","sop","but","orb","fen","paw","his","sub","bob","yea","oft","inn","rod","yam","pew","web","hod","hun","gyp","wei","wis","rob","gad","pie","mon","dog","bib","rub","ere","dig","era","cat","fox","bee","mod","day","apr","vie","nev","jam","pam","new","aye","ani","and","ibm","yap","can","pyx","tar","kin","fog","hum","pip","cup","dye","lyx","jog","nun","par","wan","fey","bus","oak","bad","ats","set","qom","vat","eat","pus","rev","axe","ion","six","ila","lao","mom","mas","pro","few","opt","poe","art","ash","oar","cap","lop","may","shy","rid","bat","sum","rim","fee","bmw","sky","maj","hue","thy","ava","rap","den","fla","auk","cox","ibo","hey","saw","vim","sec","ltd","you","its","tat","dew","eva","tog","ram","let","see","zit","maw","nix","ate","gig","rep","owe","ind","hog","eve","sam","zoo","any","dow","cod","bed","vet","ham","sis","hex","via","fir","nod","mao","aug","mum","hoe","bah","hal","keg","hew","zed","tow","gog","ass","dem","who","bet","gos","son","ear","spy","kit","boy","due","sen","oaf","mix","hep","fur","ada","bin","nil","mia","ewe","hit","fix","sad","rib","eye","hop","haw","wax","mid","tad","ken","wad","rye","pap","bog","gut","ito","woe","our","ado","sin","mad","ray","hon","roy","dip","hen","iva","lug","asp","hui","yak","bay","poi","yep","bun","try","lad","elm","nat","wyo","gym","dug","toe","dee","wig","sly","rip","geo","cog","pas","zen","odd","nan","lay","pod","fit","hem","joy","bum","rio","yon","dec","leg","put","sue","dim","pet","yaw","nub","bit","bur","sid","sun","oil","red","doc","moe","caw","eel","dix","cub","end","gem","off","yew","hug","pop","tub","sgt","lid","pun","ton","sol","din","yup","jab","pea","bug","gag","mil","jig","hub","low","did","tin","get","gte","sox","lei","mig","fig","lon","use","ban","flo","nov","jut","bag","mir","sty","lap","two","ins","con","ant","net","tux","ode","stu","mug","cad","nap","gun","fop","tot","sow","sal","sic","ted","wot","del","imp","cob","way","ann","tan","mci","job","wet","ism","err","him","all","pad","hah","hie","aim","ike","jed","ego","mac","baa","min","com","ill","was","cab","ago","ina","big","ilk","gal","tap","duh","ola","ran","lab","top","gob","hot","ora","tia","kip","han","met","hut","she","sac","fed","goo","tee","ell","not","act","gil","rut","ala","ape","rig","cid","god","duo","lin","aid","gel","awl","lag","elf","liz","ref","aha","fib","oho","tho","her","nor","ace","adz","fun","ned","coo","win","tao","coy","van","man","pit","guy","foe","hid","mai","sup","jay","hob","mow","jot","are","pol","arc","lax","aft","alb","len","air","pug","pox","vow","got","meg","zoe","amp","ale","bud","gee","pin","dun","pat","ten","mob"};
+        String[] words = {"kid", "tag", "pup", "ail", "tun", "woo", "erg", "luz", "brr", "gay", "sip", "kay", "per", "val", "mes", "ohs", "now", "boa", "cet", "pal", "bar", "die", "war", "hay", "eco", "pub", "lob", "rue", "fry", "lit", "rex", "jan", "cot", "bid", "ali", "pay", "col", "gum", "ger", "row", "won", "dan", "rum", "fad", "tut", "sag", "yip", "sui", "ark", "has", "zip", "fez", "own", "ump", "dis", "ads", "max", "jaw", "out", "btu", "ana", "gap", "cry", "led", "abe", "box", "ore", "pig", "fie", "toy", "fat", "cal", "lie", "noh", "sew", "ono", "tam", "flu", "mgm", "ply", "awe", "pry", "tit", "tie", "yet", "too", "tax", "jim", "san", "pan", "map", "ski", "ova", "wed", "non", "wac", "nut", "why", "bye", "lye", "oct", "old", "fin", "feb", "chi", "sap", "owl", "log", "tod", "dot", "bow", "fob", "for", "joe", "ivy", "fan", "age", "fax", "hip", "jib", "mel", "hus", "sob", "ifs", "tab", "ara", "dab", "jag", "jar", "arm", "lot", "tom", "sax", "tex", "yum", "pei", "wen", "wry", "ire", "irk", "far", "mew", "wit", "doe", "gas", "rte", "ian", "pot", "ask", "wag", "hag", "amy", "nag", "ron", "soy", "gin", "don", "tug", "fay", "vic", "boo", "nam", "ave", "buy", "sop", "but", "orb", "fen", "paw", "his", "sub", "bob", "yea", "oft", "inn", "rod", "yam", "pew", "web", "hod", "hun", "gyp", "wei", "wis", "rob", "gad", "pie", "mon", "dog", "bib", "rub", "ere", "dig", "era", "cat", "fox", "bee", "mod", "day", "apr", "vie", "nev", "jam", "pam", "new", "aye", "ani", "and", "ibm", "yap", "can", "pyx", "tar", "kin", "fog", "hum", "pip", "cup", "dye", "lyx", "jog", "nun", "par", "wan", "fey", "bus", "oak", "bad", "ats", "set", "qom", "vat", "eat", "pus", "rev", "axe", "ion", "six", "ila", "lao", "mom", "mas", "pro", "few", "opt", "poe", "art", "ash", "oar", "cap", "lop", "may", "shy", "rid", "bat", "sum", "rim", "fee", "bmw", "sky", "maj", "hue", "thy", "ava", "rap", "den", "fla", "auk", "cox", "ibo", "hey", "saw", "vim", "sec", "ltd", "you", "its", "tat", "dew", "eva", "tog", "ram", "let", "see", "zit", "maw", "nix", "ate", "gig", "rep", "owe", "ind", "hog", "eve", "sam", "zoo", "any", "dow", "cod", "bed", "vet", "ham", "sis", "hex", "via", "fir", "nod", "mao", "aug", "mum", "hoe", "bah", "hal", "keg", "hew", "zed", "tow", "gog", "ass", "dem", "who", "bet", "gos", "son", "ear", "spy", "kit", "boy", "due", "sen", "oaf", "mix", "hep", "fur", "ada", "bin", "nil", "mia", "ewe", "hit", "fix", "sad", "rib", "eye", "hop", "haw", "wax", "mid", "tad", "ken", "wad", "rye", "pap", "bog", "gut", "ito", "woe", "our", "ado", "sin", "mad", "ray", "hon", "roy", "dip", "hen", "iva", "lug", "asp", "hui", "yak", "bay", "poi", "yep", "bun", "try", "lad", "elm", "nat", "wyo", "gym", "dug", "toe", "dee", "wig", "sly", "rip", "geo", "cog", "pas", "zen", "odd", "nan", "lay", "pod", "fit", "hem", "joy", "bum", "rio", "yon", "dec", "leg", "put", "sue", "dim", "pet", "yaw", "nub", "bit", "bur", "sid", "sun", "oil", "red", "doc", "moe", "caw", "eel", "dix", "cub", "end", "gem", "off", "yew", "hug", "pop", "tub", "sgt", "lid", "pun", "ton", "sol", "din", "yup", "jab", "pea", "bug", "gag", "mil", "jig", "hub", "low", "did", "tin", "get", "gte", "sox", "lei", "mig", "fig", "lon", "use", "ban", "flo", "nov", "jut", "bag", "mir", "sty", "lap", "two", "ins", "con", "ant", "net", "tux", "ode", "stu", "mug", "cad", "nap", "gun", "fop", "tot", "sow", "sal", "sic", "ted", "wot", "del", "imp", "cob", "way", "ann", "tan", "mci", "job", "wet", "ism", "err", "him", "all", "pad", "hah", "hie", "aim", "ike", "jed", "ego", "mac", "baa", "min", "com", "ill", "was", "cab", "ago", "ina", "big", "ilk", "gal", "tap", "duh", "ola", "ran", "lab", "top", "gob", "hot", "ora", "tia", "kip", "han", "met", "hut", "she", "sac", "fed", "goo", "tee", "ell", "not", "act", "gil", "rut", "ala", "ape", "rig", "cid", "god", "duo", "lin", "aid", "gel", "awl", "lag", "elf", "liz", "ref", "aha", "fib", "oho", "tho", "her", "nor", "ace", "adz", "fun", "ned", "coo", "win", "tao", "coy", "van", "man", "pit", "guy", "foe", "hid", "mai", "sup", "jay", "hob", "mow", "jot", "are", "pol", "arc", "lax", "aft", "alb", "len", "air", "pug", "pox", "vow", "got", "meg", "zoe", "amp", "ale", "bud", "gee", "pin", "dun", "pat", "ten", "mob"};
 //        List<String> wordList = new ArrayList<>();
 //        wordList.addAll(Arrays.asList(words));
         System.out.println(solution.findLadders(beginWord, endWord, Arrays.asList(words)));
diff --git a/[0126][Word Ladder II]/src/Solution.java b/[0126][Word Ladder II]/src/Solution.java
index bc6ce38..14edd09 100644
--- a/[0126][Word Ladder II]/src/Solution.java	
+++ b/[0126][Word Ladder II]/src/Solution.java	
@@ -1,10 +1,4 @@
-import java.util.ArrayList;
-import java.util.HashMap;
-import java.util.HashSet;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Queue;
-import java.util.Set;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
diff --git a/[0126][Word Ladder II]/src/Solution2.java b/[0126][Word Ladder II]/src/Solution2.java
index 7315d8d..206bddb 100644
--- a/[0126][Word Ladder II]/src/Solution2.java	
+++ b/[0126][Word Ladder II]/src/Solution2.java	
@@ -1,8 +1,4 @@
-import java.util.Deque;
-import java.util.HashSet;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Set;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
@@ -58,7 +54,7 @@ public List<List<String>> findLadders(String beginWord, String endWord, List<Str
         List<List<String>> result = new LinkedList<>();
         Deque<String> current = new LinkedList<>();
         findLadders(beginWord, endWord, wordDict, current, result);
-        for(List<String> r: result) {
+        for (List<String> r : result) {
             r.add(0, beginWord);
         }
         return result;
@@ -95,7 +91,7 @@ else if (result.get(0).size() > current.size()) {
                 chars[i] = ch;
                 String s = new String(chars);
 
-                if (wordDict.contains(s) ) {
+                if (wordDict.contains(s)) {
                     wordDict.remove(s);
                     current.add(s);
 
diff --git a/[0126][Word Ladder II]/src/Solution3.java b/[0126][Word Ladder II]/src/Solution3.java
index 906bc48..ddb5639 100644
--- a/[0126][Word Ladder II]/src/Solution3.java	
+++ b/[0126][Word Ladder II]/src/Solution3.java	
@@ -1,8 +1,4 @@
-import java.util.Deque;
-import java.util.HashSet;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Set;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
diff --git a/[0127][Word Ladder]/src/Solution.java b/[0127][Word Ladder]/src/Solution.java
index 5366850..4cb9ab8 100644
--- a/[0127][Word Ladder]/src/Solution.java	
+++ b/[0127][Word Ladder]/src/Solution.java	
@@ -1,8 +1,4 @@
-import java.util.Deque;
-import java.util.HashSet;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Set;
+import java.util.*;
 
 /**
  * Author: ������
diff --git a/[0130][Surrounded Regions]/src/Solution.java b/[0130][Surrounded Regions]/src/Solution.java
index 636f0a0..4f7cf47 100644
--- a/[0130][Surrounded Regions]/src/Solution.java	
+++ b/[0130][Surrounded Regions]/src/Solution.java	
@@ -50,7 +50,6 @@ void solve(char[][] board) {
         }
 
 
-
         for (int i = 0; i < board.length; ++i) {
             for (int j = 0; j < board[i].length; ++j) {
                 if (board[i][j] == 'O') {
diff --git a/[0131][Palindrome Partitioning]/src/Main.java b/[0131][Palindrome Partitioning]/src/Main.java
index 8266432..d295707 100644
--- a/[0131][Palindrome Partitioning]/src/Main.java	
+++ b/[0131][Palindrome Partitioning]/src/Main.java	
@@ -1,7 +1,5 @@
 import org.junit.Test;
 
-import java.util.Arrays;
-
 /**
  * @author: wangjunchao(王俊超)
  * @time: 2019-06-21 18:36
diff --git a/[0136][Single Number]/src/Solution.java b/[0136][Single Number]/src/Solution.java
index 1ec5d37..b32b8a7 100644
--- a/[0136][Single Number]/src/Solution.java	
+++ b/[0136][Single Number]/src/Solution.java	
@@ -8,13 +8,13 @@ public class Solution {
     /**
      * Given an array of integers, every element appears twice except for one.
      * Find that single one.
-     *
+     * <p>
      * Note: Your algorithm should have a linear runtime complexity.
      * Could you implement it without using extra memory?
-     *
+     * <p>
      * ����һ�����飬ÿ��Ԫ�ض�����2�γ������е�һ�����ҳ�ֻ����һ�ε�����
      * ע�⣺�㷨����������ʱ�临�Ӷȣ����Բ�ʹ�ö���ռ�ʵ����
-     *
+     * <p>
      * ����˼·��ʹ���������
      *
      * @param nums
@@ -27,7 +27,7 @@ public int singleNumber(int[] nums) {
         }
 
 
-        for (int i = 1; i< nums.length; i++) {
+        for (int i = 1; i < nums.length; i++) {
             nums[0] ^= nums[i];
         }
         return nums[0];
diff --git a/[0138][Copy List With Random Pointer]/src/Main.java b/[0138][Copy List With Random Pointer]/src/Main.java
index 85972fb..92f5099 100644
--- a/[0138][Copy List With Random Pointer]/src/Main.java	
+++ b/[0138][Copy List With Random Pointer]/src/Main.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-24
  * Time: 09:18
  * Declaration: All Rights Reserved !!!
@@ -21,7 +21,7 @@ public static void main(String[] args) {
 
     }
 
-    public static  void print(RandomListNode head) {
+    public static void print(RandomListNode head) {
         while (head != null) {
             System.out.print(head.label + "->");
             head = head.next;
diff --git a/[0138][Copy List With Random Pointer]/src/Solution.java b/[0138][Copy List With Random Pointer]/src/Solution.java
index 5501ab5..f392526 100644
--- a/[0138][Copy List With Random Pointer]/src/Solution.java	
+++ b/[0138][Copy List With Random Pointer]/src/Solution.java	
@@ -87,7 +87,7 @@ public RandomListNode splitList(RandomListNode head) {
         // ��ǰ���ƵĽ��
         RandomListNode copy;
 
-        while (node != null){
+        while (node != null) {
             // ָ���ƽ��
             copy = node.next;
 
diff --git a/[0141][Linked List Cycle]/src/ListNode.java b/[0141][Linked List Cycle]/src/ListNode.java
index a9b5f6a..8892796 100644
--- a/[0141][Linked List Cycle]/src/ListNode.java	
+++ b/[0141][Linked List Cycle]/src/ListNode.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-08-21
  * Time: 19:17
  * Declaration: All Rights Reserved !!!
@@ -7,6 +7,7 @@
 public class ListNode {
     int val;
     ListNode next;
+
     ListNode(int x) {
         val = x;
         next = null;
diff --git a/[0142][Linked List Cycle II]/src/ListNode.java b/[0142][Linked List Cycle II]/src/ListNode.java
index fba59f9..c9da456 100644
--- a/[0142][Linked List Cycle II]/src/ListNode.java	
+++ b/[0142][Linked List Cycle II]/src/ListNode.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-08-21
  * Time: 19:19
  * Declaration: All Rights Reserved !!!
@@ -7,6 +7,7 @@
 public class ListNode {
     int val;
     ListNode next;
+
     ListNode(int x) {
         val = x;
         next = null;
diff --git a/[0143][Reorder List]/src/ListNode.java b/[0143][Reorder List]/src/ListNode.java
index 1f6cb21..dc97875 100644
--- a/[0143][Reorder List]/src/ListNode.java	
+++ b/[0143][Reorder List]/src/ListNode.java	
@@ -5,7 +5,7 @@
  * Declaration: All Rights Reserved !!!
  */
 public class ListNode {
-    int      val;
+    int val;
     ListNode next;
 
     ListNode(int x) {
diff --git a/[0143][Reorder List]/src/Solution.java b/[0143][Reorder List]/src/Solution.java
index 8c489cf..c4f61a9 100644
--- a/[0143][Reorder List]/src/Solution.java	
+++ b/[0143][Reorder List]/src/Solution.java	
@@ -24,6 +24,7 @@ public class Solution {
      * 2������������������㣬�ͽ��м���֮����������в�֣������
      *
      * </pre>
+     *
      * @param head
      */
     public void reorderList(ListNode head) {
diff --git a/[0150][Evaluate Reverse Polish Notation]/src/Main.java b/[0150][Evaluate Reverse Polish Notation]/src/Main.java
index f6672ab..ce7f89f 100644
--- a/[0150][Evaluate Reverse Polish Notation]/src/Main.java	
+++ b/[0150][Evaluate Reverse Polish Notation]/src/Main.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-20
  * Time: 07:14
  * Declaration: All Rights Reserved !!!
@@ -7,6 +7,6 @@
 public class Main {
     public static void main(String[] args) {
         Solution solution = new Solution();
-        System.out.println(solution.evalRPN(new String[]{"0","3","/"}));
+        System.out.println(solution.evalRPN(new String[]{"0", "3", "/"}));
     }
 }
diff --git a/[0150][Evaluate Reverse Polish Notation]/src/Solution.java b/[0150][Evaluate Reverse Polish Notation]/src/Solution.java
index 499adc9..17993a7 100644
--- a/[0150][Evaluate Reverse Polish Notation]/src/Solution.java	
+++ b/[0150][Evaluate Reverse Polish Notation]/src/Solution.java	
@@ -1,4 +1,3 @@
-import java.util.Queue;
 import java.util.Stack;
 
 /**
diff --git a/[0160][Intersection of Two Linked Lists]/src/Solution.java b/[0160][Intersection of Two Linked Lists]/src/Solution.java
index 9872669..72f8e1a 100644
--- a/[0160][Intersection of Two Linked Lists]/src/Solution.java	
+++ b/[0160][Intersection of Two Linked Lists]/src/Solution.java	
@@ -63,15 +63,16 @@
 
 
 //leetcode submit region begin(Prohibit modification and deletion)
+
 /**
  * Definition for singly-linked list.
  * public class ListNode {
- *     int val;
- *     ListNode next;
- *     ListNode(int x) {
- *         val = x;
- *         next = null;
- *     }
+ * int val;
+ * ListNode next;
+ * ListNode(int x) {
+ * val = x;
+ * next = null;
+ * }
  * }
  */
 public class Solution {
@@ -96,7 +97,7 @@ public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
         tailA.next = headB;
 
         // 定义快慢指针
-        ListNode fast =  headA;
+        ListNode fast = headA;
         ListNode slow = headA;
 
         while (fast.next != null && fast.next.next != null) {
diff --git a/[0167][Two Sum II - Input array is sorted]/src/Solution.java b/[0167][Two Sum II - Input array is sorted]/src/Solution.java
index 74f81cc..fd34284 100644
--- a/[0167][Two Sum II - Input array is sorted]/src/Solution.java	
+++ b/[0167][Two Sum II - Input array is sorted]/src/Solution.java	
@@ -5,6 +5,7 @@
 public class Solution {
     /**
      * 如果数组很大，target很小，可以考虑先用二分查找法找到不大于target元素的下标，再作处理
+     *
      * @param numbers
      * @param target
      * @return
diff --git a/[0173][Binary Search Tree Iterator]/src/BSTIterator.java b/[0173][Binary Search Tree Iterator]/src/BSTIterator.java
index a1dddf3..8465ef7 100644
--- a/[0173][Binary Search Tree Iterator]/src/BSTIterator.java	
+++ b/[0173][Binary Search Tree Iterator]/src/BSTIterator.java	
@@ -7,8 +7,8 @@
  * @time: 2019-06-28 16:54
  **/
 public class BSTIterator {
-    private TreeNode        root;
-    private TreeNode        prev = null;
+    private TreeNode root;
+    private TreeNode prev = null;
     // 最后一个元素表示next元素的值
     private Deque<TreeNode> deque = new LinkedList<>();
 
@@ -33,9 +33,9 @@ public int next() {
 
         TreeNode temp = deque.removeLast();
 
-        if (temp.right!= null) {
+        if (temp.right != null) {
             TreeNode n = temp.right;
-            while (n!=null) {
+            while (n != null) {
                 deque.addLast(n);
                 n = n.left;
             }
diff --git a/[0173][Binary Search Tree Iterator]/src/Solution.java b/[0173][Binary Search Tree Iterator]/src/Solution.java
index f65bfd9..6fb2141 100644
--- a/[0173][Binary Search Tree Iterator]/src/Solution.java	
+++ b/[0173][Binary Search Tree Iterator]/src/Solution.java	
@@ -8,40 +8,40 @@
 public class Solution {
     @Test
     public void test1() {
-        TreeNode root  = new TreeNode(7);
+        TreeNode root = new TreeNode(7);
         root.left = new TreeNode(3);
         root.right = new TreeNode(15);
         root.right.left = new TreeNode(9);
         root.right.right = new TreeNode(20);
 
         BSTIterator iterator = new BSTIterator(root);
-        Assert.assertEquals(3, iterator.next()  ); // return 3
-        Assert.assertEquals(7, iterator.next()  ); // return 7
+        Assert.assertEquals(3, iterator.next()); // return 3
+        Assert.assertEquals(7, iterator.next()); // return 7
         Assert.assertEquals(true, iterator.hasNext()); // return true
-        Assert.assertEquals(9, iterator.next()   ); // return 9
+        Assert.assertEquals(9, iterator.next()); // return 9
         Assert.assertEquals(true, iterator.hasNext()); // return true
-        Assert.assertEquals(15, iterator.next()   ); // return 15
+        Assert.assertEquals(15, iterator.next()); // return 15
         Assert.assertEquals(true, iterator.hasNext()); // return true
-        Assert.assertEquals(20, iterator.next()   ); // return 20
+        Assert.assertEquals(20, iterator.next()); // return 20
         Assert.assertEquals(false, iterator.hasNext()); // return false
     }
 
     @Test
     public void test2() {
-        TreeNode root  = new TreeNode(7);
+        TreeNode root = new TreeNode(7);
         BSTIterator iterator = new BSTIterator(root);
-        Assert.assertEquals(7, iterator.next()  ); // return 3
+        Assert.assertEquals(7, iterator.next()); // return 3
         Assert.assertEquals(false, iterator.hasNext()); // return false
         Assert.assertEquals(false, iterator.hasNext()); // return false
     }
 
     @Test
     public void test3() {
-        TreeNode root  = new TreeNode(1);
+        TreeNode root = new TreeNode(1);
         root.right = new TreeNode(2);
         BSTIterator iterator = new BSTIterator(root);
-        Assert.assertEquals(true, iterator.hasNext()  ); // return 3
-        Assert.assertEquals(1, iterator.next()  ); // return 3
+        Assert.assertEquals(true, iterator.hasNext()); // return 3
+        Assert.assertEquals(1, iterator.next()); // return 3
         Assert.assertEquals(true, iterator.hasNext()); // return false
         Assert.assertEquals(2, iterator.next()); // return false
         Assert.assertEquals(false, iterator.hasNext()); // return false
diff --git a/[0191][Number Of 1 Bits]/src/Solution.java b/[0191][Number Of 1 Bits]/src/Solution.java
index 5b782f6..3e63a99 100644
--- a/[0191][Number Of 1 Bits]/src/Solution.java	
+++ b/[0191][Number Of 1 Bits]/src/Solution.java	
@@ -1,18 +1,18 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-17
  * Time: 21:51
  * Declaration: All Rights Reserved !!!
  */
 public class Solution {
     /**
-     * Write a function that takes an unsigned integer and returns the number of ��1' bits it has
+     * Write a function that takes an unsigned integer and returns the number of ��1' bits it has
      * (also known as the Hamming weight).
-     *
-     * For example, the 32-bit integer ��11' has binary representation 00000000000000000000000000001011,
+     * <p>
+     * For example, the 32-bit integer ��11' has binary representation 00000000000000000000000000001011,
      * so the function should return 3.
-     *
-     * ���������е�λ��
+     * <p>
+     * ���������е�λ��
      *
      * @param n
      * @return
diff --git a/[0200][Number Of Islands]/src/Solution.java b/[0200][Number Of Islands]/src/Solution.java
index 47991f4..ff8698a 100644
--- a/[0200][Number Of Islands]/src/Solution.java	
+++ b/[0200][Number Of Islands]/src/Solution.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-20
  * Time: 11:00
  * Declaration: All Rights Reserved !!!
@@ -25,12 +25,12 @@ public class Solution {
      *      00011
      * Answer: 3
      *
-     * ��Ŀ���⣺
-     * ������һ����ά����ĵ�ͼ��'1'��½�أ���0��ˮ�����������������������������滷ˮ��
-     * �������ڵ�½��ˮƽ��ֱ���Ӷ��γɵġ�����Լ��������������ĸ��߶���ˮ��Χ��
+     * ��Ŀ���⣺
+     * ������һ����ά����ĵ�ͼ��'1'��½�أ���0��ˮ�����������������������������滷ˮ��
+     * �������ڵ�½��ˮƽ��ֱ���Ӷ��γɵġ�����Լ��������������ĸ��߶���ˮ��Χ��
      *
-     * ����˼·��
-     * һ��������һ����Ӧ�ķ��ʱ�Ǿ��󣬶�����ÿ��Ԫ��ʱ�й�����ȱ���������������ȱ�������ͳ�Ƶ�����Ŀ
+     * ����˼·��
+     * һ��������һ����Ӧ�ķ��ʱ�Ǿ��󣬶�����ÿ��Ԫ��ʱ�й�����ȱ���������������ȱ�������ͳ�Ƶ�����Ŀ
      *
      * </pre>
      *
@@ -38,18 +38,18 @@ public class Solution {
      * @return
      */
     public int numIslands(char[][] grid) {
-        // ������
+        // ������
         if (grid == null || grid.length == 0 || grid[0].length == 0) {
             return 0;
         }
 
-        // Ԫ��Ĭ��ֵ��false
+        // Ԫ��Ĭ��ֵ��false
         boolean[][] visited = new boolean[grid.length][grid[0].length];
 
         int result = 0;
         for (int i = 0; i < grid.length; i++) {
             for (int j = 0; j < grid[0].length; j++) {
-                // �����λ��û�б����ʹ������Ҵ�λ���ǵ�������¹�����ȱ���
+                // �����λ��û�б����ʹ������Ҵ�λ���ǵ�������¹�����ȱ���
                 if (!visited[i][j] && grid[i][j] == '1') {
                     result++;
                     bfs(grid, visited, i, j);
@@ -60,29 +60,30 @@ public int numIslands(char[][] grid) {
     }
 
     /**
-     * �����������
-     * @param grid ����
-     * @param visited ���ʱ�Ǿ���
-     * @param row ������
-     * @param col ������
+     * �����������
+     *
+     * @param grid    ����
+     * @param visited ���ʱ�Ǿ���
+     * @param row     ������
+     * @param col     ������
      */
     private void bfs(char[][] grid, boolean[][] visited, int row, int col) {
 
-        if (row >= 0 && row < grid.length // �кϷ�
-                && col >= 0 && col < grid[0].length // �кϷ�
-                && !visited[row][col] // û�з��ʹ�
-                && grid[row][col] == '1') { // �ǵ���½��
+        if (row >= 0 && row < grid.length // �кϷ�
+                && col >= 0 && col < grid[0].length // �кϷ�
+                && !visited[row][col] // û�з��ʹ�
+                && grid[row][col] == '1') { // �ǵ���½��
 
-            // ��Ǵ�λ���Ѿ����ʹ���
+            // ��Ǵ�λ���Ѿ����ʹ���
             visited[row][col] = true;
 
-            // ��
+            // ��
             bfs(grid, visited, row - 1, col);
-            // ��
+            // ��
             bfs(grid, visited, row, col + 1);
-            // ��
+            // ��
             bfs(grid, visited, row + 1, col);
-            // ��
+            // ��
             bfs(grid, visited, row, col - 1);
         }
     }
diff --git a/[0202][Happy Number ]/src/Solution.java b/[0202][Happy Number ]/src/Solution.java
index 5df793f..46f562d 100644
--- a/[0202][Happy Number ]/src/Solution.java	
+++ b/[0202][Happy Number ]/src/Solution.java	
@@ -1,7 +1,7 @@
 import java.util.HashSet;
 
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-17
  * Time: 21:36
  * Declaration: All Rights Reserved !!!
@@ -13,9 +13,9 @@ public class Solution {
      * replace the number by the sum of the squares of its digits, and repeat the process until the number
      * equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those
      * numbers for which this process ends in 1 are happy numbers.
-     *
-     * ��ĿҪ�������һ�������������ϸ�����λ�����ֵ�ƽ���ͣ�����������Ϊ1���������Ϊhappy number��
-     * ���������ܴ�ij������ʼ����ѭ����
+     * <p>
+     * ��ĿҪ�������һ�������������ϸ�����λ�����ֵ�ƽ���ͣ�����������Ϊ1���������Ϊhappy number��
+     * ���������ܴ�ij������ʼ����ѭ����
      *
      * @param n
      * @return
@@ -26,13 +26,13 @@ public boolean isHappy(int n) {
             return false;
         }
 
-        // ���ڱ����м���ֵĽ��
+        // ���ڱ����м���ֵĽ��
         HashSet<Integer> set = new HashSet<>(32);
 
         int tmp;
         int newN;
 
-        // n��Ϊ1������n��ֵ�����ظ����֣��������ѭ��
+        // n��Ϊ1������n��ֵ�����ظ����֣��������ѭ��
         while (n != 1 && !set.contains(n)) {
             set.add(n);
             newN = 0;
diff --git a/[0206][Reverse Linked List]/src/Solution.java b/[0206][Reverse Linked List]/src/Solution.java
index 3799055..360bebd 100644
--- a/[0206][Reverse Linked List]/src/Solution.java	
+++ b/[0206][Reverse Linked List]/src/Solution.java	
@@ -32,6 +32,7 @@ public ListNode reverseList(ListNode head) {
 
     /**
      * TODO ʹ�õݹ�ⷨ
+     *
      * @param head
      * @return
      */
diff --git a/[0207][Course Schedule]/src/Main.java b/[0207][Course Schedule]/src/Main.java
index ac84c6d..a94abab 100644
--- a/[0207][Course Schedule]/src/Main.java	
+++ b/[0207][Course Schedule]/src/Main.java	
@@ -39,7 +39,7 @@ public void test4() {
     @Test
     public void test5() {
         Solution solution = new Solution();
-        int[][] arr = {{1,0},{2,6},{1,7},{6,4},{7,0},{0,5}};
+        int[][] arr = {{1, 0}, {2, 6}, {1, 7}, {6, 4}, {7, 0}, {0, 5}};
         Assert.assertEquals(true, solution.canFinish(8, arr));
     }
 }
diff --git a/[0207][Course Schedule]/src/Solution.java b/[0207][Course Schedule]/src/Solution.java
index a929c91..208c49e 100644
--- a/[0207][Course Schedule]/src/Solution.java	
+++ b/[0207][Course Schedule]/src/Solution.java	
@@ -1,8 +1,4 @@
-import java.util.Deque;
-import java.util.HashMap;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Map;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
@@ -93,7 +89,7 @@ private boolean dfs(int course, Map<Integer, List<Integer>> dependencies, boolea
         path.addLast(course);
 
 
-        for(int i: dependency) {
+        for (int i : dependency) {
             boolean result = dfs(i, dependencies, visit, path);
             if (!result) {
                 return false;
diff --git a/[0215][Kth Largest Element In An Array]/src/Main.java b/[0215][Kth Largest Element In An Array]/src/Main.java
index cd77742..ec1a203 100644
--- a/[0215][Kth Largest Element In An Array]/src/Main.java	
+++ b/[0215][Kth Largest Element In An Array]/src/Main.java	
@@ -1,5 +1,5 @@
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-19
  * Time: 20:01
  * Declaration: All Rights Reserved !!!
@@ -7,6 +7,6 @@
 public class Main {
     public static void main(String[] args) {
         Solution solution = new Solution();
-        System.out.println(solution.findKthLargest(new int[]{2 , 1}, 2));
+        System.out.println(solution.findKthLargest(new int[]{2, 1}, 2));
     }
 }
diff --git a/[0215][Kth Largest Element In An Array]/src/Solution.java b/[0215][Kth Largest Element In An Array]/src/Solution.java
index 8119edf..7648127 100644
--- a/[0215][Kth Largest Element In An Array]/src/Solution.java	
+++ b/[0215][Kth Largest Element In An Array]/src/Solution.java	
@@ -1,7 +1,5 @@
-import java.util.Collections;
-
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-19
  * Time: 19:36
  * Declaration: All Rights Reserved !!!
@@ -16,14 +14,14 @@ public class Solution {
      * Given [3,2,1,5,6,4] and k = 2, return 5.
      *
      * Note:
-     * You may assume k is always valid, 1 �� k �� array's length.
+     * You may assume k is always valid, 1 �� k �� array's length.
      *
-     * ��Ŀ���⣺
-     * ��һ��δ��������������ҳ���k���Ԫ�ء�ע��������֮��ĵ�k�󣬶��ǵ�k�����ظ���Ԫ��
-     * ���Լ���kһ������Ч�ģ� 1 �� k �� ���鳤��
+     * ��Ŀ���⣺
+     * ��һ��δ��������������ҳ���k���Ԫ�ء�ע��������֮��ĵ�k�󣬶��ǵ�k�����ظ���Ԫ��
+     * ���Լ���kһ������Ч�ģ� 1 �� k �� ���鳤��
      *
-     * ����˼·��
-     * O(n)�ⷨ������ѡ��QuickSelect���㷨
+     * ����˼·��
+     * O(n)�ⷨ������ѡ��QuickSelect���㷨
      * </pre>
      *
      * @param nums
@@ -41,19 +39,19 @@ public int findKthLargest(int[] nums, int k) {
 
     public int findKthLargest(int[] nums, int start, int end, int k) {
 
-        // ����ֵ
+        // ����ֵ
         int pivot = nums[start];
         int lo = start;
         int hi = end;
 
         while (lo < hi) {
-            // ��С������ֵ�����ƶ����������
+            // ��С������ֵ�����ƶ����������
             while (lo < hi && nums[hi] >= pivot) {
                 hi--;
             }
             nums[lo] = nums[hi];
 
-            // ����������ֵ�����ƶ��������ұ�
+            // ����������ֵ�����ƶ��������ұ�
             while (lo < hi && nums[lo] <= pivot) {
                 lo++;
             }
@@ -62,19 +60,19 @@ public int findKthLargest(int[] nums, int start, int end, int k) {
 
         nums[lo] = pivot;
 
-        // ����Ѿ��ҵ���
+        // ����Ѿ��ҵ���
         if (end - lo + 1 == k) {
             return pivot;
         }
-        // ��k�������loλ�õ��ұ�
-        else if (end - lo + 1 > k){
+        // ��k�������loλ�õ��ұ�
+        else if (end - lo + 1 > k) {
             return findKthLargest(nums, lo + 1, end, k);
         }
-        // ��k�������loλ�õ����
+        // ��k�������loλ�õ����
         else {
             // k-(end-lo+1)
-            // (end-lo+1)����ʾ��loλ�ÿ�ʼ��endλ�õ�Ԫ�ظ�������������Ұ벿��
-            // ԭ���ĵ�k����k-(end-lo+1)��
+            // (end-lo+1)����ʾ��loλ�ÿ�ʼ��endλ�õ�Ԫ�ظ�������������Ұ벿��
+            // ԭ���ĵ�k����k-(end-lo+1)��
             return findKthLargest(nums, start, lo - 1, k - (end - lo + 1));
         }
     }
diff --git a/[0216][Combination Sum III]/src/Solution.java b/[0216][Combination Sum III]/src/Solution.java
index e2c8e6f..563a5f7 100644
--- a/[0216][Combination Sum III]/src/Solution.java	
+++ b/[0216][Combination Sum III]/src/Solution.java	
@@ -1,9 +1,8 @@
-import java.util.Collections;
 import java.util.LinkedList;
 import java.util.List;
 
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-21
  * Time: 21:31
  * Declaration: All Rights Reserved !!!
@@ -27,12 +26,12 @@ public class Solution {
      * Output:
      * [[1,2,6], [1,3,5], [2,3,4]]
      *
-     * ��Ŀ���⣺
-     * Ѱ����������k����֮�͵���n����ϣ�ֻ����ʹ������1-9������ÿһ������е�����Ӧ����Ψһ�ġ�
-     * ȷ������е������Ե���˳�����С�
+     * ��Ŀ���⣺
+     * Ѱ����������k����֮�͵���n����ϣ�ֻ����ʹ������1-9������ÿһ������е�����Ӧ����Ψһ�ġ�
+     * ȷ������е������Ե���˳�����С�
      *
-     * ����˼·��
-     * ���ݷ�
+     * ����˼·��
+     * ���ݷ�
      * </pre>
      *
      * @param k
@@ -40,57 +39,57 @@ public class Solution {
      * @return
      */
     public List<List<Integer>> combinationSum3(int k, int n) {
-        // ���ڱ������н��
+        // ���ڱ������н��
         List<List<Integer>> result = new LinkedList<>();
-        // ���ڱ����м���
+        // ���ڱ����м���
         List<Integer> list = new LinkedList<>();
-        // ��������ͽ��н������
+        // ��������ͽ��н������
         if (k > 0 && k <= 9) {
-                solve(k, 1, n, 0, list, result);
+            solve(k, 1, n, 0, list, result);
         }
 
-        // ���ؽ��
+        // ���ؽ��
         return result;
     }
 
     /**
-     * ��ⷽ��
+     * ��ⷽ��
      *
-     * @param k         ÿ�����Ԫ�ظ���
-     * @param cur       ��ǰ������k��Ԫ��
-     * @param remainder k - cur + 1��Ԫ�صĺ�
-     * @param prevVal   ��cur-1��Ԫ�ص�ȡֵ
-     * @param list      �����Ԫ�صļ�����
-     * @param result    ��������������
+     * @param k         ÿ�����Ԫ�ظ���
+     * @param cur       ��ǰ�����k��Ԫ��
+     * @param remainder k - cur + 1��Ԫ�صĺ�
+     * @param prevVal   ��cur-1��Ԫ�ص�ȡֵ
+     * @param list      �����Ԫ�صļ�����
+     * @param result    ��������������
      */
     public void solve(int k, int cur, int remainder, int prevVal, List<Integer> list, List<List<Integer>> result) {
-        // �������һ��Ԫ��
+        // �������һ��Ԫ��
         if (cur == k) {
-            // remainderΪ���һ����Ԫ�ص�ֵ�����������ǰһ����Ԫ�ص�ֵ�����Ҳ��ܳ���9
+            // remainderΪ���һ����Ԫ�ص�ֵ�����������ǰһ����Ԫ�ص�ֵ�����Ҳ��ܳ���9
             if (remainder > prevVal && remainder <= 9) {
-                // ����Ԫ��ֵ
+                // ���Ԫ��ֵ
                 list.add(remainder);
 
-                // ����������µĶ�����
+                // ����������µĶ�����
                 List<Integer> one = new LinkedList<>();
                 for (Integer i : list) {
                     one.add(i);
                 }
 
-                // ������
+                // ������
                 result.add(one);
-                // ɾ�����һ��Ԫ�أ������ֳ���ԭ
+                // ɾ�����һ��Ԫ�أ������ֳ���ԭ
                 list.remove(list.size() - 1);
             }
         }
-        // �������һ��Ԫ��
-        else if (cur < k){
+        // �������һ��Ԫ��
+        else if (cur < k) {
             for (int i = prevVal + 1; i <= 9 - (k - cur); i++) {
-                // ����Ԫ��
+                // ���Ԫ��
                 list.add(i);
-                // �ݹ����
+                // �ݹ����
                 solve(k, cur + 1, remainder - i, i, list, result);
-                // �ֳ���ԭ
+                // �ֳ���ԭ
                 list.remove(list.size() - 1);
 
             }
diff --git a/[0217][Contains Duplicate ]/src/Solution.java b/[0217][Contains Duplicate ]/src/Solution.java
index 67fdbb9..d144b96 100644
--- a/[0217][Contains Duplicate ]/src/Solution.java	
+++ b/[0217][Contains Duplicate ]/src/Solution.java	
@@ -2,7 +2,7 @@
 import java.util.Set;
 
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-18
  * Time: 09:40
  * Declaration: All Rights Reserved !!!
@@ -15,26 +15,26 @@ public class Solution {
      * Your function should return true if any value appears at least twice in the
      * array, and it should return false if every element is distinct.
      * <p>
-     * ��Ŀ���⣺����һ���������飬�ж��������Ƿ�����ظ�Ԫ�ء��������������һ�����ֳ������������Σ�
-     * ��ĺ���Ӧ�÷���true�����ÿһ��Ԫ�ض���Ψһ�ģ�����false��
-     *
-     * ����˼·����set���ݽṹ
+     * ��Ŀ���⣺����һ���������飬�ж��������Ƿ�����ظ�Ԫ�ء��������������һ�����ֳ������������Σ�
+     * ��ĺ���Ӧ�÷���true�����ÿһ��Ԫ�ض���Ψһ�ģ�����false��
+     * <p>
+     * ����˼·����set���ݽṹ
      *
      * @param nums
      * @return
      */
     public boolean containsDuplicate(int[] nums) {
 
-        // Ԫ�ظ�������1�Ž�������IJ���
+        // Ԫ�ظ�������1�Ž�������IJ���
         if (nums != null && nums.length > 1) {
-            //����һ��hashSet
+            //����һ��hashSet
             Set<Integer> set = new HashSet<>(nums.length);
-            for(int i : nums) {
-                // ���Ԫ���Ѿ����ھͷ���true
+            for (int i : nums) {
+                // ���Ԫ���Ѿ����ھͷ���true
                 if (set.contains(i)) {
                     return true;
                 }
-                // û�о����ӵ�Ԫ�ؼ�����
+                // û�о���ӵ�Ԫ�ؼ�����
                 else {
                     set.add(i);
                 }
diff --git a/[0219][Contains Duplicate II]/src/Solution.java b/[0219][Contains Duplicate II]/src/Solution.java
index 2fa0545..3c0f97e 100644
--- a/[0219][Contains Duplicate II]/src/Solution.java	
+++ b/[0219][Contains Duplicate II]/src/Solution.java	
@@ -2,7 +2,7 @@
 import java.util.Map;
 
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-19
  * Time: 14:10
  * Declaration: All Rights Reserved !!!
@@ -13,22 +13,22 @@ public class Solution {
      * Given an array of integers and an integer k, find out whether there there are
      * two distinct indices i and j in the array such that nums[i] = nums[j] and the
      * difference between i and j is at most k.
-     * 
-     * ��Ŀ���⣺
-     * ����һ����������nums��һ������k�����ҽ�������������ͬ���±�i��j����nums[i] = nums[j]
-     * ����|i-j|<=kʱ����true�����򷵻�false��
-     *
-     * ����˼·��
-     * ��nums[0...n-1]������һ��map�У�(muns[i], i)�������nums[k]�Ѿ����ڣ�
-     * ��Ƚ�֮ǰ���±�����ڵ��±�IJ�ֵ�������ֵ������k��˵��������������������ֵ��
-     * ����ʹ���µ��±���Ϊֵ
+     * <p>
+     * ��Ŀ���⣺
+     * ����һ����������nums��һ������k�����ҽ�������������ͬ���±�i��j����nums[i] = nums[j]
+     * ����|i-j|<=kʱ����true�����򷵻�false��
+     * <p>
+     * ����˼·��
+     * ��nums[0...n-1]������һ��map�У�(muns[i], i)�������nums[k]�Ѿ����ڣ�
+     * ��Ƚ�֮ǰ���±�����ڵ��±�IJ�ֵ�������ֵ������k��˵��������������������ֵ��
+     * ����ʹ���µ��±���Ϊֵ
      *
      * @param nums
      * @param k
      * @return
      */
     public boolean containsNearbyDuplicate(int[] nums, int k) {
-        // ���������ж�
+        // ���������ж�
         if (nums == null || nums.length < 2 || k < 1) {
             return false;
         }
@@ -36,13 +36,13 @@ public boolean containsNearbyDuplicate(int[] nums, int k) {
         Map<Integer, Integer> map = new HashMap<>();
         for (int i = 0; i < nums.length; i++) {
 
-            // ���û�ж�Ӧ��key���ӽ�ȥ
+            // ���û�ж�Ӧ��key��ӽ�ȥ
             if (!map.containsKey(nums[i])) {
                 map.put(nums[i], i);
             }
-            // �Ѿ��ж�Ӧ��key-value��
+            // �Ѿ��ж�Ӧ��key-value��
             else {
-                // ԭ�������ֵ��Ӧ���±꣬��һ��С�����ڵ��±�
+                // ԭ�������ֵ��Ӧ���±꣬��һ��С�����ڵ��±�
                 int value = map.get(nums[i]);
                 if (i - value <= k) {
                     return true;
diff --git a/[0223][Rectangle Area]/src/Solution.java b/[0223][Rectangle Area]/src/Solution.java
index f2ea311..b8d05d5 100644
--- a/[0223][Rectangle Area]/src/Solution.java	
+++ b/[0223][Rectangle Area]/src/Solution.java	
@@ -1,7 +1,5 @@
-import java.util.*;
-
 /**
- * Author: ������
+ * Author: ������
  * Date: 2015-06-19
  * Time: 15:32
  * Declaration: All Rights Reserved !!!
@@ -28,7 +26,7 @@ public class Solution {
      * *****************************                   *
      * (A,B):(-3,0)*                                   *
      *             *                                   *
-     *             * (E,F):(0��-1)                     *
+     *             * (E,F):(0��-1)                     *
      *             *************************************
      *
      *   ***************************        ***************************
@@ -43,11 +41,11 @@ public class Solution {
      *
      *
      * </pre>
-     * ��Ŀ���⣺
-     * �������������ܹ����ǵ����
+     * ��Ŀ���⣺
+     * �������������ܹ����ǵ����
      * <p>
-     * ����˼·��
-     * ���㷽��Ϊ����1�����+����2�����-�������ι�ͬ�ĸ��������
+     * ����˼·��
+     * ���㷽��Ϊ����1�����+����2�����-�������ι�ͬ�ĸ��������
      *
      * @param A
      * @param B
@@ -60,18 +58,18 @@ public class Solution {
      * @return
      */
     public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
-        long area = (long) (C - A) * (D - B) + (long)(G - E) * (H - F);
-        // Math.min(C, G) ��ʾ�ұ߱ߵ���С�ı�
-        // Math.max(A, E) ��ʾ��߱ߵ����ı�
-        // ����ļ������������Խ�飬Ҫ�������ݷ�Χ
-        long width = Math.max((long)Math.min(C, G) - (long)Math.max(A, E), 0);
-        // Math.min(D, H) ��ʾ���߱ߵ���С�ı�
-        // Math.max(B, F) ��ʾ�ױ߱ߵ����ı�
-        long height = Math.max((long)Math.min(D, H) - (long)Math.max(B, F), 0);
+        long area = (long) (C - A) * (D - B) + (long) (G - E) * (H - F);
+        // Math.min(C, G) ��ʾ�ұ߱ߵ���С�ı�
+        // Math.max(A, E) ��ʾ��߱ߵ����ı�
+        // ����ļ������������Խ�飬Ҫ�������ݷ�Χ
+        long width = Math.max((long) Math.min(C, G) - (long) Math.max(A, E), 0);
+        // Math.min(D, H) ��ʾ���߱ߵ���С�ı�
+        // Math.max(B, F) ��ʾ�ױ߱ߵ����ı�
+        long height = Math.max((long) Math.min(D, H) - (long) Math.max(B, F), 0);
 
-        System.out.println(width +":" + height + "=" + width*height);
+        System.out.println(width + ":" + height + "=" + width * height);
 
-        return (int)(area - width * height);
+        return (int) (area - width * height);
     }
 
 
diff --git a/[0232][Implement Queue using Stacks]/src/MyQueue.java b/[0232][Implement Queue using Stacks]/src/MyQueue.java
index a4cdc0c..25f2f3c 100644
--- a/[0232][Implement Queue using Stacks]/src/MyQueue.java	
+++ b/[0232][Implement Queue using Stacks]/src/MyQueue.java	
@@ -1,6 +1,5 @@
 import java.util.LinkedList;
 import java.util.List;
-import java.util.Queue;
 
 /**
  * @author: wangjunchao(王俊超)
@@ -8,7 +7,7 @@
  **/
 class MyQueue {
 
-    private List<Integer>  list;
+    private List<Integer> list;
 
     /**
      * Initialize your data structure here.
diff --git a/[0234][Palindrome Linked List]/src/ListNode.java b/[0234][Palindrome Linked List]/src/ListNode.java
index 0304f36..4d4fcb5 100644
--- a/[0234][Palindrome Linked List]/src/ListNode.java	
+++ b/[0234][Palindrome Linked List]/src/ListNode.java	
@@ -3,7 +3,7 @@
  * @time: 2018-10-09 11:03
  **/
 public class ListNode {
-    int      val;
+    int val;
     ListNode next;
 
     ListNode(int x) {
diff --git a/[0234][Palindrome Linked List]/src/Solution.java b/[0234][Palindrome Linked List]/src/Solution.java
index 9ace1e4..65ba7ea 100644
--- a/[0234][Palindrome Linked List]/src/Solution.java	
+++ b/[0234][Palindrome Linked List]/src/Solution.java	
@@ -27,7 +27,7 @@ public boolean isPalindrome(ListNode head) {
         // 找反向链的起始位置
         count = (count + 1) / 2;
         node = head;
-        while (count >0) {
+        while (count > 0) {
             count--;
             node = node.next;
         }
diff --git a/[0234][Palindrome Linked List]/src/Test.java b/[0234][Palindrome Linked List]/src/Test.java
index 97b7f35..28f5ec5 100644
--- a/[0234][Palindrome Linked List]/src/Test.java	
+++ b/[0234][Palindrome Linked List]/src/Test.java	
@@ -21,11 +21,11 @@ public static void test2() {
 
         ListNode head = new ListNode(1);
         head.next = new ListNode(2);
-        head.next.next= new ListNode(2);
-        head.next.next.next= new ListNode(1);
-        head.next.next.next.next= new ListNode(2);
-        head.next.next.next.next.next= new ListNode(2);
-        head.next.next.next.next.next.next= new ListNode(1);
+        head.next.next = new ListNode(2);
+        head.next.next.next = new ListNode(1);
+        head.next.next.next.next = new ListNode(2);
+        head.next.next.next.next.next = new ListNode(2);
+        head.next.next.next.next.next.next = new ListNode(1);
         System.out.println(solution.isPalindrome(head));
     }
 
@@ -34,8 +34,8 @@ public static void test3() {
 
         ListNode head = new ListNode(1);
         head.next = new ListNode(2);
-        head.next.next= new ListNode(2);
-        head.next.next.next= new ListNode(1);
+        head.next.next = new ListNode(2);
+        head.next.next.next = new ListNode(1);
 
         System.out.println(solution.isPalindrome(head));
     }
diff --git a/[0235][Lowest Common Ancestor of a Binary Search Tree]/src/TreeNode.java b/[0235][Lowest Common Ancestor of a Binary Search Tree]/src/TreeNode.java
index cb9448f..141d430 100644
--- a/[0235][Lowest Common Ancestor of a Binary Search Tree]/src/TreeNode.java	
+++ b/[0235][Lowest Common Ancestor of a Binary Search Tree]/src/TreeNode.java	
@@ -3,7 +3,7 @@
  * @time: 2018-10-09 11:33
  **/
 public class TreeNode {
-    int      val;
+    int val;
     TreeNode left;
     TreeNode right;
 
diff --git a/[0237][Delete Node in a Linked List]/src/ListNode.java b/[0237][Delete Node in a Linked List]/src/ListNode.java
index 50f6a11..9e0f1da 100644
--- a/[0237][Delete Node in a Linked List]/src/ListNode.java	
+++ b/[0237][Delete Node in a Linked List]/src/ListNode.java	
@@ -3,7 +3,7 @@
  * @time: 2018-10-10 09:58
  **/
 public class ListNode {
-    int      val;
+    int val;
     ListNode next;
 
     ListNode(int x) {
diff --git a/[0237][Delete Node in a Linked List]/src/Solution.java b/[0237][Delete Node in a Linked List]/src/Solution.java
index b440a61..6c60753 100644
--- a/[0237][Delete Node in a Linked List]/src/Solution.java	
+++ b/[0237][Delete Node in a Linked List]/src/Solution.java	
@@ -7,6 +7,7 @@
  *     ListNode(int x) { val = x; }
  * }
  * </pre>
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2018-10-10 09:57
  **/
diff --git a/[0237][Delete Node in a Linked List]/src/Test.java b/[0237][Delete Node in a Linked List]/src/Test.java
index 8863287..a6ee290 100644
--- a/[0237][Delete Node in a Linked List]/src/Test.java	
+++ b/[0237][Delete Node in a Linked List]/src/Test.java	
@@ -19,7 +19,7 @@ private static void print(ListNode node) {
         do {
             if (node == null) {
                 System.out.println("null");
-            } else if (node.next != null){
+            } else if (node.next != null) {
                 System.out.print(node.val + "->");
                 node = node.next;
             } else {
@@ -27,6 +27,6 @@ private static void print(ListNode node) {
                 node = node.next;
             }
 
-        }while (node != null);
+        } while (node != null);
     }
 }
diff --git a/[0238][Product of Array Except Self]/src/Solution.java b/[0238][Product of Array Except Self]/src/Solution.java
index 0c25aa7..e0c6b32 100644
--- a/[0238][Product of Array Except Self]/src/Solution.java	
+++ b/[0238][Product of Array Except Self]/src/Solution.java	
@@ -22,6 +22,7 @@ public class Solution {
      * Could you solve it with constant space complexity? (The output array does not count as
      * extra space for the purpose of space complexity analysis.)
      * </pre>
+     *
      * @param nums
      * @return
      */
@@ -33,7 +34,7 @@ public int[] productExceptSelf(int[] nums) {
 
 
         long product = 1;
-        for (int i  = 0; i < nums.length; i++) {
+        for (int i = 0; i < nums.length; i++) {
             product *= nums[i];
             if (nums[i] == 0) {
                 zero.add(i);
@@ -43,13 +44,13 @@ public int[] productExceptSelf(int[] nums) {
         // 0的个数大于1个
         if (zero.size() > 1) {
             return result;
-        } else if (zero.size() == 1){
+        } else if (zero.size() == 1) {
             int firstZeroIndex = 0;
-            for (Integer i: zero) {
+            for (Integer i : zero) {
                 firstZeroIndex = i;
             }
 
-            result[firstZeroIndex]  = 1;
+            result[firstZeroIndex] = 1;
             for (int i = 0; i < nums.length; i++) {
                 if (i != firstZeroIndex) {
                     result[firstZeroIndex] *= nums[i];
diff --git a/[0240][Search a 2D Matrix II]/src/Solution.java b/[0240][Search a 2D Matrix II]/src/Solution.java
index 0119f00..4b780fe 100644
--- a/[0240][Search a 2D Matrix II]/src/Solution.java	
+++ b/[0240][Search a 2D Matrix II]/src/Solution.java	
@@ -32,7 +32,7 @@ public class Solution {
      */
     public boolean searchMatrix(int[][] matrix, int target) {
 
-        if (matrix == null ||matrix.length == 0) {
+        if (matrix == null || matrix.length == 0) {
             return false;
         }
 
diff --git a/[0241][Different Ways to Add Parentheses]/src/Solution.java b/[0241][Different Ways to Add Parentheses]/src/Solution.java
index 4a5c8ad..d996d4c 100644
--- a/[0241][Different Ways to Add Parentheses]/src/Solution.java	
+++ b/[0241][Different Ways to Add Parentheses]/src/Solution.java	
@@ -30,6 +30,7 @@ public class Solution {
      * (2*((3-4)*5)) = -10
      * (((2*3)-4)*5) = 10
      * </pre>
+     *
      * @param input
      * @return
      */
diff --git a/[0278][First Bad Version]/src/VersionControl.java b/[0278][First Bad Version]/src/VersionControl.java
index d124b97..327bc14 100644
--- a/[0278][First Bad Version]/src/VersionControl.java	
+++ b/[0278][First Bad Version]/src/VersionControl.java	
@@ -6,7 +6,7 @@ public class VersionControl {
 
     private boolean[] badVersion;
 
-    public boolean isBadVersion(int version){
+    public boolean isBadVersion(int version) {
         return badVersion[version - 1];
     }
 
diff --git a/[0292][Nim Game]/src/Solution.java b/[0292][Nim Game]/src/Solution.java
index 2193932..a6fa330 100644
--- a/[0292][Nim Game]/src/Solution.java	
+++ b/[0292][Nim Game]/src/Solution.java	
@@ -1,5 +1,6 @@
 /**
  * https://leetcode.com/problems/nim-game/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-08 18:39
  **/
@@ -26,6 +27,7 @@ public class Solution {
      * 轮完后都有4的倍数个石头被取走。这样，如果我们先走的话，先把n除4的余数个石头拿走，这样不管怎样，到最
      * 后都会留4个下来，对方取1个你就取3个，对方取2个你就取2个，就必赢了。
      * </pre>
+     *
      * @param n
      * @return
      */
@@ -34,6 +36,6 @@ public boolean canWinNim(int n) {
     }
 
     public boolean canWinNim2(int n) {
-        return n %4 != 0;
+        return n % 4 != 0;
     }
 }
diff --git a/[0303][Range Sum Query - Immutable]/src/NumArray.java b/[0303][Range Sum Query - Immutable]/src/NumArray.java
index fb70aae..c64d89d 100644
--- a/[0303][Range Sum Query - Immutable]/src/NumArray.java	
+++ b/[0303][Range Sum Query - Immutable]/src/NumArray.java	
@@ -12,11 +12,11 @@ public NumArray(int[] nums) {
     public int sumRange(int i, int j) {
 
         if (i > j) {
-            throw new IllegalArgumentException("i = " + i + ", j = " + j +", i must not greater than j");
+            throw new IllegalArgumentException("i = " + i + ", j = " + j + ", i must not greater than j");
         }
 
         if (j < 0) {
-            throw new IllegalArgumentException("i = " + i + ", j = " + j +", i must not less than 0");
+            throw new IllegalArgumentException("i = " + i + ", j = " + j + ", i must not less than 0");
         }
 
         i = i < 0 ? 0 : i;
diff --git a/[0326][Power of Three]/src/Solution.java b/[0326][Power of Three]/src/Solution.java
index 8ab7b8d..71d743c 100644
--- a/[0326][Power of Three]/src/Solution.java	
+++ b/[0326][Power of Three]/src/Solution.java	
@@ -6,7 +6,7 @@ public class Solution {
 
     public boolean isPowerOfThree(int n) {
         double rst = (Math.log10(n) / Math.log10(3));
-        return  n > 0 &&Double.doubleToLongBits((int)rst) == Double.doubleToLongBits(rst);
+        return n > 0 && Double.doubleToLongBits((int) rst) == Double.doubleToLongBits(rst);
     }
 
     public boolean isPowerOfThree2(int n) {
diff --git a/[0326][Power of Three]/src/Test.java b/[0326][Power of Three]/src/Test.java
index c99e19b..9cb8806 100644
--- a/[0326][Power of Three]/src/Test.java	
+++ b/[0326][Power of Three]/src/Test.java	
@@ -4,10 +4,10 @@
  **/
 public class Test {
     public static void main(String[] args) {
-        System.out.println(Double.doubleToLongBits((int)1.00000000001)
+        System.out.println(Double.doubleToLongBits((int) 1.00000000001)
                 == Double.doubleToLongBits(1.00000000001));
 
-        System.out.println(Double.doubleToLongBits((int)1.00000000000)
+        System.out.println(Double.doubleToLongBits((int) 1.00000000000)
                 == Double.doubleToLongBits(1.00000000000));
     }
 }
diff --git a/[0338][Counting Bits ]/src/Solution.java b/[0338][Counting Bits ]/src/Solution.java
index 68effd5..901792b 100644
--- a/[0338][Counting Bits ]/src/Solution.java	
+++ b/[0338][Counting Bits ]/src/Solution.java	
@@ -31,6 +31,7 @@ public class Solution {
      * i为偶数 bit(i) = bit(i/2)
      * i为奇数 bit(i) = bit(i/2) + 1
      * </pre>
+     *
      * @param num
      * @return
      */
diff --git a/[0344][Reverse String]/src/Solution.java b/[0344][Reverse String]/src/Solution.java
index 955ed6b..b7bc9c5 100644
--- a/[0344][Reverse String]/src/Solution.java	
+++ b/[0344][Reverse String]/src/Solution.java	
@@ -10,7 +10,7 @@ public String reverseString(String s) {
 
         char[] chars = s.toCharArray();
 
-        for (int i = 0, j = chars.length - 1; i <j; i++, j--) {
+        for (int i = 0, j = chars.length - 1; i < j; i++, j--) {
             swap(chars, i, j);
         }
 
diff --git a/[0347][Top K Frequent Elements]/src/Solution.java b/[0347][Top K Frequent Elements]/src/Solution.java
index 2457331..31cf516 100644
--- a/[0347][Top K Frequent Elements]/src/Solution.java	
+++ b/[0347][Top K Frequent Elements]/src/Solution.java	
@@ -1,10 +1,4 @@
-import java.util.Comparator;
-import java.util.HashMap;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Map;
-import java.util.SortedMap;
-import java.util.TreeMap;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
diff --git a/[0371][Sum of Two Integers]/src/Solution.java b/[0371][Sum of Two Integers]/src/Solution.java
index be4b0f6..411fe08 100644
--- a/[0371][Sum of Two Integers]/src/Solution.java	
+++ b/[0371][Sum of Two Integers]/src/Solution.java	
@@ -22,6 +22,7 @@
 
 
 //leetcode submit region begin(Prohibit modification and deletion)
+
 /**
  * Author: 王俊超
  * Time: 2016-07-03 21-25 10:58
diff --git a/[0374][Guess Number Higher or Lower]/src/Solution.java b/[0374][Guess Number Higher or Lower]/src/Solution.java
index a0b637a..05dec89 100644
--- a/[0374][Guess Number Higher or Lower]/src/Solution.java	
+++ b/[0374][Guess Number Higher or Lower]/src/Solution.java	
@@ -21,6 +21,7 @@ public class Solution extends GuessGame {
      * Input: n = 10, pick = 6
      * Output: 6
      * </pre>
+     *
      * @param n
      * @return
      */
diff --git a/[0387][First Unique Character in a String]/src/Solution.java b/[0387][First Unique Character in a String]/src/Solution.java
index 349a460..ea4eea0 100644
--- a/[0387][First Unique Character in a String]/src/Solution.java	
+++ b/[0387][First Unique Character in a String]/src/Solution.java	
@@ -20,6 +20,7 @@ public class Solution {
      * s = "loveleetcode",
      * return 2.
      * </pre>
+     *
      * @param s
      * @return
      */
@@ -43,7 +44,7 @@ public int firstUniqChar(String s) {
 
         Integer result = null;
 
-        for(Integer n: map.values()) {
+        for (Integer n : map.values()) {
             if (n >= 0) {
                 if (result == null) {
                     result = n;
diff --git a/[0389][Find the Difference]/src/Solution.java b/[0389][Find the Difference]/src/Solution.java
index b2fcd9a..a22ff15 100644
--- a/[0389][Find the Difference]/src/Solution.java	
+++ b/[0389][Find the Difference]/src/Solution.java	
@@ -26,6 +26,7 @@ public class Solution {
      * Explanation:
      * 'e' is the letter that was added.
      * </pre>
+     *
      * @param s
      * @param t
      * @return
diff --git a/[0392][Is Subsequence]/src/Solution.java b/[0392][Is Subsequence]/src/Solution.java
index dc4bc70..fd4ddb2 100644
--- a/[0392][Is Subsequence]/src/Solution.java	
+++ b/[0392][Is Subsequence]/src/Solution.java	
@@ -1,4 +1,3 @@
-
 //Given a string s and a string t, check if s is subsequence of t.
 //
 // A subsequence of a string is a new string which is formed from the original s
@@ -50,11 +49,11 @@ public boolean isSubsequence(String s, String t) {
             return true;
         }
 
-        if (s == null || t == null ) {
+        if (s == null || t == null) {
             return false;
         }
 
-        if (s.length() == 0){
+        if (s.length() == 0) {
             return true;
         }
 
diff --git a/[0400][Nth Digit]/src/Solution2.java b/[0400][Nth Digit]/src/Solution2.java
index b4fc5cb..4a5b2c9 100644
--- a/[0400][Nth Digit]/src/Solution2.java	
+++ b/[0400][Nth Digit]/src/Solution2.java	
@@ -1,5 +1,6 @@
 /**
  * https://leetcode.com/problems/nth-digit/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-09 15:56
  **/
@@ -31,6 +32,7 @@ public class Solution2 {
      *
      * https://www.cnblogs.com/grandyang/p/5891871.html
      *  </pre>
+     *
      * @param n
      * @return
      */
diff --git a/[0401][Binary Watch]/src/Main.java b/[0401][Binary Watch]/src/Main.java
index 7369853..efea389 100644
--- a/[0401][Binary Watch]/src/Main.java	
+++ b/[0401][Binary Watch]/src/Main.java	
@@ -1,4 +1,3 @@
-import org.junit.Assert;
 import org.junit.Test;
 
 /**
diff --git a/[0404][Sum of Left Leaves]/src/Main.java b/[0404][Sum of Left Leaves]/src/Main.java
index b80e566..cf253ab 100644
--- a/[0404][Sum of Left Leaves]/src/Main.java	
+++ b/[0404][Sum of Left Leaves]/src/Main.java	
@@ -9,7 +9,7 @@ public class Main {
     @Test
     public void test1() {
         TreeNode root = new TreeNode(3);
-        root.left  =new TreeNode(9);
+        root.left = new TreeNode(9);
         root.right = new TreeNode(20);
         root.right.left = new TreeNode(15);
         root.right.right = new TreeNode(7);
diff --git a/[0404][Sum of Left Leaves]/src/Solution.java b/[0404][Sum of Left Leaves]/src/Solution.java
index fb3f2d6..d5a8ad8 100644
--- a/[0404][Sum of Left Leaves]/src/Solution.java	
+++ b/[0404][Sum of Left Leaves]/src/Solution.java	
@@ -1,4 +1,3 @@
-
 /**
  * @author: wangjunchao(王俊超)
  * @time: 2019-06-30 14:11
@@ -30,6 +29,7 @@ public int sumOfLeftLeaves(TreeNode root) {
 
     /**
      * 计算所有左叶子的和
+     *
      * @param root
      * @param result
      */
@@ -39,7 +39,7 @@ private void sumOfLeftLeaves(TreeNode root, boolean isLeftLeaf, int[] result) {
             return;
         }
 
-        if (root.left == null && root.right==null && isLeftLeaf) {
+        if (root.left == null && root.right == null && isLeftLeaf) {
             result[0] += root.val;
             return;
         }
diff --git a/[0405][Convert a Number to Hexadecimal]/src/Main.java b/[0405][Convert a Number to Hexadecimal]/src/Main.java
index 343277e..0e56b0e 100644
--- a/[0405][Convert a Number to Hexadecimal]/src/Main.java	
+++ b/[0405][Convert a Number to Hexadecimal]/src/Main.java	
@@ -7,19 +7,19 @@
  **/
 public class Main {
     @Test
-    public void test1(){
+    public void test1() {
         Solution solution = new Solution();
         Assert.assertEquals("1a", solution.toHex(26));
     }
 
     @Test
-    public void test2(){
+    public void test2() {
         Solution solution = new Solution();
         Assert.assertEquals("ffffffff", solution.toHex(-1));
     }
 
     @Test
-    public void test3(){
+    public void test3() {
         Solution solution = new Solution();
         Assert.assertEquals("10", solution.toHex(16));
     }
diff --git a/[0409][Longest Palindrome]/src/Solution2.java b/[0409][Longest Palindrome]/src/Solution2.java
index 4546ba5..ad898f8 100644
--- a/[0409][Longest Palindrome]/src/Solution2.java	
+++ b/[0409][Longest Palindrome]/src/Solution2.java	
@@ -1,5 +1,6 @@
 /**
  * https://leetcode.com/problems/longest-palindrome/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-03 04:08
  **/
diff --git a/[0412][Fizz Buzz]/src/Solution.java b/[0412][Fizz Buzz]/src/Solution.java
index 9689a9c..12a2ebe 100644
--- a/[0412][Fizz Buzz]/src/Solution.java	
+++ b/[0412][Fizz Buzz]/src/Solution.java	
@@ -39,6 +39,7 @@ public class Solution {
      *     "FizzBuzz"
      * ]
      * </pre>
+     *
      * @param n
      * @return
      */
diff --git a/[0415][Add Strings]/src/Solution.java b/[0415][Add Strings]/src/Solution.java
index 9ce5f26..6c1cdab 100644
--- a/[0415][Add Strings]/src/Solution.java	
+++ b/[0415][Add Strings]/src/Solution.java	
@@ -1,67 +1,67 @@
+/**
+ * https://leetcode.com/problems/add-strings/
+ *
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-03 04:26
+ **/
+public class Solution {
     /**
-     * https://leetcode.com/problems/add-strings/
+     * <pre>
+     * Given two non-negative integers num1 and num2 represented as string, return the sum of
+     * num1 and num2.
      *
-     * @author: wangjunchao(王俊超)
-     * @time: 2019-07-03 04:26
-     **/
-    public class Solution {
-        /**
-         * <pre>
-         * Given two non-negative integers num1 and num2 represented as string, return the sum of
-         * num1 and num2.
-         *
-         * Note:
-         *
-         * The length of both num1 and num2 is < 5100.
-         * Both num1 and num2 contains only digits 0-9.
-         * Both num1 and num2 does not contain any leading zero.
-         * You must not use any built-in BigInteger library or convert the inputs to integer directly.
-         * </pre>
-         *
-         * @param num1
-         * @param num2
-         * @return
-         */
-        public String addStrings(String num1, String num2) {
-            if (num1.length() > num2.length()) {
-                // 保证第两个字符串不短于第一个
-                return addStrings(num2, num1);
-            }
+     * Note:
+     *
+     * The length of both num1 and num2 is < 5100.
+     * Both num1 and num2 contains only digits 0-9.
+     * Both num1 and num2 does not contain any leading zero.
+     * You must not use any built-in BigInteger library or convert the inputs to integer directly.
+     * </pre>
+     *
+     * @param num1
+     * @param num2
+     * @return
+     */
+    public String addStrings(String num1, String num2) {
+        if (num1.length() > num2.length()) {
+            // 保证第两个字符串不短于第一个
+            return addStrings(num2, num1);
+        }
 
-            int[] result = new int[num2.length()];
+        int[] result = new int[num2.length()];
 
-            int idx1 = num1.length() - 1;
-            int idx2 = num2.length() - 1;
-            int idx3 = result.length - 1;
-            int carry = 0;
-            while (idx1 >= 0) {
-                int a = num1.charAt(idx1) - '0';
-                int b = num2.charAt(idx2) - '0';
-                result[idx3] = (a + b + carry) % 10;
-                carry = (a + b + carry) / 10;
-                idx1--;
-                idx2--;
-                idx3--;
-            }
+        int idx1 = num1.length() - 1;
+        int idx2 = num2.length() - 1;
+        int idx3 = result.length - 1;
+        int carry = 0;
+        while (idx1 >= 0) {
+            int a = num1.charAt(idx1) - '0';
+            int b = num2.charAt(idx2) - '0';
+            result[idx3] = (a + b + carry) % 10;
+            carry = (a + b + carry) / 10;
+            idx1--;
+            idx2--;
+            idx3--;
+        }
 
 
-            // num2还未处理完
-            while (idx2 >= 0) {
-                int a = num2.charAt(idx2) - '0';
-                result[idx3] = (a + carry) % 10;
-                carry = (a + carry) / 10;
-                idx2--;
-                idx3--;
-            }
+        // num2还未处理完
+        while (idx2 >= 0) {
+            int a = num2.charAt(idx2) - '0';
+            result[idx3] = (a + carry) % 10;
+            carry = (a + carry) / 10;
+            idx2--;
+            idx3--;
+        }
 
-            StringBuilder builder = new StringBuilder();
-            if (carry > 0) {
-                builder.append(carry);
-            }
+        StringBuilder builder = new StringBuilder();
+        if (carry > 0) {
+            builder.append(carry);
+        }
 
-            for(int i : result) {
-                builder.append(i);
-            }
-            return builder.toString();
+        for (int i : result) {
+            builder.append(i);
         }
+        return builder.toString();
     }
+}
diff --git a/[0419][Battleships in a Board]/src/Main.java b/[0419][Battleships in a Board]/src/Main.java
index 2ef0da0..1b46aca 100644
--- a/[0419][Battleships in a Board]/src/Main.java	
+++ b/[0419][Battleships in a Board]/src/Main.java	
@@ -9,9 +9,9 @@ public class Main {
     @Test
     public void test1() {
         char[][] board = {
-                {'X','.', ',', 'X'},
-                {'.','.', ',', 'X'},
-                {'.','.', ',', 'X'}
+                {'X', '.', ',', 'X'},
+                {'.', '.', ',', 'X'},
+                {'.', '.', ',', 'X'}
         };
 
         Solution solution = new Solution();
diff --git a/[0419][Battleships in a Board]/src/Solution.java b/[0419][Battleships in a Board]/src/Solution.java
index 65b0a27..0452809 100644
--- a/[0419][Battleships in a Board]/src/Solution.java	
+++ b/[0419][Battleships in a Board]/src/Solution.java	
@@ -16,11 +16,11 @@ public int countBattleships(char[][] board) {
                 if (board[i][j] == 'X') {
                     // 如果左边一个并且上面一个不是X，说明是战舰的起点
                     // 考虑边界情况
-                    if (i > 0 && j > 0 && board[i -1][j] != board[i][j] && board[i][j - 1] != board[i][j]) {
+                    if (i > 0 && j > 0 && board[i - 1][j] != board[i][j] && board[i][j - 1] != board[i][j]) {
                         result++;
-                    } else if (i > 0 && j == 0 && board[i -1][j] != board[i][j]) {
+                    } else if (i > 0 && j == 0 && board[i - 1][j] != board[i][j]) {
                         result++;
-                    } else if (i == 0 && j > 0 && board[i][j - 1] != board[i][j] ) {
+                    } else if (i == 0 && j > 0 && board[i][j - 1] != board[i][j]) {
                         result++;
                     } else if (i == 0 && j == 0) {
                         result++;
diff --git a/[0427][Construct Quad Tree]/src/Node.java b/[0427][Construct Quad Tree]/src/Node.java
index 3123e2a..6dbf8a7 100644
--- a/[0427][Construct Quad Tree]/src/Node.java	
+++ b/[0427][Construct Quad Tree]/src/Node.java	
@@ -5,10 +5,10 @@
 public class Node {
     public boolean val;
     public boolean isLeaf;
-    public Node    topLeft;
-    public Node    topRight;
-    public Node    bottomLeft;
-    public Node    bottomRight;
+    public Node topLeft;
+    public Node topRight;
+    public Node bottomLeft;
+    public Node bottomRight;
 
     public Node() {
     }
diff --git a/[0427][Construct Quad Tree]/src/Solution.java b/[0427][Construct Quad Tree]/src/Solution.java
index a46f286..7489596 100644
--- a/[0427][Construct Quad Tree]/src/Solution.java	
+++ b/[0427][Construct Quad Tree]/src/Solution.java	
@@ -38,7 +38,7 @@ private void construct(Node node, int[][] grid, int x, int y, int size) {
         construct(topLeft, grid, x, y, half);
         construct(topRight, grid, x, y + half, half);
         construct(bottomLeft, grid, x + half, y, half);
-        construct(bottomRight, grid, x+ half, y + half, half);
+        construct(bottomRight, grid, x + half, y + half, half);
 
         // 四个孩子都是叶子节点，并且值都相等
         if (topLeft.isLeaf && topRight.isLeaf && bottomLeft.isLeaf && bottomRight.isLeaf) {
diff --git a/[0429][N-ary Tree Level Order Traversal]/src/Main.java b/[0429][N-ary Tree Level Order Traversal]/src/Main.java
index aa6fc47..45d4d16 100644
--- a/[0429][N-ary Tree Level Order Traversal]/src/Main.java	
+++ b/[0429][N-ary Tree Level Order Traversal]/src/Main.java	
@@ -1,4 +1,3 @@
-import com.sun.tools.corba.se.idl.constExpr.Not;
 import org.junit.Test;
 
 import java.util.LinkedList;
diff --git a/[0429][N-ary Tree Level Order Traversal]/src/Node.java b/[0429][N-ary Tree Level Order Traversal]/src/Node.java
index 2eee60a..4a21647 100644
--- a/[0429][N-ary Tree Level Order Traversal]/src/Node.java	
+++ b/[0429][N-ary Tree Level Order Traversal]/src/Node.java	
@@ -5,7 +5,7 @@
  * @time: 2019-07-01 14:44
  **/
 public class Node {
-    public int        val;
+    public int val;
     public List<Node> children;
 
     public Node() {
diff --git a/[0434][Number of Segments in a String]/src/Solution.java b/[0434][Number of Segments in a String]/src/Solution.java
index 1bcf1ee..8fd15cf 100644
--- a/[0434][Number of Segments in a String]/src/Solution.java	
+++ b/[0434][Number of Segments in a String]/src/Solution.java	
@@ -15,6 +15,7 @@ public class Solution {
      * Input: "Hello, my name is John"
      * Output: 5
      * </pre>
+     *
      * @param s
      * @return
      */
diff --git a/[0437][Path Sum III]/src/Main.java b/[0437][Path Sum III]/src/Main.java
index bde432a..30b8b7d 100644
--- a/[0437][Path Sum III]/src/Main.java	
+++ b/[0437][Path Sum III]/src/Main.java	
@@ -13,8 +13,8 @@ public void test1() {
         root.right = new TreeNode(-3);
         root.left.left = new TreeNode(3);
         root.left.right = new TreeNode(2);
-        root.left.left.left =new TreeNode(3);
-        root.left.left.right =new TreeNode(-2);
+        root.left.left.left = new TreeNode(3);
+        root.left.left.right = new TreeNode(-2);
         root.left.right.right = new TreeNode(1);
         root.right.right = new TreeNode(11);
 
@@ -29,8 +29,8 @@ public void test2() {
         root.right = new TreeNode(-3);
         root.left.left = new TreeNode(3);
         root.left.right = new TreeNode(2);
-        root.left.left.left =new TreeNode(3);
-        root.left.left.right =new TreeNode(-2);
+        root.left.left.left = new TreeNode(3);
+        root.left.left.right = new TreeNode(-2);
         root.left.right.right = new TreeNode(1);
         root.right.right = new TreeNode(11);
 
@@ -45,8 +45,8 @@ public void test3() {
         root.right = new TreeNode(-3);
         root.left.left = new TreeNode(3);
         root.left.right = new TreeNode(2);
-        root.left.left.left =new TreeNode(3);
-        root.left.left.right =new TreeNode(-2);
+        root.left.left.left = new TreeNode(3);
+        root.left.left.right = new TreeNode(-2);
         root.left.right.right = new TreeNode(1);
         root.right.right = new TreeNode(11);
 
@@ -61,8 +61,8 @@ public void test4() {
         root.right = new TreeNode(-3);
         root.left.left = new TreeNode(3);
         root.left.right = new TreeNode(2);
-        root.left.left.left =new TreeNode(3);
-        root.left.left.right =new TreeNode(-2);
+        root.left.left.left = new TreeNode(3);
+        root.left.left.right = new TreeNode(-2);
         root.left.right.right = new TreeNode(1);
         root.right.right = new TreeNode(11);
 
diff --git a/[0437][Path Sum III]/src/TreeNode.java b/[0437][Path Sum III]/src/TreeNode.java
index a09e411..23d0f71 100644
--- a/[0437][Path Sum III]/src/TreeNode.java	
+++ b/[0437][Path Sum III]/src/TreeNode.java	
@@ -4,7 +4,7 @@
  **/
 public class TreeNode {
 
-    int      val;
+    int val;
     TreeNode left;
     TreeNode right;
 
diff --git a/[0438][Find All Anagrams in a String]/src/Solution.java b/[0438][Find All Anagrams in a String]/src/Solution.java
index 766fa5c..8e32c89 100644
--- a/[0438][Find All Anagrams in a String]/src/Solution.java	
+++ b/[0438][Find All Anagrams in a String]/src/Solution.java	
@@ -1,9 +1,6 @@
 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(王俊超)
@@ -71,7 +68,7 @@ public List<Integer> findAnagrams(String s, String p) {
                 sArr[s.charAt(i + p.length() - 1) - 'a']++;
             }
 
-            if (Arrays.equals(sArr, pArr)  ) {
+            if (Arrays.equals(sArr, pArr)) {
                 result.add(i);
             }
         }
diff --git a/[0438][Find All Anagrams in a String]/src/Solution2.java b/[0438][Find All Anagrams in a String]/src/Solution2.java
index f72d6e4..1f805b7 100644
--- a/[0438][Find All Anagrams in a String]/src/Solution2.java	
+++ b/[0438][Find All Anagrams in a String]/src/Solution2.java	
@@ -1,8 +1,4 @@
-import java.util.HashMap;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Map;
-import java.util.Objects;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
diff --git a/[0441][Arranging Coins]/src/Solution.java b/[0441][Arranging Coins]/src/Solution.java
index 13f4edd..f1c8291 100644
--- a/[0441][Arranging Coins]/src/Solution.java	
+++ b/[0441][Arranging Coins]/src/Solution.java	
@@ -1,4 +1,3 @@
-
 //You have a total of n coins that you want to form in a staircase shape, where
 //every k-th row must have exactly k coins.
 //
@@ -65,8 +64,8 @@ public int arrangeCoins(int n) {
 
         long x = (long) Math.sqrt(t);
 
-        while ( true ) {
-            if (x * x + 3*x < t) {
+        while (true) {
+            if (x * x + 3 * x < t) {
                 x++;
                 continue;
             }
diff --git a/[0441][Arranging Coins]/src/SolutionTest.java b/[0441][Arranging Coins]/src/SolutionTest.java
index 86237cf..378df37 100644
--- a/[0441][Arranging Coins]/src/SolutionTest.java	
+++ b/[0441][Arranging Coins]/src/SolutionTest.java	
@@ -28,7 +28,7 @@ public void test1() {
                 {15, 5},
         };
 
-        for(int[] d: data)  {
+        for (int[] d : data) {
             Assert.assertEquals(s.arrangeCoins(d[0]), d[1]);
         }
     }
diff --git a/[0442][Find All Duplicates in an Array]/src/Solution.java b/[0442][Find All Duplicates in an Array]/src/Solution.java
index 5582095..15e0aea 100644
--- a/[0442][Find All Duplicates in an Array]/src/Solution.java	
+++ b/[0442][Find All Duplicates in an Array]/src/Solution.java	
@@ -1,9 +1,4 @@
-import java.util.ArrayList;
-import java.util.Collections;
-import java.util.HashSet;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Set;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
@@ -19,7 +14,7 @@ public List<Integer> findDuplicates(int[] nums) {
 
         Set<Integer> set = new HashSet<>();
 
-        for(int i: nums) {
+        for (int i : nums) {
             if (set.contains(i)) {
                 result.add(i);
             } else {
diff --git a/[0442][Find All Duplicates in an Array]/src/Solution2.java b/[0442][Find All Duplicates in an Array]/src/Solution2.java
index 5616c28..3a26109 100644
--- a/[0442][Find All Duplicates in an Array]/src/Solution2.java	
+++ b/[0442][Find All Duplicates in an Array]/src/Solution2.java	
@@ -31,7 +31,7 @@ public List<Integer> findDuplicates(int[] nums) {
                 result.add(nums[i - 1]);
             }
         }
-        
+
         Collections.sort(result);
         return result;
     }
diff --git a/[0443][String Compression]/src/SolutionTest.java b/[0443][String Compression]/src/SolutionTest.java
index 86170a5..278614c 100644
--- a/[0443][String Compression]/src/SolutionTest.java	
+++ b/[0443][String Compression]/src/SolutionTest.java	
@@ -21,7 +21,7 @@ public void test1() {
 //                {"abcdefg","abcdefg", 7},
 //                {"aaab","a3b", 3},
 //                {"aaabcccc","a3bc4", 5},
-                {"aaabbbccc","a3b3c3", 6},
+                {"aaabbbccc", "a3b3c3", 6},
         };
 
         for (Object[] d : data) {
diff --git a/[0447][Number of Boomerangs]/src/Solution.java b/[0447][Number of Boomerangs]/src/Solution.java
index a8e26cd..102a1df 100644
--- a/[0447][Number of Boomerangs]/src/Solution.java	
+++ b/[0447][Number of Boomerangs]/src/Solution.java	
@@ -11,7 +11,7 @@
 public class Solution {
     public int numberOfBoomerangs(int[][] points) {
         int count = 0;
-        if (points == null || points.length < 2){
+        if (points == null || points.length < 2) {
             return count;
         }
         Map<Integer, Integer> map = new HashMap<>();
diff --git a/[0455][Assign Cookies]/src/Solution.java b/[0455][Assign Cookies]/src/Solution.java
index 9d3bcaf..58f164e 100644
--- a/[0455][Assign Cookies]/src/Solution.java	
+++ b/[0455][Assign Cookies]/src/Solution.java	
@@ -2,6 +2,7 @@
 
 /**
  * https://leetcode.com/problems/assign-cookies/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-10 08:30
  **/
@@ -41,6 +42,7 @@ public class Solution {
      * 思路：
      * 先将饼干尺寸和小孩需求都排个序，然后从小到大去遍历地给。
      * </pre>
+     *
      * @param g
      * @param s
      * @return
diff --git a/[0461][Hamming Distance]/src/Solution.java b/[0461][Hamming Distance]/src/Solution.java
index 78490f0..7204175 100644
--- a/[0461][Hamming Distance]/src/Solution.java	
+++ b/[0461][Hamming Distance]/src/Solution.java	
@@ -26,6 +26,7 @@ public class Solution {
      *
      * The above arrows point to positions where the corresponding bits are different.
      * </pre>
+     *
      * @param x
      * @param y
      * @return
diff --git a/[0463][Island Perimeter]/src/Solution2.java b/[0463][Island Perimeter]/src/Solution2.java
index 498b571..bde8363 100644
--- a/[0463][Island Perimeter]/src/Solution2.java	
+++ b/[0463][Island Perimeter]/src/Solution2.java	
@@ -29,6 +29,7 @@ public class Solution2 {
      *
      * Explanation: The perimeter is the 16 yellow stripes in the image below:
      * </pre>
+     *
      * @param grid
      * @return
      */
diff --git a/[0475][Heaters]/src/Solution.java b/[0475][Heaters]/src/Solution.java
index 39b8c0b..e353380 100644
--- a/[0475][Heaters]/src/Solution.java
+++ b/[0475][Heaters]/src/Solution.java
@@ -2,6 +2,7 @@
 
 /**
  * https://leetcode.com/problems/heaters/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-10 08:58
  **/
diff --git a/[0476][Number Complement]/src/Solution.java b/[0476][Number Complement]/src/Solution.java
index c509d85..a992057 100644
--- a/[0476][Number Complement]/src/Solution.java	
+++ b/[0476][Number Complement]/src/Solution.java	
@@ -22,6 +22,7 @@ public class Solution {
      * Explanation: The binary representation of 1 is 1 (no leading zero bits), and its
      * complement is 0. So you need to output 0.
      * </pre>
+     *
      * @param num
      * @return
      */
diff --git a/[0482][License Key Formatting]/src/Solution.java b/[0482][License Key Formatting]/src/Solution.java
index 73ec646..d9e9120 100644
--- a/[0482][License Key Formatting]/src/Solution.java	
+++ b/[0482][License Key Formatting]/src/Solution.java	
@@ -38,6 +38,7 @@ public class Solution {
      * 思路：
      * 从后向前处理，每k个分成一个组
      * </pre>
+     *
      * @param s
      * @param k
      * @return
@@ -74,6 +75,6 @@ public String licenseKeyFormatting(String s, int k) {
             return "";
         }
 
-        return  result.charAt(0) == '-' ? result.substring(1) : result;
+        return result.charAt(0) == '-' ? result.substring(1) : result;
     }
 }
diff --git a/[0492][Construct the Rectangle]/src/Solution.java b/[0492][Construct the Rectangle]/src/Solution.java
index d929935..834f7ce 100644
--- a/[0492][Construct the Rectangle]/src/Solution.java	
+++ b/[0492][Construct the Rectangle]/src/Solution.java	
@@ -28,6 +28,7 @@ public class Solution {
      * The given area won't exceed 10,000,000 and is a positive integer
      * The web page's width and length you designed must be positive integers.
      * </pre>
+     *
      * @param area
      * @return
      */
diff --git a/[0500][Keyboard Row]/src/Solution.java b/[0500][Keyboard Row]/src/Solution.java
index 39dbb1b..d0cf17b 100644
--- a/[0500][Keyboard Row]/src/Solution.java	
+++ b/[0500][Keyboard Row]/src/Solution.java	
@@ -1,9 +1,9 @@
-
 import java.util.LinkedList;
 import java.util.List;
 
 /**
  * https://leetcode.com/problems/keyboard-row/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-11 10:25
  **/
diff --git a/[0501][Find Mode in Binary Search Tree]/src/Solution.java b/[0501][Find Mode in Binary Search Tree]/src/Solution.java
index af9abc6..5b104f5 100644
--- a/[0501][Find Mode in Binary Search Tree]/src/Solution.java	
+++ b/[0501][Find Mode in Binary Search Tree]/src/Solution.java	
@@ -1,8 +1,4 @@
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Map;
-import java.util.SortedMap;
-import java.util.TreeMap;
+import java.util.*;
 
 /**
  * @author: wangjunchao(王俊超)
@@ -15,14 +11,14 @@ public int[] findMode(TreeNode root) {
         findMode(root, map);
 
         int max = 0;
-        for (int v: map.values()) {
+        for (int v : map.values()) {
             if (max < v) {
                 max = v;
             }
         }
 
         List<Integer> list = new LinkedList<>();
-        for(Map.Entry<Integer, Integer> e: map.entrySet()) {
+        for (Map.Entry<Integer, Integer> e : map.entrySet()) {
             if (e.getValue() == max) {
                 list.add(e.getKey());
             }
@@ -30,7 +26,7 @@ public int[] findMode(TreeNode root) {
 
         int[] result = new int[list.size()];
         int i = 0;
-        for (int v: list) {
+        for (int v : list) {
             result[i] = v;
             i++;
         }
diff --git a/[0501][Find Mode in Binary Search Tree]/src/TreeNode.java b/[0501][Find Mode in Binary Search Tree]/src/TreeNode.java
index 8e2131e..8b88e24 100644
--- a/[0501][Find Mode in Binary Search Tree]/src/TreeNode.java	
+++ b/[0501][Find Mode in Binary Search Tree]/src/TreeNode.java	
@@ -1,4 +1,3 @@
-
 /**
  * Author: 王俊超
  * Date: 2015-08-21
diff --git a/[0504][Base 7]/src/Solution.java b/[0504][Base 7]/src/Solution.java
index 8eba5e2..62947d6 100644
--- a/[0504][Base 7]/src/Solution.java	
+++ b/[0504][Base 7]/src/Solution.java	
@@ -15,6 +15,7 @@ public class Solution {
      * Output: "-10"
      * Note: The input will be in range of [-1e7, 1e7].
      * </pre>
+     *
      * @param num
      * @return
      */
diff --git a/[0561][Array Partition I]/src/Main.java b/[0561][Array Partition I]/src/Main.java
index 92bec11..9deca22 100644
--- a/[0561][Array Partition I]/src/Main.java	
+++ b/[0561][Array Partition I]/src/Main.java	
@@ -7,9 +7,9 @@
  **/
 public class Main {
     @Test
-    public void test1(){
+    public void test1() {
         Solution solution = new Solution();
-        int[] arr = {1,4,3,2};
+        int[] arr = {1, 4, 3, 2};
         Assert.assertEquals(4, solution.arrayPairSum(arr));
     }
 }
diff --git a/[0561][Array Partition I]/src/Solution.java b/[0561][Array Partition I]/src/Solution.java
index 4c41f06..7169b92 100644
--- a/[0561][Array Partition I]/src/Solution.java	
+++ b/[0561][Array Partition I]/src/Solution.java	
@@ -2,6 +2,7 @@
 
 /**
  * https://leetcode.com/problems/array-partition-i/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-04 08:46
  **/
@@ -25,6 +26,7 @@ public class Solution {
      * 先将数据组排序，取偶数位置的数相加，即为结果
      * 证明略
      * </pre>
+     *
      * @param nums
      * @return
      */
@@ -32,7 +34,7 @@ public int arrayPairSum(int[] nums) {
         Arrays.sort(nums);
 
         int result = 0;
-        for (int i = 0; i < nums.length; i+=2) {
+        for (int i = 0; i < nums.length; i += 2) {
             result += nums[i];
         }
 
diff --git a/[0617][Merge Two Binary Trees]/src/Main.java b/[0617][Merge Two Binary Trees]/src/Main.java
index 64abb99..f0f2e17 100644
--- a/[0617][Merge Two Binary Trees]/src/Main.java	
+++ b/[0617][Merge Two Binary Trees]/src/Main.java	
@@ -7,7 +7,7 @@
 public class Main {
     @Test
     public void test1() {
-        TreeNode t1  = new TreeNode(1);
+        TreeNode t1 = new TreeNode(1);
         t1.left = new TreeNode(3);
         t1.left.left = new TreeNode(5);
         t1.right = new TreeNode(2);
@@ -24,6 +24,7 @@ public void test1() {
 
         print(node);
     }
+
     private void print(TreeNode node) {
         if (node != null) {
             System.out.print(node.val + ", ");
diff --git a/[0617][Merge Two Binary Trees]/src/Solution.java b/[0617][Merge Two Binary Trees]/src/Solution.java
index c9aa871..3123ffe 100644
--- a/[0617][Merge Two Binary Trees]/src/Solution.java	
+++ b/[0617][Merge Two Binary Trees]/src/Solution.java	
@@ -1,4 +1,3 @@
-
 /**
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-04 08:57
diff --git a/[0617][Merge Two Binary Trees]/src/TreeNode.java b/[0617][Merge Two Binary Trees]/src/TreeNode.java
index 8e2131e..8b88e24 100644
--- a/[0617][Merge Two Binary Trees]/src/TreeNode.java	
+++ b/[0617][Merge Two Binary Trees]/src/TreeNode.java	
@@ -1,4 +1,3 @@
-
 /**
  * Author: 王俊超
  * Date: 2015-08-21
diff --git a/[0969][Pancake Sorting]/src/Solution.java b/[0969][Pancake Sorting]/src/Solution.java
index b16de77..4aafc53 100644
--- a/[0969][Pancake Sorting]/src/Solution.java	
+++ b/[0969][Pancake Sorting]/src/Solution.java	
@@ -3,6 +3,7 @@
 
 /**
  * https://leetcode.com/problems/pancake-sorting/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-09 18:29
  **/
@@ -45,6 +46,7 @@ public class Solution {
      * 完成把当前最大值放到最后的操作，即完成选择排序的选择最大值到最后的操作。
      * 缩减未排序的序列，即可完成排序；
      * </pre>
+     *
      * @param nums nums元素的值是[1, 2, ..., nums.length]的一个排列
      * @return
      */
diff --git a/[0979][Distribute Coins in Binary Tree]/src/Solution.java b/[0979][Distribute Coins in Binary Tree]/src/Solution.java
index 8819f14..fac903d 100644
--- a/[0979][Distribute Coins in Binary Tree]/src/Solution.java	
+++ b/[0979][Distribute Coins in Binary Tree]/src/Solution.java	
@@ -1,5 +1,6 @@
 /**
  * https://leetcode.com/problems/distribute-coins-in-binary-tree/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-09 18:52
  **/
@@ -17,6 +18,7 @@ public class Solution {
      *
      * https://www.cnblogs.com/seyjs/p/10369614.html
      * </pre>
+     *
      * @param root
      * @return
      */
@@ -32,6 +34,7 @@ public int distributeCoins(TreeNode root) {
 
     /**
      * 自底向上，对每一个节点，只能从父结点借，或者向父节点上交coin
+     *
      * @param node
      * @param parent
      */
diff --git a/[0979][Distribute Coins in Binary Tree]/src/TreeNode.java b/[0979][Distribute Coins in Binary Tree]/src/TreeNode.java
index 36ec099..5554849 100644
--- a/[0979][Distribute Coins in Binary Tree]/src/TreeNode.java	
+++ b/[0979][Distribute Coins in Binary Tree]/src/TreeNode.java	
@@ -3,7 +3,7 @@
  * @time: 2019-07-09 18:52
  **/
 public class TreeNode {
-    int      val;
+    int val;
     TreeNode left;
     TreeNode right;
 
diff --git a/[1089][Duplicate Zeros]/src/Solution.java b/[1089][Duplicate Zeros]/src/Solution.java
index 9975463..701084f 100644
--- a/[1089][Duplicate Zeros]/src/Solution.java	
+++ b/[1089][Duplicate Zeros]/src/Solution.java	
@@ -6,7 +6,7 @@ public class Solution {
     public void duplicateZeros(int[] arr) {
         for (int i = 0; i < arr.length - 1; i++) {
             if (arr[i] == 0) {
-                move(arr, i+1);
+                move(arr, i + 1);
                 arr[i + 1] = 0;
                 i++;
             }
diff --git a/[1108][Defanging an IP Address]/src/Solution.java b/[1108][Defanging an IP Address]/src/Solution.java
index 96d080d..8667b05 100644
--- a/[1108][Defanging an IP Address]/src/Solution.java	
+++ b/[1108][Defanging an IP Address]/src/Solution.java	
@@ -1,5 +1,6 @@
 /**
  * https://leetcode.com/problems/defanging-an-ip-address/submissions/
+ *
  * @author: wangjunchao(王俊超)
  * @time: 2019-07-12 08:31
  **/
@@ -21,11 +22,12 @@ public class Solution {
      * Input: address = "255.100.50.0"
      * Output: "255[.]100[.]50[.]0"
      * </pre>
+     *
      * @param address
      * @return
      */
     public String defangIPaddr(String address) {
-        if (address ==null || address.length() < 1) {
+        if (address == null || address.length() < 1) {
             return address;
         }
 

From 056f4b273ba9519bd92ed13e689420978a5cb309 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Mon, 29 Jun 2020 07:18:14 +0800
Subject: [PATCH 04/19] commit

Change-Id: I27c3e15333fd8ff3d48b1da2e86af88e20ea2b99
---
 .gitignore                                    |  1 +
 .idea/leetcode/editor.xml                     |  8 ++
 .idea/modules.xml                             |  1 +
 .idea/workspace.xml                           | 79 +++++++++++--------
 ...Minimum Moves to Equal Array Elements].iml | 21 +++++
 .../src/Solution.java                         | 36 +++++++++
 .../src/SolutionTest.java                     | 27 +++++++
 7 files changed, 140 insertions(+), 33 deletions(-)
 create mode 100644 [0453][Minimum Moves to Equal Array Elements]/[0453][Minimum Moves to Equal Array Elements].iml
 create mode 100644 [0453][Minimum Moves to Equal Array Elements]/src/Solution.java
 create mode 100644 [0453][Minimum Moves to Equal Array Elements]/src/SolutionTest.java

diff --git a/.gitignore b/.gitignore
index 2304249..f18f368 100644
--- a/.gitignore
+++ b/.gitignore
@@ -26,4 +26,5 @@ out
 
 # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
 hs_err_pid*
+*/*.iml
 
diff --git a/.idea/leetcode/editor.xml b/.idea/leetcode/editor.xml
index 27dc992..63b52e6 100644
--- a/.idea/leetcode/editor.xml
+++ b/.idea/leetcode/editor.xml
@@ -51,6 +51,14 @@
             </LeetcodeEditor>
           </value>
         </entry>
+        <entry key="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[453]Minimum Moves to Equal Array Elements.java">
+          <value>
+            <LeetcodeEditor>
+              <option name="path" value="/var/folders/dj/vxgzy0vj0sgcbtwppnrbyzc40000gp/T/leetcode/editor/en/[453]Minimum Moves to Equal Array Elements.java" />
+              <option name="questionId" value="453" />
+            </LeetcodeEditor>
+          </value>
+        </entry>
       </map>
     </option>
   </component>
diff --git a/.idea/modules.xml b/.idea/modules.xml
index e85fdc2..618f410 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -228,6 +228,7 @@
       <module fileurl="file://$PROJECT_DIR$/[0443][String Compression]/[0443][String Compression].iml" filepath="$PROJECT_DIR$/[0443][String Compression]/[0443][String Compression].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml" filepath="$PROJECT_DIR$/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0448][Find All Numbers Disappeared in an Array]/[0448][Find All Numbers Disappeared in an Array].iml" filepath="$PROJECT_DIR$/[0448][Find All Numbers Disappeared in an Array]/[0448][Find All Numbers Disappeared in an Array].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/[0453][Minimum Moves to Equal Array Elements].iml" filepath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/[0453][Minimum Moves to Equal Array Elements].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0455][Assign Cookies]/[0455][Assign Cookies].iml" filepath="$PROJECT_DIR$/[0455][Assign Cookies]/[0455][Assign Cookies].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0459][Repeated Substring Pattern]/[0459][Repeated Substring Pattern].iml" filepath="$PROJECT_DIR$/[0459][Repeated Substring Pattern]/[0459][Repeated Substring Pattern].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0461][Hamming Distance]/[0461][Hamming Distance].iml" filepath="$PROJECT_DIR$/[0461][Hamming Distance]/[0461][Hamming Distance].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 4d3d05d..485bf29 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,9 +2,9 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0447][Number of Boomerangs]/[0447][Number of Boomerangs].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0447][Number of Boomerangs]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0447][Number of Boomerangs]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/src/SolutionTest.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/.idea/leetcode/editor.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/leetcode/editor.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -26,6 +26,7 @@
       </list>
     </option>
   </component>
+  <component name="GOROOT" path="" />
   <component name="Git.Settings">
     <option name="RECENT_GIT_ROOT_PATH" value="$PROJECT_DIR$" />
   </component>
@@ -50,6 +51,9 @@
     <property name="WebServerToolWindowFactoryState" value="false" />
     <property name="add_unversioned_files" value="true" />
     <property name="aspect.path.notification.shown" value="true" />
+    <property name="configurable.Global.GOPATH.is.expanded" value="true" />
+    <property name="configurable.Module.GOPATH.is.expanded" value="false" />
+    <property name="configurable.Project.GOPATH.is.expanded" value="true" />
     <property name="extract.method.default.visibility" value="private" />
     <property name="go.gopath.indexing.explicitly.defined" value="true" />
     <property name="go.import.settings.migrated" value="true" />
@@ -58,7 +62,8 @@
     <property name="project.structure.last.edited" value="Modules" />
     <property name="project.structure.proportion" value="0.124843955" />
     <property name="project.structure.side.proportion" value="0.29248658" />
-    <property name="settings.editor.selected.configurable" value="fileTemplates" />
+    <property name="scala_project_settings_configurable.last_selected_tab_index" value="0" />
+    <property name="settings.editor.selected.configurable" value="preferences.pluginManager" />
   </component>
   <component name="RecentsManager">
     <key name="CreateClassDialog.RecentsKey">
@@ -72,7 +77,7 @@
       <recent name="$PROJECT_DIR$" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.test1 (3)">
+  <component name="RunManager" selected="JUnit.SolutionTest.test1 (4)">
     <configuration name="SolutionTest.test1 (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
       <module name="[0441][Arranging Coins]" />
       <option name="PACKAGE_NAME" value="" />
@@ -106,8 +111,8 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.test1" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0392][Is Subsequence]" />
+    <configuration name="SolutionTest.test1 (4)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0453][Minimum Moves to Equal Array Elements]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
@@ -117,14 +122,15 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="TestSolution.test1" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0299][Bulls and Cows]" />
+    <configuration name="SolutionTest.test1" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0392][Is Subsequence]" />
       <option name="PACKAGE_NAME" value="" />
-      <option name="MAIN_CLASS_NAME" value="TestSolution" />
+      <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
+        <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
     <configuration default="true" type="JUnit" factoryName="JUnit">
@@ -135,19 +141,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.TestSolution.test1" />
       <item itemvalue="JUnit.SolutionTest.test1" />
       <item itemvalue="JUnit.SolutionTest.test1 (1)" />
       <item itemvalue="JUnit.SolutionTest.test1 (2)" />
       <item itemvalue="JUnit.SolutionTest.test1 (3)" />
+      <item itemvalue="JUnit.SolutionTest.test1 (4)" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.test1 (4)" />
         <item itemvalue="JUnit.SolutionTest.test1 (3)" />
         <item itemvalue="JUnit.SolutionTest.test1 (2)" />
         <item itemvalue="JUnit.SolutionTest.test1 (1)" />
         <item itemvalue="JUnit.SolutionTest.test1" />
-        <item itemvalue="JUnit.TestSolution.test1" />
       </list>
     </recent_temporary>
   </component>
@@ -204,6 +210,9 @@
       <workItem from="1592905214169" duration="3698000" />
       <workItem from="1592917353315" duration="5231000" />
       <workItem from="1592990527553" duration="12346000" />
+      <workItem from="1593302168737" duration="873000" />
+      <workItem from="1593349299733" duration="565000" />
+      <workItem from="1593350828804" duration="1737000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -567,34 +576,34 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1400" height="192" key="GridCell.Tab.0.bottom" timestamp="1593262518088">
+    <state width="1400" height="242" key="GridCell.Tab.0.bottom" timestamp="1593353618522">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="192" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593262518088" />
+    <state width="1400" height="242" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593353618522" />
     <state width="1880" height="283" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1400" height="192" key="GridCell.Tab.0.center" timestamp="1593262518087">
+    <state width="1400" height="242" key="GridCell.Tab.0.center" timestamp="1593353618521">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="192" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593262518087" />
+    <state width="1400" height="242" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593353618521" />
     <state width="1880" height="283" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1400" height="192" key="GridCell.Tab.0.left" timestamp="1593262518087">
+    <state width="1400" height="242" key="GridCell.Tab.0.left" timestamp="1593353618520">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="192" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593262518087" />
+    <state width="1400" height="242" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593353618520" />
     <state width="1880" height="283" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1400" height="192" key="GridCell.Tab.0.right" timestamp="1593262518088">
+    <state width="1400" height="242" key="GridCell.Tab.0.right" timestamp="1593353618522">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="192" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593262518088" />
+    <state width="1400" height="242" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593353618522" />
     <state width="1880" height="283" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
@@ -624,17 +633,19 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1929" y="250" key="RollbackChangesDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905880584" />
-    <state x="1613" y="110" width="1062" height="722" key="SettingsEditor" timestamp="1592966837093">
-      <screen x="1440" y="23" width="1920" height="1057" />
+    <state x="129" y="74" width="900" height="722" key="SettingsEditor" timestamp="1593310819945">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
+    <state x="130" y="74" width="900" height="722" key="SettingsEditor/0.0.1440.900@0.0.1440.900" timestamp="1593306390484" />
+    <state x="129" y="74" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593310819945" />
     <state x="1939" y="179" width="1089" height="722" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592907781087" />
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593161844244">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593353510457">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593161844244" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593353510457" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905485465" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
@@ -642,17 +653,19 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="0" y="127" key="new project wizard" timestamp="1593161264383">
+    <state x="108" y="124" width="1206" height="749" key="new project wizard" timestamp="1593349370421">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="0" y="127" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593161264383" />
+    <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593349370421" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592908078144" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
-    <state x="469" y="200" key="search.everywhere.popup" timestamp="1593162973634">
+    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup" timestamp="1593351608990">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="469" y="200" key="search.everywhere.popup/0.0.1440.900@0.0.1440.900" timestamp="1593162973634" />
+    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593351608990" />
     <state x="2065" y="258" key="search.everywhere.popup/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592965788430" />
     <state x="504" y="218" key="search.everywhere.popup/52.23.1388.877@52.23.1388.877" timestamp="1593065008140" />
   </component>
@@ -778,7 +791,7 @@
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0429][N-ary Tree Level Order Traversal]/src/Main.java</url>
-          <line>38</line>
+          <line>37</line>
           <option name="timeStamp" value="70" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
@@ -828,12 +841,12 @@
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0241][Different Ways to Add Parentheses]/src/Solution.java</url>
-          <line>75</line>
+          <line>76</line>
           <option name="timeStamp" value="94" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0241][Different Ways to Add Parentheses]/src/Solution.java</url>
-          <line>69</line>
+          <line>70</line>
           <option name="timeStamp" value="95" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
@@ -844,7 +857,7 @@
         <line-breakpoint enabled="true" type="java-line">
           <condition expression="i == 3" language="JAVA" />
           <url>file://$PROJECT_DIR$/[0207][Course Schedule]/src/Solution.java</url>
-          <line>64</line>
+          <line>60</line>
           <option name="timeStamp" value="102" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
@@ -854,7 +867,7 @@
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0475][Heaters]/src/Solution.java</url>
-          <line>46</line>
+          <line>47</line>
           <option name="timeStamp" value="104" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
@@ -874,12 +887,12 @@
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0392][Is Subsequence]/src/Solution.java</url>
-          <line>66</line>
+          <line>65</line>
           <option name="timeStamp" value="109" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0441][Arranging Coins]/src/Solution.java</url>
-          <line>67</line>
+          <line>66</line>
           <option name="timeStamp" value="111" />
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
diff --git a/[0453][Minimum Moves to Equal Array Elements]/[0453][Minimum Moves to Equal Array Elements].iml b/[0453][Minimum Moves to Equal Array Elements]/[0453][Minimum Moves to Equal Array Elements].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0453][Minimum Moves to Equal Array Elements]/[0453][Minimum Moves to Equal Array Elements].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>
\ No newline at end of file
diff --git a/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java b/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java
new file mode 100644
index 0000000..a50bf0f
--- /dev/null
+++ b/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java	
@@ -0,0 +1,36 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-28 21:38
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 解题思路：
+     * 假设数组最小的值是xmin，一共加了k次，加完后的值是W，元素个数是n
+     * 则：W <= xmin + k
+     * k(n-1) + sum(nums) = W*n
+     * ==>
+     * k(n-1) + sum(nums) <= (xmin + k)n
+     * ==>
+     * sum(nums) - n*xmin <= k
+     *
+     * @param nums
+     * @return
+     */
+    public int minMoves(int[] nums) {
+
+        int sum = 0;
+        int min = Integer.MAX_VALUE;
+
+        for (int i : nums) {
+            sum += i;
+            if (i < min) {
+                min = i;
+            }
+        }
+
+        return sum - min * nums.length;
+    }
+}
diff --git a/[0453][Minimum Moves to Equal Array Elements]/src/SolutionTest.java b/[0453][Minimum Moves to Equal Array Elements]/src/SolutionTest.java
new file mode 100644
index 0000000..1b8b239
--- /dev/null
+++ b/[0453][Minimum Moves to Equal Array Elements]/src/SolutionTest.java	
@@ -0,0 +1,27 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+import java.lang.annotation.Target;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-28 22:09
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+    @Test
+    public void test1() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{1, 2, 3}, 3},
+                {new int[]{1, 1, 1}, 0},
+                {new int[]{1, 1, 2}, 1},
+        };
+
+        for (Object[] d : data) {
+            Assert.assertEquals(s.minMoves((int[]) d[0]), d[1]);
+        }
+    }
+}

From 1c7af47229b791a6b127eb96dfadb7c21ecd4bbf Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Mon, 29 Jun 2020 08:12:39 +0800
Subject: [PATCH 05/19] commit

Change-Id: If5826faa98325213bca778dc3fcf3c06035c00b6
---
 [0506][Relative Ranks]/src/Solution.java     | 11 +++++++++++
 [0506][Relative Ranks]/src/SolutionTest.java | 11 +++++++++++
 2 files changed, 22 insertions(+)
 create mode 100644 [0506][Relative Ranks]/src/Solution.java
 create mode 100644 [0506][Relative Ranks]/src/SolutionTest.java

diff --git a/[0506][Relative Ranks]/src/Solution.java b/[0506][Relative Ranks]/src/Solution.java
new file mode 100644
index 0000000..52a6ed4
--- /dev/null
+++ b/[0506][Relative Ranks]/src/Solution.java	
@@ -0,0 +1,11 @@
+package PACKAGE_NAME;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 07:34
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+}
diff --git a/[0506][Relative Ranks]/src/SolutionTest.java b/[0506][Relative Ranks]/src/SolutionTest.java
new file mode 100644
index 0000000..53129d4
--- /dev/null
+++ b/[0506][Relative Ranks]/src/SolutionTest.java	
@@ -0,0 +1,11 @@
+package PACKAGE_NAME;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 07:46
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+}

From c07b4594f01e644f3ac5cc01335b31e3947cf0f6 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Mon, 29 Jun 2020 08:29:15 +0800
Subject: [PATCH 06/19] commit

Change-Id: I08806c5b8ee5a373800efe2028bc4e00f44e755f
---
 .gitignore                                    |   1 -
 .idea/modules.xml                             |   1 +
 .idea/workspace.xml                           |  59 ++++----
 .../src/Solution.java                         |   4 +
 .../[0506][Relative Ranks].iml                |  21 +++
 [0506][Relative Ranks]/src/Solution.java      | 130 +++++++++++++++++-
 [0506][Relative Ranks]/src/SolutionTest.java  |  16 ++-
 7 files changed, 204 insertions(+), 28 deletions(-)
 create mode 100644 [0506][Relative Ranks]/[0506][Relative Ranks].iml

diff --git a/.gitignore b/.gitignore
index f18f368..2304249 100644
--- a/.gitignore
+++ b/.gitignore
@@ -26,5 +26,4 @@ out
 
 # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
 hs_err_pid*
-*/*.iml
 
diff --git a/.idea/modules.xml b/.idea/modules.xml
index 618f410..4ffbbd5 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -242,6 +242,7 @@
       <module fileurl="file://$PROJECT_DIR$/[0500][Keyboard Row]/[0500][Keyboard Row].iml" filepath="$PROJECT_DIR$/[0500][Keyboard Row]/[0500][Keyboard Row].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/[0501][Find Mode in Binary Search Tree].iml" filepath="$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/[0501][Find Mode in Binary Search Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0504][Base 7]/[0504][Base 7].iml" filepath="$PROJECT_DIR$/[0504][Base 7]/[0504][Base 7].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0506][Relative Ranks]/[0506][Relative Ranks].iml" filepath="$PROJECT_DIR$/[0506][Relative Ranks]/[0506][Relative Ranks].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0542][01 Matrix]/[0542][01 Matrix].iml" filepath="$PROJECT_DIR$/[0542][01 Matrix]/[0542][01 Matrix].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml" filepath="$PROJECT_DIR$/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0561][Array Partition I]/[0561][Array Partition I].iml" filepath="$PROJECT_DIR$/[0561][Array Partition I]/[0561][Array Partition I].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 485bf29..5249778 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,11 +2,13 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/src/SolutionTest.java" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/.idea/leetcode/editor.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/leetcode/editor.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/[0400][Nth Digit]/[0400][Nth Digit].iml" beforeDir="false" />
+      <change beforePath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java" beforeDir="false" afterPath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/[0506][Relative Ranks]/src/Solution.java" beforeDir="false" afterPath="$PROJECT_DIR$/[0506][Relative Ranks]/src/Solution.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/[0506][Relative Ranks]/src/SolutionTest.java" beforeDir="false" afterPath="$PROJECT_DIR$/[0506][Relative Ranks]/src/SolutionTest.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/leetcode.iml" beforeDir="false" />
     </list>
     <option name="SHOW_DIALOG" value="false" />
     <option name="HIGHLIGHT_CONFLICTS" value="true" />
@@ -63,7 +65,7 @@
     <property name="project.structure.proportion" value="0.124843955" />
     <property name="project.structure.side.proportion" value="0.29248658" />
     <property name="scala_project_settings_configurable.last_selected_tab_index" value="0" />
-    <property name="settings.editor.selected.configurable" value="preferences.pluginManager" />
+    <property name="settings.editor.selected.configurable" value="leetcode.id" />
   </component>
   <component name="RecentsManager">
     <key name="CreateClassDialog.RecentsKey">
@@ -77,7 +79,7 @@
       <recent name="$PROJECT_DIR$" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.test1 (4)">
+  <component name="RunManager" selected="JUnit.SolutionTest.test1 (5)">
     <configuration name="SolutionTest.test1 (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
       <module name="[0441][Arranging Coins]" />
       <option name="PACKAGE_NAME" value="" />
@@ -122,8 +124,8 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.test1" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0392][Is Subsequence]" />
+    <configuration name="SolutionTest.test1 (5)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0506][Relative Ranks]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="METHOD_NAME" value="test1" />
@@ -141,19 +143,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.test1" />
       <item itemvalue="JUnit.SolutionTest.test1 (1)" />
       <item itemvalue="JUnit.SolutionTest.test1 (2)" />
       <item itemvalue="JUnit.SolutionTest.test1 (3)" />
       <item itemvalue="JUnit.SolutionTest.test1 (4)" />
+      <item itemvalue="JUnit.SolutionTest.test1 (5)" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.test1 (5)" />
         <item itemvalue="JUnit.SolutionTest.test1 (4)" />
         <item itemvalue="JUnit.SolutionTest.test1 (3)" />
         <item itemvalue="JUnit.SolutionTest.test1 (2)" />
         <item itemvalue="JUnit.SolutionTest.test1 (1)" />
-        <item itemvalue="JUnit.SolutionTest.test1" />
       </list>
     </recent_temporary>
   </component>
@@ -213,6 +215,7 @@
       <workItem from="1593302168737" duration="873000" />
       <workItem from="1593349299733" duration="565000" />
       <workItem from="1593350828804" duration="1737000" />
+      <workItem from="1593386208975" duration="3631000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -572,38 +575,42 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog/0.0.1440.900@0.0.1440.900" timestamp="1593127395403" />
+    <state x="533" y="165" key="#com.intellij.ide.util.MemberChooser" timestamp="1593387493079">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="533" y="165" key="#com.intellij.ide.util.MemberChooser/0.0.1440.900@0.0.1440.900" timestamp="1593387493079" />
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog" timestamp="1592906253060">
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1400" height="242" key="GridCell.Tab.0.bottom" timestamp="1593353618522">
+    <state width="1400" height="242" key="GridCell.Tab.0.bottom" timestamp="1593389546969">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="242" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593353618522" />
+    <state width="1400" height="242" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593389546969" />
     <state width="1880" height="283" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1400" height="242" key="GridCell.Tab.0.center" timestamp="1593353618521">
+    <state width="1400" height="242" key="GridCell.Tab.0.center" timestamp="1593389546968">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="242" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593353618521" />
+    <state width="1400" height="242" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593389546968" />
     <state width="1880" height="283" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1400" height="242" key="GridCell.Tab.0.left" timestamp="1593353618520">
+    <state width="1400" height="242" key="GridCell.Tab.0.left" timestamp="1593389546967">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="242" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593353618520" />
+    <state width="1400" height="242" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593389546967" />
     <state width="1880" height="283" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1400" height="242" key="GridCell.Tab.0.right" timestamp="1593353618522">
+    <state width="1400" height="242" key="GridCell.Tab.0.right" timestamp="1593389546969">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="242" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593353618522" />
+    <state width="1400" height="242" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593389546969" />
     <state width="1880" height="283" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
@@ -629,23 +636,24 @@
     </state>
     <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog/0.0.1440.900@0.0.1440.900" timestamp="1593161435798" />
     <state x="328" y="211" key="IDE.errors.dialog/44.23.1396.877@44.23.1396.877" timestamp="1592952525283" />
-    <state x="1929" y="250" key="RollbackChangesDialog" timestamp="1592905880584">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state x="367" y="208" key="RollbackChangesDialog" timestamp="1593386374017">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
+    <state x="367" y="208" key="RollbackChangesDialog/0.0.1440.900@0.0.1440.900" timestamp="1593386374017" />
     <state x="1929" y="250" key="RollbackChangesDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905880584" />
-    <state x="129" y="74" width="900" height="722" key="SettingsEditor" timestamp="1593310819945">
+    <state x="130" y="74" width="900" height="722" key="SettingsEditor" timestamp="1593387219153">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="130" y="74" width="900" height="722" key="SettingsEditor/0.0.1440.900@0.0.1440.900" timestamp="1593306390484" />
+    <state x="130" y="74" width="900" height="722" key="SettingsEditor/0.0.1440.900@0.0.1440.900" timestamp="1593387219153" />
     <state x="129" y="74" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593310819945" />
     <state x="1939" y="179" width="1089" height="722" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592907781087" />
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593353510457">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593388017550">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593353510457" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593388017550" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905485465" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
@@ -653,13 +661,14 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="108" y="124" width="1206" height="749" key="new project wizard" timestamp="1593349370421">
+    <state x="0" y="127" width="1206" height="749" key="new project wizard" timestamp="1593387266312">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="0" y="127" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593161264383" />
+    <state x="0" y="127" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593387266312" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593349370421" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592908078144" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
+    <state x="108" y="144" key="new project wizard/41.23.1399.877@41.23.1399.877" timestamp="1593387189945" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
     <state x="469" y="200" width="670" height="676" key="search.everywhere.popup" timestamp="1593351608990">
       <screen x="0" y="0" width="1440" height="900" />
diff --git a/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java b/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java
index a50bf0f..395fde3 100644
--- a/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java	
+++ b/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java	
@@ -21,6 +21,10 @@ public class Solution {
      */
     public int minMoves(int[] nums) {
 
+        if (nums == null) {
+            return 0;
+        }
+
         int sum = 0;
         int min = Integer.MAX_VALUE;
 
diff --git a/[0506][Relative Ranks]/[0506][Relative Ranks].iml b/[0506][Relative Ranks]/[0506][Relative Ranks].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0506][Relative Ranks]/[0506][Relative Ranks].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>
\ No newline at end of file
diff --git a/[0506][Relative Ranks]/src/Solution.java b/[0506][Relative Ranks]/src/Solution.java
index 52a6ed4..3cc25f6 100644
--- a/[0506][Relative Ranks]/src/Solution.java	
+++ b/[0506][Relative Ranks]/src/Solution.java	
@@ -1,4 +1,4 @@
-package PACKAGE_NAME;
+import java.util.*;
 
 /**
  * Author: 王俊超
@@ -8,4 +8,132 @@
  * Declaration: All Rights Reserved !!!
  **/
 public class Solution {
+
+    class Rank {
+        Rank(int s, int i) {
+            this.Score = s;
+            this.Index = i;
+        }
+        int Score;
+        int Index;
+    }
+
+    /**
+     * 题解思路：
+     * 1、记录分数对应的下标；
+     * 2、对分数进行排序，求行排名
+     * 3、再根据分数将原始数组的下标和排名对应起来
+     *
+     * @param nums
+     * @return
+     */
+    public String[] findRelativeRanks(int[] nums) {
+        if (nums == null) {
+            return null;
+        }
+
+        Rank[] ranks = new Rank[nums.length];
+        for (int i = 0; i < nums.length; i++) {
+            ranks[i] = new Rank(nums[i], i);
+        }
+
+        Arrays.sort(ranks, new Comparator<Rank>() {
+            @Override
+            public int compare(Rank o1, Rank o2) {
+                return -(o1.Score - o2.Score);
+            }
+        });
+
+        String[] result = new String[nums.length];
+        for (int i = 0; i < ranks.length; i++) {
+            switch (i) {
+                case 0:
+                    result[ranks[i].Index] = "Gold Medal";
+                    break;
+                case 1:
+                    result[ranks[i].Index] = "Silver Medal";
+                    break;
+
+                case 2:
+                    result[ranks[i].Index] = "Bronze Medal";
+                    break;
+                default:
+                    result[ranks[i].Index] = "" + (i + 1);
+            }
+        }
+        return result;
+    }
+
+    public String[] findRelativeRanks3(int[] nums) {
+        if (nums == null) {
+            return null;
+        }
+
+        Map<Integer, Integer> map = new HashMap<>();
+        Queue<Integer> queue = new PriorityQueue<>(nums.length + 1); // 使用优先堆，加1是为了防止参数为0
+
+        for (int i = 0; i < nums.length; i++) {
+            map.put(nums[i], i);
+            queue.add(nums[i]); // 创建小顶堆
+        }
+
+
+        String[] result = new String[nums.length];
+        int i = nums.length + 1;
+        while (!queue.isEmpty()) {
+            int score = queue.poll();
+            i--;
+            switch (i) {
+                case 1:
+                    result[map.get(score)] = "Gold Medal";
+                    break;
+                case 2:
+                    result[map.get(score)] = "Silver Medal";
+                    break;
+                case 3:
+                    result[map.get(score)] = "Bronze Medal";
+                    break;
+                default:
+                    result[map.get(score)] = "" + i;
+            }
+
+        }
+
+        return result;
+    }
+
+    public String[] findRelativeRanks2(int[] nums) {
+        if (nums == null) {
+            return null;
+        }
+
+        Map<Integer, Integer> map = new HashMap<>();
+
+        for (int i = 0; i < nums.length; i++) {
+            map.put(nums[i], i);
+        }
+
+        String[] result = new String[nums.length];
+        Arrays.sort(nums);
+
+        for (int i = 0; i < nums.length; i++) {
+            int score = nums[nums.length - 1 - i];
+            switch (i) {
+                case 0:
+                    result[map.get(score)] = "Gold Medal";
+                    break;
+                case 1:
+                    result[map.get(score)] = "Silver Medal";
+                    break;
+
+                case 2:
+                    result[map.get(score)] = "Bronze Medal";
+                    break;
+                default:
+                    result[map.get(score)] = "" + (i + 1);
+            }
+        }
+
+        return result;
+    }
 }
diff --git a/[0506][Relative Ranks]/src/SolutionTest.java b/[0506][Relative Ranks]/src/SolutionTest.java
index 53129d4..6af869f 100644
--- a/[0506][Relative Ranks]/src/SolutionTest.java	
+++ b/[0506][Relative Ranks]/src/SolutionTest.java	
@@ -1,4 +1,5 @@
-package PACKAGE_NAME;
+import org.junit.Assert;
+import org.junit.Test;
 
 /**
  * Author: 王俊超
@@ -8,4 +9,17 @@
  * Declaration: All Rights Reserved !!!
  **/
 public class SolutionTest {
+
+    @Test
+    public void test1() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{5, 4, 3, 2, 1}, new String[]{"Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"}},
+                {new int[]{1, 2, 3, 4, 5}, new String[]{"5", "4", "Bronze Medal", "Silver Medal", "Gold Medal"}},
+        };
+
+        for (Object[] d: data) {
+            Assert.assertArrayEquals(s.findRelativeRanks((int[]) d[0]), (Object[]) d[1]);
+        }
+    }
 }

From d0747cc1dafb5c72068c0be687a4b1f8068ccb3f Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Tue, 30 Jun 2020 09:32:30 +0800
Subject: [PATCH 07/19] commit

Change-Id: I063540e070f881de78b6f278119ce7a7e05f8e75
---
 .idea/modules.xml                             |   6 +
 .idea/workspace.xml                           | 256 ++++++++----------
 .../[0507][Perfect Number].iml                |  21 ++
 [0507][Perfect Number]/src/Solution.java      |  26 ++
 [0507][Perfect Number]/src/SolutionTest.java  |  29 ++
 .../[0509][Fibonacci Number].iml              |  21 ++
 [0509][Fibonacci Number]/src/Solution.java    |  27 ++
 .../src/SolutionTest.java                     |  26 ++
 .../[0520][Detect Capital].iml                |  11 +
 [0520][Detect Capital]/src/Solution.java      |  73 +++++
 ...[0521][Longest Uncommon Subsequence I].iml |  11 +
 .../src/Solution.java                         |  20 ++
 .../[0523][K Diff Pairs In An Array].iml      |  21 ++
 .../src/Solution.java                         |  40 +++
 .../src/SolutionTest.java                     |  27 ++
 ...0][Minimum Absolute Difference in BST].iml |  21 ++
 .../src/Solution.java                         |  93 +++++++
 .../src/SolutionTest.java                     |  35 +++
 .../src/TreeNode.java                         |  16 ++
 19 files changed, 644 insertions(+), 136 deletions(-)
 create mode 100644 [0507][Perfect Number]/[0507][Perfect Number].iml
 create mode 100644 [0507][Perfect Number]/src/Solution.java
 create mode 100644 [0507][Perfect Number]/src/SolutionTest.java
 create mode 100644 [0509][Fibonacci Number]/[0509][Fibonacci Number].iml
 create mode 100644 [0509][Fibonacci Number]/src/Solution.java
 create mode 100644 [0509][Fibonacci Number]/src/SolutionTest.java
 create mode 100644 [0520][Detect Capital]/[0520][Detect Capital].iml
 create mode 100644 [0520][Detect Capital]/src/Solution.java
 create mode 100644 [0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml
 create mode 100644 [0521][Longest Uncommon Subsequence I]/src/Solution.java
 create mode 100644 [0523][K Diff Pairs In An Array]/[0523][K Diff Pairs In An Array].iml
 create mode 100644 [0523][K Diff Pairs In An Array]/src/Solution.java
 create mode 100644 [0523][K Diff Pairs In An Array]/src/SolutionTest.java
 create mode 100644 [0530][Minimum Absolute Difference in BST]/[0530][Minimum Absolute Difference in BST].iml
 create mode 100644 [0530][Minimum Absolute Difference in BST]/src/Solution.java
 create mode 100644 [0530][Minimum Absolute Difference in BST]/src/SolutionTest.java
 create mode 100644 [0530][Minimum Absolute Difference in BST]/src/TreeNode.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index 4ffbbd5..63e77e6 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -243,6 +243,12 @@
       <module fileurl="file://$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/[0501][Find Mode in Binary Search Tree].iml" filepath="$PROJECT_DIR$/[0501][Find Mode in Binary Search Tree]/[0501][Find Mode in Binary Search Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0504][Base 7]/[0504][Base 7].iml" filepath="$PROJECT_DIR$/[0504][Base 7]/[0504][Base 7].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0506][Relative Ranks]/[0506][Relative Ranks].iml" filepath="$PROJECT_DIR$/[0506][Relative Ranks]/[0506][Relative Ranks].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0507][Perfect Number]/[0507][Perfect Number].iml" filepath="$PROJECT_DIR$/[0507][Perfect Number]/[0507][Perfect Number].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0509][Fibonacci Number]/[0509][Fibonacci Number].iml" filepath="$PROJECT_DIR$/[0509][Fibonacci Number]/[0509][Fibonacci Number].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0520][Detect Capital]/[0520][Detect Capital].iml" filepath="$PROJECT_DIR$/[0520][Detect Capital]/[0520][Detect Capital].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml" filepath="$PROJECT_DIR$/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/[0523][K Diff Pairs In An Array].iml" filepath="$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/[0523][K Diff Pairs In An Array].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/[0530][Minimum Absolute Difference in BST].iml" filepath="$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/[0530][Minimum Absolute Difference in BST].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0542][01 Matrix]/[0542][01 Matrix].iml" filepath="$PROJECT_DIR$/[0542][01 Matrix]/[0542][01 Matrix].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml" filepath="$PROJECT_DIR$/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0561][Array Partition I]/[0561][Array Partition I].iml" filepath="$PROJECT_DIR$/[0561][Array Partition I]/[0561][Array Partition I].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 5249778..01614ce 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,13 +2,23 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
+      <change afterPath="$PROJECT_DIR$/[0507][Perfect Number]/[0507][Perfect Number].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0507][Perfect Number]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0507][Perfect Number]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0509][Fibonacci Number]/[0509][Fibonacci Number].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0509][Fibonacci Number]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0509][Fibonacci Number]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0520][Detect Capital]/[0520][Detect Capital].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0520][Detect Capital]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0521][Longest Uncommon Subsequence I]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/src/TreeNode.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/[0400][Nth Digit]/[0400][Nth Digit].iml" beforeDir="false" />
-      <change beforePath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java" beforeDir="false" afterPath="$PROJECT_DIR$/[0453][Minimum Moves to Equal Array Elements]/src/Solution.java" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/[0506][Relative Ranks]/src/Solution.java" beforeDir="false" afterPath="$PROJECT_DIR$/[0506][Relative Ranks]/src/Solution.java" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/[0506][Relative Ranks]/src/SolutionTest.java" beforeDir="false" afterPath="$PROJECT_DIR$/[0506][Relative Ranks]/src/SolutionTest.java" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/leetcode.iml" beforeDir="false" />
     </list>
     <option name="SHOW_DIALOG" value="false" />
     <option name="HIGHLIGHT_CONFLICTS" value="true" />
@@ -25,6 +35,7 @@
     <option name="RECENT_TEMPLATES">
       <list>
         <option value="Class" />
+        <option value="JUnit4 Test Class" />
       </list>
     </option>
   </component>
@@ -53,9 +64,12 @@
     <property name="WebServerToolWindowFactoryState" value="false" />
     <property name="add_unversioned_files" value="true" />
     <property name="aspect.path.notification.shown" value="true" />
+    <property name="com.intellij.testIntegration.createTest.CreateTestDialog.defaultLibrary" value="JUnit4" />
+    <property name="com.intellij.testIntegration.createTest.CreateTestDialog.defaultLibrarySuperClass.JUnit4" value="" />
     <property name="configurable.Global.GOPATH.is.expanded" value="true" />
     <property name="configurable.Module.GOPATH.is.expanded" value="false" />
     <property name="configurable.Project.GOPATH.is.expanded" value="true" />
+    <property name="create.test.in.the.same.root" value="true" />
     <property name="extract.method.default.visibility" value="private" />
     <property name="go.gopath.indexing.explicitly.defined" value="true" />
     <property name="go.import.settings.migrated" value="true" />
@@ -68,67 +82,73 @@
     <property name="settings.editor.selected.configurable" value="leetcode.id" />
   </component>
   <component name="RecentsManager">
+    <key name="CreateTestDialog.RecentsKey">
+      <recent name="" />
+    </key>
     <key name="CreateClassDialog.RecentsKey">
       <recent name="" />
     </key>
     <key name="CopyClassDialog.RECENTS_KEY">
       <recent name="" />
     </key>
+    <key name="CreateTestDialog.Recents.Supers">
+      <recent name="" />
+    </key>
     <key name="MoveFile.RECENT_KEYS">
       <recent name="$PROJECT_DIR$/[0463][Island Perimeter]/src" />
       <recent name="$PROJECT_DIR$" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.test1 (5)">
-    <configuration name="SolutionTest.test1 (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0441][Arranging Coins]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.findPairs">
+    <configuration name="SolutionTest.checkPerfectNumber" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0507][Perfect Number]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="test1" />
+      <option name="METHOD_NAME" value="checkPerfectNumber" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.test1 (2)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0443][String Compression]" />
+    <configuration name="SolutionTest.fib" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0509][Fibonacci Number]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="test1" />
+      <option name="METHOD_NAME" value="fib" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.test1 (3)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0447][Number of Boomerangs]" />
+    <configuration name="SolutionTest.findPairs" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0523][K Diff Pairs In An Array]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="test1" />
+      <option name="METHOD_NAME" value="findPairs" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.test1 (4)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0453][Minimum Moves to Equal Array Elements]" />
+    <configuration name="SolutionTest.getMinimumDifference" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0530][Minimum Absolute Difference in BST]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="test1" />
+      <option name="METHOD_NAME" value="getMinimumDifference" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.test1 (5)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0506][Relative Ranks]" />
+    <configuration name="SolutionTest.getMinimumDifference2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0530][Minimum Absolute Difference in BST]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="test1" />
+      <option name="METHOD_NAME" value="getMinimumDifference2" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -143,19 +163,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.test1 (1)" />
-      <item itemvalue="JUnit.SolutionTest.test1 (2)" />
-      <item itemvalue="JUnit.SolutionTest.test1 (3)" />
-      <item itemvalue="JUnit.SolutionTest.test1 (4)" />
-      <item itemvalue="JUnit.SolutionTest.test1 (5)" />
+      <item itemvalue="JUnit.SolutionTest.checkPerfectNumber" />
+      <item itemvalue="JUnit.SolutionTest.fib" />
+      <item itemvalue="JUnit.SolutionTest.getMinimumDifference" />
+      <item itemvalue="JUnit.SolutionTest.getMinimumDifference2" />
+      <item itemvalue="JUnit.SolutionTest.findPairs" />
     </list>
     <recent_temporary>
       <list>
-        <item itemvalue="JUnit.SolutionTest.test1 (5)" />
-        <item itemvalue="JUnit.SolutionTest.test1 (4)" />
-        <item itemvalue="JUnit.SolutionTest.test1 (3)" />
-        <item itemvalue="JUnit.SolutionTest.test1 (2)" />
-        <item itemvalue="JUnit.SolutionTest.test1 (1)" />
+        <item itemvalue="JUnit.SolutionTest.findPairs" />
+        <item itemvalue="JUnit.SolutionTest.getMinimumDifference2" />
+        <item itemvalue="JUnit.SolutionTest.getMinimumDifference" />
+        <item itemvalue="JUnit.SolutionTest.fib" />
+        <item itemvalue="JUnit.SolutionTest.checkPerfectNumber" />
       </list>
     </recent_temporary>
   </component>
@@ -215,7 +235,8 @@
       <workItem from="1593302168737" duration="873000" />
       <workItem from="1593349299733" duration="565000" />
       <workItem from="1593350828804" duration="1737000" />
-      <workItem from="1593386208975" duration="3631000" />
+      <workItem from="1593386208975" duration="9188000" />
+      <workItem from="1593474505742" duration="2995000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -571,10 +592,14 @@
     <option name="LAST_COMMIT_MESSAGE" value="commit" />
   </component>
   <component name="WindowStateProjectService">
-    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog" timestamp="1593127395403">
+    <state x="208" y="31" key="#Project_Structure" timestamp="1593390815779">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog/0.0.1440.900@0.0.1440.900" timestamp="1593127395403" />
+    <state x="208" y="31" key="#Project_Structure/0.0.1440.900@0.0.1440.900" timestamp="1593390815779" />
+    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog" timestamp="1593391139304">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog/0.0.1440.900@0.0.1440.900" timestamp="1593391139304" />
     <state x="533" y="165" key="#com.intellij.ide.util.MemberChooser" timestamp="1593387493079">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
@@ -583,54 +608,74 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1400" height="242" key="GridCell.Tab.0.bottom" timestamp="1593389546969">
+    <state width="1400" height="438" key="GridCell.Tab.0.bottom" timestamp="1593479332237">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="242" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593389546969" />
+    <state width="1400" height="438" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593479332237" />
+    <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
     <state width="1880" height="283" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008024" />
+    <state width="1400" height="251" key="GridCell.Tab.0.bottom/41.23.1399.877@41.23.1399.877" timestamp="1593478824923" />
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1400" height="242" key="GridCell.Tab.0.center" timestamp="1593389546968">
+    <state width="1400" height="438" key="GridCell.Tab.0.center" timestamp="1593479332236">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="242" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593389546968" />
+    <state width="1400" height="438" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593479332236" />
+    <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
     <state width="1880" height="283" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1400" height="273" key="GridCell.Tab.0.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
+    <state width="1400" height="251" key="GridCell.Tab.0.center/41.23.1399.877@41.23.1399.877" timestamp="1593478824921" />
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1400" height="242" key="GridCell.Tab.0.left" timestamp="1593389546967">
+    <state width="1400" height="438" key="GridCell.Tab.0.left" timestamp="1593479332235">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="242" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593389546967" />
+    <state width="1400" height="438" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593479332235" />
+    <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
     <state width="1880" height="283" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1400" height="273" key="GridCell.Tab.0.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008022" />
+    <state width="1400" height="251" key="GridCell.Tab.0.left/41.23.1399.877@41.23.1399.877" timestamp="1593478824920" />
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1400" height="242" key="GridCell.Tab.0.right" timestamp="1593389546969">
+    <state width="1400" height="438" key="GridCell.Tab.0.right" timestamp="1593479332237">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="242" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593389546969" />
+    <state width="1400" height="438" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593479332237" />
+    <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
     <state width="1880" height="283" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1400" height="273" key="GridCell.Tab.0.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
+    <state width="1400" height="251" key="GridCell.Tab.0.right/41.23.1399.877@41.23.1399.877" timestamp="1593478824922" />
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1400" height="192" key="GridCell.Tab.1.bottom" timestamp="1593262518090">
+    <state width="1400" height="438" key="GridCell.Tab.1.bottom" timestamp="1593479332460">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="192" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593262518090" />
-    <state width="1400" height="192" key="GridCell.Tab.1.center" timestamp="1593262518089">
+    <state width="1400" height="438" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593479332460" />
+    <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
+    <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
+    <state width="1400" height="438" key="GridCell.Tab.1.center" timestamp="1593479332459">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="192" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593262518089" />
-    <state width="1400" height="192" key="GridCell.Tab.1.left" timestamp="1593262518088">
+    <state width="1400" height="438" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593479332459" />
+    <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
+    <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
+    <state width="1400" height="438" key="GridCell.Tab.1.left" timestamp="1593479332459">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="192" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593262518088" />
-    <state width="1400" height="192" key="GridCell.Tab.1.right" timestamp="1593262518090">
+    <state width="1400" height="438" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593479332459" />
+    <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
+    <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
+    <state width="1400" height="438" key="GridCell.Tab.1.right" timestamp="1593479332460">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="192" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593262518090" />
+    <state width="1400" height="438" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593479332460" />
+    <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
+    <state width="1400" height="273" key="GridCell.Tab.1.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
     <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog" timestamp="1593161435798">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
@@ -641,39 +686,45 @@
     </state>
     <state x="367" y="208" key="RollbackChangesDialog/0.0.1440.900@0.0.1440.900" timestamp="1593386374017" />
     <state x="1929" y="250" key="RollbackChangesDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905880584" />
-    <state x="130" y="74" width="900" height="722" key="SettingsEditor" timestamp="1593387219153">
+    <state x="130" y="74" width="900" height="722" key="SettingsEditor" timestamp="1593478258888">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="130" y="74" width="900" height="722" key="SettingsEditor/0.0.1440.900@0.0.1440.900" timestamp="1593387219153" />
+    <state x="130" y="74" width="900" height="722" key="SettingsEditor/0.0.1440.900@0.0.1440.900" timestamp="1593478258888" />
     <state x="129" y="74" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593310819945" />
     <state x="1939" y="179" width="1089" height="722" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592907781087" />
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593388017550">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593478581632">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593388017550" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593478581632" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905485465" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593478577912">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593478577912" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
     <state x="402" y="49" width="636" height="801" key="find.popup" timestamp="1593262516580">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="0" y="127" width="1206" height="749" key="new project wizard" timestamp="1593387266312">
+    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593478326861">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="0" y="127" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593387266312" />
-    <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593349370421" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593478326861" />
+    <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592908078144" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="108" y="144" key="new project wizard/41.23.1399.877@41.23.1399.877" timestamp="1593387189945" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
-    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup" timestamp="1593351608990">
+    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup" timestamp="1593478444079">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="469" y="200" key="search.everywhere.popup/0.0.1440.900@0.0.1440.900" timestamp="1593162973634" />
+    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup/0.0.1440.900@0.0.1440.900" timestamp="1593478444079" />
     <state x="469" y="200" width="670" height="676" key="search.everywhere.popup/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593351608990" />
     <state x="2065" y="258" key="search.everywhere.popup/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592965788430" />
     <state x="504" y="218" key="search.everywhere.popup/52.23.1388.877@52.23.1388.877" timestamp="1593065008140" />
@@ -919,6 +970,16 @@
           <line>65</line>
           <option name="timeStamp" value="120" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0507][Perfect Number]/src/Solution.java</url>
+          <line>13</line>
+          <option name="timeStamp" value="121" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/src/Solution.java</url>
+          <line>19</line>
+          <option name="timeStamp" value="124" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
@@ -1024,81 +1085,4 @@
       </expression>
     </expressions>
   </component>
-  <component name="masterDetails">
-    <states>
-      <state key="ArtifactsStructureConfigurable.UI">
-        <settings>
-          <artifact-editor />
-          <splitter-proportions>
-            <option name="proportions">
-              <list>
-                <option value="0.2" />
-              </list>
-            </option>
-          </splitter-proportions>
-        </settings>
-      </state>
-      <state key="FacetStructureConfigurable.UI">
-        <settings>
-          <last-edited>No facets are configured</last-edited>
-          <splitter-proportions>
-            <option name="proportions">
-              <list>
-                <option value="0.2" />
-              </list>
-            </option>
-          </splitter-proportions>
-        </settings>
-      </state>
-      <state key="GlobalLibrariesConfigurable.UI">
-        <settings>
-          <last-edited>Bundled Protobuf Distribution</last-edited>
-          <splitter-proportions>
-            <option name="proportions">
-              <list>
-                <option value="0.29248658" />
-              </list>
-            </option>
-          </splitter-proportions>
-        </settings>
-      </state>
-      <state key="JdkListConfigurable.UI">
-        <settings>
-          <last-edited>1.7</last-edited>
-          <splitter-proportions>
-            <option name="proportions">
-              <list>
-                <option value="0.29248658" />
-              </list>
-            </option>
-          </splitter-proportions>
-        </settings>
-      </state>
-      <state key="ModuleStructureConfigurable.UI">
-        <settings>
-          <last-edited>[0419][Battleships in a Board]</last-edited>
-          <splitter-proportions>
-            <option name="proportions">
-              <list>
-                <option value="0.29248658" />
-                <option value="0.6" />
-              </list>
-            </option>
-          </splitter-proportions>
-        </settings>
-      </state>
-      <state key="ProjectLibrariesConfigurable.UI">
-        <settings>
-          <last-edited>R User Library</last-edited>
-          <splitter-proportions>
-            <option name="proportions">
-              <list>
-                <option value="0.14285713" />
-              </list>
-            </option>
-          </splitter-proportions>
-        </settings>
-      </state>
-    </states>
-  </component>
 </project>
\ No newline at end of file
diff --git a/[0507][Perfect Number]/[0507][Perfect Number].iml b/[0507][Perfect Number]/[0507][Perfect Number].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0507][Perfect Number]/[0507][Perfect Number].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>
\ No newline at end of file
diff --git a/[0507][Perfect Number]/src/Solution.java b/[0507][Perfect Number]/src/Solution.java
new file mode 100644
index 0000000..036581e
--- /dev/null
+++ b/[0507][Perfect Number]/src/Solution.java	
@@ -0,0 +1,26 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 08:33
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public boolean checkPerfectNumber(int num) {
+        if (num < 6) {
+            return false;
+        }
+
+        int sum = 1;
+        int sqrt = (int) Math.sqrt(num);
+
+        for (int i = 2; i <= sqrt; i++) {
+            if (num % i == 0) {
+                sum += i;
+                sum += num / i;
+            }
+        }
+
+        return sum == num;
+    }
+}
diff --git a/[0507][Perfect Number]/src/SolutionTest.java b/[0507][Perfect Number]/src/SolutionTest.java
new file mode 100644
index 0000000..287f91d
--- /dev/null
+++ b/[0507][Perfect Number]/src/SolutionTest.java	
@@ -0,0 +1,29 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 08:36
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void checkPerfectNumber() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {28, true},
+                {-1, false},
+                {0, false},
+                {1, false},
+                {6, true},
+                {7, false},
+                {8, false},
+        };
+
+        for (Object[] d: data) {
+            Assert.assertEquals(s.checkPerfectNumber((Integer) d[0]), d[1]);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0509][Fibonacci Number]/[0509][Fibonacci Number].iml b/[0509][Fibonacci Number]/[0509][Fibonacci Number].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0509][Fibonacci Number]/[0509][Fibonacci Number].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>
\ No newline at end of file
diff --git a/[0509][Fibonacci Number]/src/Solution.java b/[0509][Fibonacci Number]/src/Solution.java
new file mode 100644
index 0000000..4e5fa95
--- /dev/null
+++ b/[0509][Fibonacci Number]/src/Solution.java	
@@ -0,0 +1,27 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 08:44
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public int fib(int N) {
+        if (N <= 0) {
+            return 0;
+        } else if (N == 1) {
+            return 1;
+        }
+
+        int n2 = 0;
+        int n1 = 1;
+        int n0;
+        for (int i = 2; i <= N; i++) {
+            n0 = n1 + n2;
+            n2 = n1;
+            n1 = n0;
+        }
+
+        return n1;
+    }
+}
diff --git a/[0509][Fibonacci Number]/src/SolutionTest.java b/[0509][Fibonacci Number]/src/SolutionTest.java
new file mode 100644
index 0000000..c959dd8
--- /dev/null
+++ b/[0509][Fibonacci Number]/src/SolutionTest.java	
@@ -0,0 +1,26 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 08:48
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void fib() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {0, 0},
+                {1, 1},
+                {2, 1},
+                {3, 2},
+        };
+
+        for (Object[] d : data) {
+            Assert.assertEquals(s.fib((Integer) d[0]), d[1]);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0520][Detect Capital]/[0520][Detect Capital].iml b/[0520][Detect Capital]/[0520][Detect Capital].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0520][Detect Capital]/[0520][Detect Capital].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>
\ No newline at end of file
diff --git a/[0520][Detect Capital]/src/Solution.java b/[0520][Detect Capital]/src/Solution.java
new file mode 100644
index 0000000..c8c6c13
--- /dev/null
+++ b/[0520][Detect Capital]/src/Solution.java	
@@ -0,0 +1,73 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 08:42
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * <pre>
+     * Given a word, you need to judge whether the usage of capitals in it is right or not.
+     *
+     * We define the usage of capitals in a word to be right when one of the following
+     * cases holds:
+     *
+     * All letters in this word are capitals, like "USA".
+     * All letters in this word are not capitals, like "leetcode".
+     * Only the first letter in this word is capital, like "Google".
+     * Otherwise, we define that this word doesn't use capitals in a right way.
+     *
+     *
+     * Example 1:
+     *
+     * Input: "USA"
+     * Output: True
+     *
+     *
+     * Example 2:
+     *
+     * Input: "FlaG"
+     * Output: False
+     *
+     *
+     * Note: The input will be a non-empty word consisting of uppercase
+     * and lowercase latin letters.
+     * </pre>
+     *
+     * @param word
+     * @return
+     */
+    public boolean detectCapitalUse(String word) {
+
+        if (Character.isUpperCase(word.charAt(0))) {
+            return isAllUpperCase(word.substring(1)) || isAllLowerCase(word.substring(1));
+        } else if (Character.isLowerCase(word.charAt(0))) {
+            return isAllLowerCase(word.substring(1));
+        }
+
+        return false;
+    }
+
+    private boolean isAllLowerCase(String s) {
+        for (int i = 0; i < s.length(); i++) {
+            if (!Character.isLowerCase(s.charAt(i))) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    private boolean isAllUpperCase(String s) {
+
+        for (int i = 0; i < s.length(); i++) {
+            if (!Character.isUpperCase(s.charAt(i))) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+}
+
diff --git a/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml b/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].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>
\ No newline at end of file
diff --git a/[0521][Longest Uncommon Subsequence I]/src/Solution.java b/[0521][Longest Uncommon Subsequence I]/src/Solution.java
new file mode 100644
index 0000000..7f99841
--- /dev/null
+++ b/[0521][Longest Uncommon Subsequence I]/src/Solution.java	
@@ -0,0 +1,20 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 08:55
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * @param a
+     * @param b
+     * @return
+     */
+    public int findLUSlength(String a, String b) {
+        if (a.equals(b)) {
+            return -1;
+        }
+        return Math.max(a.length(), b.length());
+    }
+}
diff --git a/[0523][K Diff Pairs In An Array]/[0523][K Diff Pairs In An Array].iml b/[0523][K Diff Pairs In An Array]/[0523][K Diff Pairs In An Array].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0523][K Diff Pairs In An Array]/[0523][K Diff Pairs In An Array].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>
\ No newline at end of file
diff --git a/[0523][K Diff Pairs In An Array]/src/Solution.java b/[0523][K Diff Pairs In An Array]/src/Solution.java
new file mode 100644
index 0000000..c461f31
--- /dev/null
+++ b/[0523][K Diff Pairs In An Array]/src/Solution.java	
@@ -0,0 +1,40 @@
+import java.util.Arrays;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-30 08:52
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public int findPairs(int[] nums, int k) {
+        if (nums == null || nums.length < 2 || k < 0) {
+            return 0;
+        }
+
+        int result = 0;
+
+        Arrays.sort(nums);
+
+        for (int i = 0; i < nums.length - 1;i++) {
+
+            for (int j = i + 1; j < nums.length && nums[j] - nums[i] <= k; j++) {
+                while (j + 1 < nums.length && nums[j] == nums[j + 1]) {
+                    j++;
+                }
+
+                if (nums[j] - nums[i] == k) {
+                    result++;
+                }
+            }
+
+            while (i + 1 < nums.length && nums[i] == nums[i + 1]) {
+                i++;
+            }
+
+        }
+
+        return result;
+    }
+}
diff --git a/[0523][K Diff Pairs In An Array]/src/SolutionTest.java b/[0523][K Diff Pairs In An Array]/src/SolutionTest.java
new file mode 100644
index 0000000..2e368fa
--- /dev/null
+++ b/[0523][K Diff Pairs In An Array]/src/SolutionTest.java	
@@ -0,0 +1,27 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-30 08:56
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findPairs() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{3, 1, 4, 1, 5}, 2, 2},
+                {new int[]{1, 2, 3, 4, 5}, 1, 4},
+                {new int[]{1, 3, 1, 5, 4}, 0, 1},
+                {new int[]{1, 1, 1, 1, 1}, 0, 1},
+                {new int[]{1, 1, 2, 2, 1}, 0, 2},
+        };
+
+        for (Object[] d: data) {
+            Assert.assertEquals(d[2], s.findPairs((int[]) d[0], (Integer) d[1]));
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0530][Minimum Absolute Difference in BST]/[0530][Minimum Absolute Difference in BST].iml b/[0530][Minimum Absolute Difference in BST]/[0530][Minimum Absolute Difference in BST].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0530][Minimum Absolute Difference in BST]/[0530][Minimum Absolute Difference in BST].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>
\ No newline at end of file
diff --git a/[0530][Minimum Absolute Difference in BST]/src/Solution.java b/[0530][Minimum Absolute Difference in BST]/src/Solution.java
new file mode 100644
index 0000000..f42a167
--- /dev/null
+++ b/[0530][Minimum Absolute Difference in BST]/src/Solution.java	
@@ -0,0 +1,93 @@
+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();
+
+            System.out.println(root.val);
+            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/[0530][Minimum Absolute Difference in BST]/src/SolutionTest.java b/[0530][Minimum Absolute Difference in BST]/src/SolutionTest.java
new file mode 100644
index 0000000..b0523af
--- /dev/null
+++ b/[0530][Minimum Absolute Difference in BST]/src/SolutionTest.java	
@@ -0,0 +1,35 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-06-29 11:33
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void getMinimumDifference() {
+        TreeNode root = new TreeNode(1);
+        root.right = new TreeNode(3);
+        root.right.left = new TreeNode(2);
+
+        Solution s = new Solution();
+        Assert.assertEquals(s.getMinimumDifference(root), 1);
+    }
+
+//    [236,104,701,null,227,null,911]
+
+    @org.junit.Test
+    public void getMinimumDifference2() {
+        TreeNode root = new TreeNode(236);
+        root.left = new TreeNode(104);
+        root.left.right = new TreeNode(227);
+        root.right = new TreeNode(701);
+        root.right.right = new TreeNode(911);
+
+        Solution s = new Solution();
+        Assert.assertEquals(s.getMinimumDifference(root), 9);
+    }
+}
\ No newline at end of file
diff --git a/[0530][Minimum Absolute Difference in BST]/src/TreeNode.java b/[0530][Minimum Absolute Difference in BST]/src/TreeNode.java
new file mode 100644
index 0000000..bff99a6
--- /dev/null
+++ b/[0530][Minimum Absolute Difference in BST]/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;
+    }
+}

From bd6427277a8867557ed4ed7466ce829ddc36aa3c Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Tue, 30 Jun 2020 09:34:18 +0800
Subject: [PATCH 08/19] commit

Change-Id: I885727ba0041e8de9560dce207138f93d16bbd3f
---
 .idea/workspace.xml                           | 38 +++++++++----------
 .../src/Solution.java                         |  1 -
 2 files changed, 19 insertions(+), 20 deletions(-)

diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 01614ce..3323cba 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -236,7 +236,7 @@
       <workItem from="1593349299733" duration="565000" />
       <workItem from="1593350828804" duration="1737000" />
       <workItem from="1593386208975" duration="9188000" />
-      <workItem from="1593474505742" duration="2995000" />
+      <workItem from="1593474505742" duration="3427000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -608,10 +608,10 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1400" height="438" key="GridCell.Tab.0.bottom" timestamp="1593479332237">
+    <state width="1400" height="235" key="GridCell.Tab.0.bottom" timestamp="1593480732558">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593479332237" />
+    <state width="1400" height="235" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593480732558" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
     <state width="1880" height="283" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008024" />
@@ -619,10 +619,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1400" height="438" key="GridCell.Tab.0.center" timestamp="1593479332236">
+    <state width="1400" height="235" key="GridCell.Tab.0.center" timestamp="1593480732557">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593479332236" />
+    <state width="1400" height="235" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593480732557" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
     <state width="1880" height="283" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
@@ -630,10 +630,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1400" height="438" key="GridCell.Tab.0.left" timestamp="1593479332235">
+    <state width="1400" height="235" key="GridCell.Tab.0.left" timestamp="1593480732557">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593479332235" />
+    <state width="1400" height="235" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593480732556" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
     <state width="1880" height="283" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008022" />
@@ -641,10 +641,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1400" height="438" key="GridCell.Tab.0.right" timestamp="1593479332237">
+    <state width="1400" height="235" key="GridCell.Tab.0.right" timestamp="1593480732558">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593479332237" />
+    <state width="1400" height="235" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593480732558" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
     <state width="1880" height="283" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
@@ -652,28 +652,28 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1400" height="438" key="GridCell.Tab.1.bottom" timestamp="1593479332460">
+    <state width="1400" height="438" key="GridCell.Tab.1.bottom" timestamp="1593479607163">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593479332460" />
+    <state width="1400" height="438" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593479607163" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1400" height="438" key="GridCell.Tab.1.center" timestamp="1593479332459">
+    <state width="1400" height="438" key="GridCell.Tab.1.center" timestamp="1593479607162">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593479332459" />
+    <state width="1400" height="438" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593479607162" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1400" height="438" key="GridCell.Tab.1.left" timestamp="1593479332459">
+    <state width="1400" height="438" key="GridCell.Tab.1.left" timestamp="1593479607161">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593479332459" />
+    <state width="1400" height="438" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593479607161" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1400" height="438" key="GridCell.Tab.1.right" timestamp="1593479332460">
+    <state width="1400" height="438" key="GridCell.Tab.1.right" timestamp="1593479607162">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593479332460" />
+    <state width="1400" height="438" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593479607162" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
     <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog" timestamp="1593161435798">
@@ -721,10 +721,10 @@
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="108" y="144" key="new project wizard/41.23.1399.877@41.23.1399.877" timestamp="1593387189945" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
-    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup" timestamp="1593478444079">
+    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup" timestamp="1593479622928">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup/0.0.1440.900@0.0.1440.900" timestamp="1593478444079" />
+    <state x="469" y="200" width="670" height="676" key="search.everywhere.popup/0.0.1440.900@0.0.1440.900" timestamp="1593479622928" />
     <state x="469" y="200" width="670" height="676" key="search.everywhere.popup/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593351608990" />
     <state x="2065" y="258" key="search.everywhere.popup/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592965788430" />
     <state x="504" y="218" key="search.everywhere.popup/52.23.1388.877@52.23.1388.877" timestamp="1593065008140" />
diff --git a/[0530][Minimum Absolute Difference in BST]/src/Solution.java b/[0530][Minimum Absolute Difference in BST]/src/Solution.java
index f42a167..603e965 100644
--- a/[0530][Minimum Absolute Difference in BST]/src/Solution.java	
+++ b/[0530][Minimum Absolute Difference in BST]/src/Solution.java	
@@ -35,7 +35,6 @@ public int getMinimumDifference(TreeNode root) {
             }
             root = s.pop();
 
-            System.out.println(root.val);
             if (first) {
                 first = false;
             } else {

From 743227aeddd5b23d9fca340d96e8ddd812f20871 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Wed, 1 Jul 2020 09:25:28 +0800
Subject: [PATCH 09/19] commit

Change-Id: Id41004d654d277ea27da6318cb54af6f85131431
---
 .../[0538][Convert BST to Greater Tree].iml   | 21 +++++
 .../src/Solution.java                         | 11 +++
 .../src/SolutionTest.java                     | 12 +++
 .../src/TreeNode.java                         | 16 ++++
 .../[0541][Reverse String II].iml             | 11 +++
 [0541][Reverse String II]/src/Solution.java   | 11 +++
 .../src/SolutionTest.java                     | 12 +++
 .../[0543][Diameter of Binary Tree].iml       | 11 +++
 .../src/Solution.java                         | 11 +++
 .../src/SolutionTest.java                     | 12 +++
 .../src/TreeNode.java                         | 16 ++++
 ...3][Minimum Distance Between BST Nodes].iml | 11 +++
 .../src/Solution.java                         | 92 +++++++++++++++++++
 .../src/TreeNode.java                         | 16 ++++
 14 files changed, 263 insertions(+)
 create mode 100644 [0538][Convert BST to Greater Tree]/[0538][Convert BST to Greater Tree].iml
 create mode 100644 [0538][Convert BST to Greater Tree]/src/Solution.java
 create mode 100644 [0538][Convert BST to Greater Tree]/src/SolutionTest.java
 create mode 100644 [0538][Convert BST to Greater Tree]/src/TreeNode.java
 create mode 100644 [0541][Reverse String II]/[0541][Reverse String II].iml
 create mode 100644 [0541][Reverse String II]/src/Solution.java
 create mode 100644 [0541][Reverse String II]/src/SolutionTest.java
 create mode 100644 [0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml
 create mode 100644 [0543][Diameter of Binary Tree]/src/Solution.java
 create mode 100644 [0543][Diameter of Binary Tree]/src/SolutionTest.java
 create mode 100644 [0543][Diameter of Binary Tree]/src/TreeNode.java
 create mode 100644 [0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml
 create mode 100644 [0783][Minimum Distance Between BST Nodes]/src/Solution.java
 create mode 100644 [0783][Minimum Distance Between BST Nodes]/src/TreeNode.java

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
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ 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>
\ No newline at end of file
diff --git a/[0538][Convert BST to Greater Tree]/src/Solution.java b/[0538][Convert BST to Greater Tree]/src/Solution.java
new file mode 100644
index 0000000..53423a6
--- /dev/null
+++ 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
new file mode 100644
index 0000000..de98b6a
--- /dev/null
+++ 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 {
+
+}
\ No newline at end of file
diff --git a/[0538][Convert BST to Greater Tree]/src/TreeNode.java b/[0538][Convert BST to Greater Tree]/src/TreeNode.java
new file mode 100644
index 0000000..bff99a6
--- /dev/null
+++ 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
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ 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>
\ No newline at end of file
diff --git a/[0541][Reverse String II]/src/Solution.java b/[0541][Reverse String II]/src/Solution.java
new file mode 100644
index 0000000..1742f1b
--- /dev/null
+++ 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
new file mode 100644
index 0000000..ae1b6bd
--- /dev/null
+++ 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 {
+
+}
\ No newline at end of file
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
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ 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>
\ No newline at end of file
diff --git a/[0543][Diameter of Binary Tree]/src/Solution.java b/[0543][Diameter of Binary Tree]/src/Solution.java
new file mode 100644
index 0000000..d7b5537
--- /dev/null
+++ 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
new file mode 100644
index 0000000..8229f78
--- /dev/null
+++ 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 {
+
+}
\ No newline at end of file
diff --git a/[0543][Diameter of Binary Tree]/src/TreeNode.java b/[0543][Diameter of Binary Tree]/src/TreeNode.java
new file mode 100644
index 0000000..bff99a6
--- /dev/null
+++ 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
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ 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>
\ No newline at end of file
diff --git a/[0783][Minimum Distance Between BST Nodes]/src/Solution.java b/[0783][Minimum Distance Between BST Nodes]/src/Solution.java
new file mode 100644
index 0000000..603e965
--- /dev/null
+++ 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
new file mode 100644
index 0000000..bff99a6
--- /dev/null
+++ 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;
+    }
+}

From 4683e2914ab0e9562670ce4e554e07424bc83141 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Wed, 1 Jul 2020 09:25:55 +0800
Subject: [PATCH 10/19] commit

Change-Id: I5b2163cca9a6ff8b4a7e72d91dab154f747dd7bd
---
 .idea/modules.xml                             |   4 +
 .idea/workspace.xml                           | 143 ++++++++++--------
 .../src/Solution.java                         |  43 +++++-
 .../src/SolutionTest.java                     |  27 ++++
 .../[0541][Reverse String II].iml             |  10 ++
 [0541][Reverse String II]/src/Solution.java   |  25 ++-
 .../src/SolutionTest.java                     |  14 +-
 .../[0543][Diameter of Binary Tree].iml       |  10 ++
 .../src/Solution.java                         |  52 ++++++-
 .../src/SolutionTest.java                     |  13 ++
 .../src/Solution.java                         |  44 +-----
 11 files changed, 272 insertions(+), 113 deletions(-)

diff --git a/.idea/modules.xml b/.idea/modules.xml
index 63e77e6..24f3230 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -249,10 +249,14 @@
       <module fileurl="file://$PROJECT_DIR$/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml" filepath="$PROJECT_DIR$/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/[0523][K Diff Pairs In An Array].iml" filepath="$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/[0523][K Diff Pairs In An Array].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/[0530][Minimum Absolute Difference in BST].iml" filepath="$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/[0530][Minimum Absolute Difference in BST].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/[0538][Convert BST to Greater Tree].iml" filepath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/[0538][Convert BST to Greater Tree].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0541][Reverse String II]/[0541][Reverse String II].iml" filepath="$PROJECT_DIR$/[0541][Reverse String II]/[0541][Reverse String II].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0542][01 Matrix]/[0542][01 Matrix].iml" filepath="$PROJECT_DIR$/[0542][01 Matrix]/[0542][01 Matrix].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml" filepath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml" filepath="$PROJECT_DIR$/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0561][Array Partition I]/[0561][Array Partition I].iml" filepath="$PROJECT_DIR$/[0561][Array Partition I]/[0561][Array Partition I].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" filepath="$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" filepath="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[1089][Duplicate Zeros]/[1089][Duplicate Zeros].iml" filepath="$PROJECT_DIR$/[1089][Duplicate Zeros]/[1089][Duplicate Zeros].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 3323cba..eb7ed93 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,21 +2,20 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0507][Perfect Number]/[0507][Perfect Number].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0507][Perfect Number]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0507][Perfect Number]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0509][Fibonacci Number]/[0509][Fibonacci Number].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0509][Fibonacci Number]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0509][Fibonacci Number]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0520][Detect Capital]/[0520][Detect Capital].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0520][Detect Capital]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0521][Longest Uncommon Subsequence I]/[0521][Longest Uncommon Subsequence I].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0521][Longest Uncommon Subsequence I]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0523][K Diff Pairs In An Array]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0530][Minimum Absolute Difference in BST]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/[0538][Convert BST to Greater Tree].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0541][Reverse String II]/[0541][Reverse String II].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0541][Reverse String II]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0541][Reverse String II]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/src/TreeNode.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -99,23 +98,23 @@
       <recent name="$PROJECT_DIR$" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.findPairs">
-    <configuration name="SolutionTest.checkPerfectNumber" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0507][Perfect Number]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.diameterOfBinaryTree">
+    <configuration name="SolutionTest.convertBST" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0538][Convert BST to Greater Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="checkPerfectNumber" />
+      <option name="METHOD_NAME" value="convertBST" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.fib" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0509][Fibonacci Number]" />
+    <configuration name="SolutionTest.diameterOfBinaryTree" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0543][Diameter of Binary Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="fib" />
+      <option name="METHOD_NAME" value="diameterOfBinaryTree" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -133,22 +132,22 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.getMinimumDifference" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+    <configuration name="SolutionTest.getMinimumDifference2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
       <module name="[0530][Minimum Absolute Difference in BST]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="getMinimumDifference" />
+      <option name="METHOD_NAME" value="getMinimumDifference2" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.getMinimumDifference2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0530][Minimum Absolute Difference in BST]" />
+    <configuration name="SolutionTest.reverseStr" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0541][Reverse String II]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="getMinimumDifference2" />
+      <option name="METHOD_NAME" value="reverseStr" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -163,19 +162,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.checkPerfectNumber" />
-      <item itemvalue="JUnit.SolutionTest.fib" />
-      <item itemvalue="JUnit.SolutionTest.getMinimumDifference" />
       <item itemvalue="JUnit.SolutionTest.getMinimumDifference2" />
       <item itemvalue="JUnit.SolutionTest.findPairs" />
+      <item itemvalue="JUnit.SolutionTest.convertBST" />
+      <item itemvalue="JUnit.SolutionTest.reverseStr" />
+      <item itemvalue="JUnit.SolutionTest.diameterOfBinaryTree" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.diameterOfBinaryTree" />
+        <item itemvalue="JUnit.SolutionTest.reverseStr" />
+        <item itemvalue="JUnit.SolutionTest.convertBST" />
         <item itemvalue="JUnit.SolutionTest.findPairs" />
         <item itemvalue="JUnit.SolutionTest.getMinimumDifference2" />
-        <item itemvalue="JUnit.SolutionTest.getMinimumDifference" />
-        <item itemvalue="JUnit.SolutionTest.fib" />
-        <item itemvalue="JUnit.SolutionTest.checkPerfectNumber" />
       </list>
     </recent_temporary>
   </component>
@@ -236,7 +235,10 @@
       <workItem from="1593349299733" duration="565000" />
       <workItem from="1593350828804" duration="1737000" />
       <workItem from="1593386208975" duration="9188000" />
-      <workItem from="1593474505742" duration="3427000" />
+      <workItem from="1593474505742" duration="5061000" />
+      <workItem from="1593492568375" duration="770000" />
+      <workItem from="1593564530445" duration="24000" />
+      <workItem from="1593564572043" duration="1968000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -608,73 +610,85 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1400" height="235" key="GridCell.Tab.0.bottom" timestamp="1593480732558">
+    <state width="1397" height="369" key="GridCell.Tab.0.bottom" timestamp="1593566336646">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="235" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593480732558" />
+    <state width="1397" height="369" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593566336646" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
-    <state width="1880" height="283" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108980" />
+    <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682468" />
+    <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081570" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008024" />
     <state width="1400" height="251" key="GridCell.Tab.0.bottom/41.23.1399.877@41.23.1399.877" timestamp="1593478824923" />
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1400" height="235" key="GridCell.Tab.0.center" timestamp="1593480732557">
+    <state width="1397" height="369" key="GridCell.Tab.0.center" timestamp="1593566336645">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="235" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593480732557" />
+    <state width="1397" height="369" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593566336645" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
-    <state width="1880" height="283" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1880" height="293" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108978" />
+    <state width="1880" height="293" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682467" />
+    <state width="1880" height="293" key="GridCell.Tab.0.center/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081523" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
     <state width="1400" height="251" key="GridCell.Tab.0.center/41.23.1399.877@41.23.1399.877" timestamp="1593478824921" />
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1400" height="235" key="GridCell.Tab.0.left" timestamp="1593480732557">
+    <state width="1397" height="369" key="GridCell.Tab.0.left" timestamp="1593566336644">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="235" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593480732556" />
+    <state width="1397" height="369" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593566336644" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
-    <state width="1880" height="283" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1880" height="293" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108977" />
+    <state width="1880" height="293" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682466" />
+    <state width="1880" height="293" key="GridCell.Tab.0.left/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081511" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008022" />
     <state width="1400" height="251" key="GridCell.Tab.0.left/41.23.1399.877@41.23.1399.877" timestamp="1593478824920" />
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1400" height="235" key="GridCell.Tab.0.right" timestamp="1593480732558">
+    <state width="1397" height="369" key="GridCell.Tab.0.right" timestamp="1593566336646">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="235" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593480732558" />
+    <state width="1397" height="369" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593566336646" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
-    <state width="1880" height="283" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592967893816" />
+    <state width="1880" height="293" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108979" />
+    <state width="1880" height="293" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682468" />
+    <state width="1880" height="293" key="GridCell.Tab.0.right/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081565" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
     <state width="1400" height="251" key="GridCell.Tab.0.right/41.23.1399.877@41.23.1399.877" timestamp="1593478824922" />
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1400" height="438" key="GridCell.Tab.1.bottom" timestamp="1593479607163">
+    <state width="1397" height="369" key="GridCell.Tab.1.bottom" timestamp="1593566336553">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593479607163" />
+    <state width="1397" height="369" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593566336553" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
+    <state width="1400" height="438" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682568" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1400" height="438" key="GridCell.Tab.1.center" timestamp="1593479607162">
+    <state width="1397" height="369" key="GridCell.Tab.1.center" timestamp="1593566336552">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593479607162" />
+    <state width="1397" height="369" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593566336552" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
+    <state width="1400" height="438" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682565" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1400" height="438" key="GridCell.Tab.1.left" timestamp="1593479607161">
+    <state width="1397" height="369" key="GridCell.Tab.1.left" timestamp="1593566336551">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593479607161" />
+    <state width="1397" height="369" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593566336551" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
+    <state width="1400" height="438" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682563" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1400" height="438" key="GridCell.Tab.1.right" timestamp="1593479607162">
+    <state width="1397" height="369" key="GridCell.Tab.1.right" timestamp="1593566336552">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1400" height="438" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593479607162" />
+    <state width="1397" height="369" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593566336552" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
+    <state width="1400" height="438" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682566" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
     <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog" timestamp="1593161435798">
       <screen x="0" y="0" width="1440" height="900" />
@@ -686,38 +700,39 @@
     </state>
     <state x="367" y="208" key="RollbackChangesDialog/0.0.1440.900@0.0.1440.900" timestamp="1593386374017" />
     <state x="1929" y="250" key="RollbackChangesDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905880584" />
-    <state x="130" y="74" width="900" height="722" key="SettingsEditor" timestamp="1593478258888">
+    <state x="130" y="74" width="1184" height="722" key="SettingsEditor" timestamp="1593564606813">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="130" y="74" width="900" height="722" key="SettingsEditor/0.0.1440.900@0.0.1440.900" timestamp="1593478258888" />
+    <state x="130" y="74" width="1184" height="722" key="SettingsEditor/0.0.1440.900@0.0.1440.900" timestamp="1593564606813" />
     <state x="129" y="74" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593310819945" />
     <state x="1939" y="179" width="1089" height="722" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592907781087" />
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593478581632">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593565072194">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593478581632" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593565072193" />
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
-    <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905485465" />
+    <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492899262" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593478577912">
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593565067674">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593478577912" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593565067674" />
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
+    <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492895688" />
     <state x="402" y="49" width="636" height="801" key="find.popup" timestamp="1593262516580">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593478326861">
+    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593564755950">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593478326861" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593564755950" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
-    <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592908078144" />
+    <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492613592" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="108" y="144" key="new project wizard/41.23.1399.877@41.23.1399.877" timestamp="1593387189945" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
diff --git a/[0538][Convert BST to Greater Tree]/src/Solution.java b/[0538][Convert BST to Greater Tree]/src/Solution.java
index 53423a6..0e52f13 100644
--- a/[0538][Convert BST to Greater Tree]/src/Solution.java	
+++ b/[0538][Convert BST to Greater Tree]/src/Solution.java	
@@ -1,4 +1,5 @@
-package PACKAGE_NAME;
+import java.util.Deque;
+import java.util.LinkedList;
 
 /**
  * Author: 王俊超
@@ -8,4 +9,44 @@
  * Declaration: All Rights Reserved !!!
  **/
 public class Solution {
+    /**
+     * 解题思路
+     * root提个二叉搜索树
+     * 二叉查找树（Binary Search Tree），（又：二叉搜索树，二叉排序树）它或者是一棵空树，或者是具有下列性质的二叉树：
+     * 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值；
+     * 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值；
+     * 它的左、右子树也分别为二叉排序树。
+     * 先处理右子树，再处理自己，再处理左子树
+     *
+     * @param root
+     * @return
+     */
+    public TreeNode convertBST(TreeNode root) {
+
+        if (root == null) {
+            return null;
+        }
+        Deque<TreeNode> s = new LinkedList<>();
+        TreeNode prev = null;
+        TreeNode curr = root;
+
+        while (curr != null || !s.isEmpty()) {
+            while (curr != null) {
+                s.push(curr);//先访问再入栈
+                curr = curr.right;
+            }
+            curr = s.pop();
+
+            if (prev == null) {
+                prev = curr;
+            } else {
+                curr.val += prev.val;
+            }
+
+            prev = curr;
+            curr = curr.left;//如果是null，出栈并处理左子树
+        }
+
+        return root;
+    }
 }
diff --git a/[0538][Convert BST to Greater Tree]/src/SolutionTest.java b/[0538][Convert BST to Greater Tree]/src/SolutionTest.java
index de98b6a..5b181bf 100644
--- a/[0538][Convert BST to Greater Tree]/src/SolutionTest.java	
+++ b/[0538][Convert BST to Greater Tree]/src/SolutionTest.java	
@@ -9,4 +9,31 @@
  **/
 public class SolutionTest {
 
+    @org.junit.Test
+    public void convertBST() {
+        Solution s = new Solution();
+
+        TreeNode root = new TreeNode(4);
+        root.left = new TreeNode(2);
+        root.left.left = new TreeNode(1);
+        root.left.right = new TreeNode(3);
+        root.right =new TreeNode(6);
+        root.right.left = new TreeNode(5);
+        root.right.right = new TreeNode(7);
+
+        s.convertBST(root);
+
+        print(root);
+    }
+
+    private void print(TreeNode root) {
+        if (root == null) {
+            return;
+        }
+
+        print(root.left);
+        System.out.println(root.val);
+        print(root.right);
+
+    }
 }
\ No newline at end of file
diff --git a/[0541][Reverse String II]/[0541][Reverse String II].iml b/[0541][Reverse String II]/[0541][Reverse String II].iml
index c90834f..c70cbf1 100644
--- a/[0541][Reverse String II]/[0541][Reverse String II].iml	
+++ b/[0541][Reverse String II]/[0541][Reverse String II].iml	
@@ -7,5 +7,15 @@
     </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>
\ No newline at end of file
diff --git a/[0541][Reverse String II]/src/Solution.java b/[0541][Reverse String II]/src/Solution.java
index 1742f1b..df9a379 100644
--- a/[0541][Reverse String II]/src/Solution.java	
+++ b/[0541][Reverse String II]/src/Solution.java	
@@ -1,5 +1,3 @@
-package PACKAGE_NAME;
-
 /**
  * Author: 王俊超
  * Time: 2020-06-30 12:50
@@ -8,4 +6,27 @@
  * Declaration: All Rights Reserved !!!
  **/
 public class Solution {
+    public String reverseStr(String s, int k) {
+        if (s == null || s.length() < 2 || k < 1) {
+            return s;
+        }
+        char[] chars = s.toCharArray();
+        int index = 0;
+        while (index < chars.length) {
+            swap(chars, index, Math.min(chars.length - 1, index + k - 1));
+            index += 2 * k;
+        }
+
+        return new String(chars);
+    }
+
+    public void swap(char[] chars, int i, int j) {
+        while (i < j) {
+            char ch = chars[i];
+            chars[i] = chars[j];
+            chars[j] = ch;
+            i++;
+            j--;
+        }
+    }
 }
diff --git a/[0541][Reverse String II]/src/SolutionTest.java b/[0541][Reverse String II]/src/SolutionTest.java
index ae1b6bd..373a1d1 100644
--- a/[0541][Reverse String II]/src/SolutionTest.java	
+++ b/[0541][Reverse String II]/src/SolutionTest.java	
@@ -1,4 +1,4 @@
-import static org.junit.Assert.*;
+import org.junit.Assert;
 
 /**
  * Author: 王俊超
@@ -9,4 +9,16 @@
  **/
 public class SolutionTest {
 
+    @org.junit.Test
+    public void reverseStr() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {"abcdefg", 2, "bacdfeg"},
+                {"abcdefgh", 2, "bacdfegh"},
+        };
+
+        for (Object[] d : data) {
+            Assert.assertEquals(d[2], s.reverseStr((String) d[0], (Integer) d[1]));
+        }
+    }
 }
\ No newline at end of file
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
index c90834f..c70cbf1 100644
--- a/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml	
+++ b/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml	
@@ -7,5 +7,15 @@
     </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>
\ No newline at end of file
diff --git a/[0543][Diameter of Binary Tree]/src/Solution.java b/[0543][Diameter of Binary Tree]/src/Solution.java
index d7b5537..5bca04a 100644
--- a/[0543][Diameter of Binary Tree]/src/Solution.java	
+++ b/[0543][Diameter of Binary Tree]/src/Solution.java	
@@ -1,5 +1,3 @@
-package PACKAGE_NAME;
-
 /**
  * Author: 王俊超
  * Time: 2020-07-01 08:53
@@ -8,4 +6,54 @@
  * Declaration: All Rights Reserved !!!
  **/
 public class Solution {
+    public int diameterOfBinaryTree(TreeNode root) {
+        return layerAndDiameter(root)[1];
+    }
+
+    /**
+     * 解题思路：
+     * 最大直径的三种情况：
+     * 1、在左子树中
+     * 2、在右子树中
+     * 3、对过root节点，如果经过root节点，那么直径就是 Height(root.left) + Height(root.right) + 2
+     * 对每个节点都是同样的。所以可以使用递归求解，先求左右子树的高度和最大直径，再求通过root的高度和直径，再找出最大的直径
+     *
+     *
+     * 第一个反回参数表示root最大有多少层，
+     * 第二个返回参数表示root的最大直径
+     *
+     * @param root
+     * @return
+     */
+    public int[] layerAndDiameter(TreeNode root) {
+        if (root == null) { // 边界条件
+            return new int[]{0, 0};
+        }
+
+        if (root.left == null && root.right == null) { // 边界条件
+            return new int[]{0, 0};
+        } else if (root.left != null && root.right == null) {
+            int[] result = layerAndDiameter(root.left);
+            result[0] += 1; // 层升高1
+            result[1] = Math.max(result[0], result[1]); // 因为没有右子树，最大直径要么经过root，要么不经过
+
+            return result;
+        } else if (root.left == null && root.right != null) {
+            int[] result = layerAndDiameter(root.right);
+            result[0] += 1; // 层升高1
+            result[1] = Math.max(result[0], result[1]); // 因为没有左子树，最大直径要么经过root，要么不经过
+            return result;
+        }
+
+        int[] left = layerAndDiameter(root.left);
+        int[] right = layerAndDiameter(root.right);
+
+        int[] result = {0, 0};
+        result[0] = 1 + Math.max(left[0], right[0]); // 层升高1
+
+        result[1] = Math.max(left[1], right[1]); // 最大直径可能在左子树或者右子树中
+        result[1] = Math.max(result[1], 2 + left[0] + right[0]); // 最大直径可能经过root
+
+        return result;
+    }
 }
diff --git a/[0543][Diameter of Binary Tree]/src/SolutionTest.java b/[0543][Diameter of Binary Tree]/src/SolutionTest.java
index 8229f78..c3cab02 100644
--- a/[0543][Diameter of Binary Tree]/src/SolutionTest.java	
+++ b/[0543][Diameter of Binary Tree]/src/SolutionTest.java	
@@ -1,3 +1,5 @@
+import org.junit.Assert;
+
 import static org.junit.Assert.*;
 
 /**
@@ -9,4 +11,15 @@
  **/
 public class SolutionTest {
 
+    @org.junit.Test
+    public void diameterOfBinaryTree() {
+        Solution s = new Solution();
+        TreeNode root = new TreeNode(1);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(3);
+        root.left.left = new TreeNode(4);
+        root.left.right = new TreeNode(5);
+
+        Assert.assertEquals(3, s.diameterOfBinaryTree(root));
+    }
 }
\ No newline at end of file
diff --git a/[0783][Minimum Distance Between BST Nodes]/src/Solution.java b/[0783][Minimum Distance Between BST Nodes]/src/Solution.java
index 603e965..0230f1b 100644
--- a/[0783][Minimum Distance Between BST Nodes]/src/Solution.java	
+++ b/[0783][Minimum Distance Between BST Nodes]/src/Solution.java	
@@ -19,8 +19,7 @@ public class Solution {
      * @param root
      * @return
      */
-    public int getMinimumDifference(TreeNode root) {
-
+    public int minDiffInBST(TreeNode root) {
         if (root == null) {
             return 0;
         }
@@ -48,45 +47,4 @@ public int getMinimumDifference(TreeNode root) {
         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;
-    }
 }

From 468285f92051304ea750522b2c5790a034ba35d5 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Thu, 2 Jul 2020 09:23:52 +0800
Subject: [PATCH 11/19] commit

Change-Id: Iab81390de180fb722126be2d4520939693d4c78a
---
 .idea/modules.xml                             |   5 +
 .idea/workspace.xml                           | 264 +++++++-----------
 .../[0551][Student Attendance Record I].iml   |  21 ++
 .../src/Solution.java                         |  41 +++
 .../src/SolutionTest.java                     |  27 ++
 .../[0559][Maximum Depth of N-ary Tree].iml   |  21 ++
 .../src/Node.java                             |  25 ++
 .../src/Solution.java                         |  27 ++
 .../src/SolutionTest.java                     |  31 ++
 .../[0563][Binary Tree Tilt].iml              |  21 ++
 [0563][Binary Tree Tilt]/src/Solution.java    |  47 ++++
 .../src/SolutionTest.java                     |  22 ++
 [0563][Binary Tree Tilt]/src/TreeNode.java    |  16 ++
 .../[0566][Reshape the Matrix].iml            |  21 ++
 [0566][Reshape the Matrix]/src/Solution.java  |  29 ++
 .../src/SolutionTest.java                     |  32 +++
 .../[0572][Subtree of Another Tree].iml       |  21 ++
 .../src/Solution.java                         |  56 ++++
 .../src/SolutionTest.java                     |  46 +++
 .../src/TreeNode.java                         |  22 ++
 20 files changed, 637 insertions(+), 158 deletions(-)
 create mode 100644 [0551][Student Attendance Record I]/[0551][Student Attendance Record I].iml
 create mode 100644 [0551][Student Attendance Record I]/src/Solution.java
 create mode 100644 [0551][Student Attendance Record I]/src/SolutionTest.java
 create mode 100644 [0559][Maximum Depth of N-ary Tree]/[0559][Maximum Depth of N-ary Tree].iml
 create mode 100644 [0559][Maximum Depth of N-ary Tree]/src/Node.java
 create mode 100644 [0559][Maximum Depth of N-ary Tree]/src/Solution.java
 create mode 100644 [0559][Maximum Depth of N-ary Tree]/src/SolutionTest.java
 create mode 100644 [0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml
 create mode 100644 [0563][Binary Tree Tilt]/src/Solution.java
 create mode 100644 [0563][Binary Tree Tilt]/src/SolutionTest.java
 create mode 100644 [0563][Binary Tree Tilt]/src/TreeNode.java
 create mode 100644 [0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml
 create mode 100644 [0566][Reshape the Matrix]/src/Solution.java
 create mode 100644 [0566][Reshape the Matrix]/src/SolutionTest.java
 create mode 100644 [0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml
 create mode 100644 [0572][Subtree of Another Tree]/src/Solution.java
 create mode 100644 [0572][Subtree of Another Tree]/src/SolutionTest.java
 create mode 100644 [0572][Subtree of Another Tree]/src/TreeNode.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index 24f3230..c99a8c1 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -253,8 +253,13 @@
       <module fileurl="file://$PROJECT_DIR$/[0541][Reverse String II]/[0541][Reverse String II].iml" filepath="$PROJECT_DIR$/[0541][Reverse String II]/[0541][Reverse String II].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0542][01 Matrix]/[0542][01 Matrix].iml" filepath="$PROJECT_DIR$/[0542][01 Matrix]/[0542][01 Matrix].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml" filepath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0551][Student Attendance Record I]/[0551][Student Attendance Record I].iml" filepath="$PROJECT_DIR$/[0551][Student Attendance Record I]/[0551][Student Attendance Record I].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml" filepath="$PROJECT_DIR$/[0557][Reverse Words in a String III]/[0557][Reverse Words in a String III].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/[0559][Maximum Depth of N-ary Tree].iml" filepath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/[0559][Maximum Depth of N-ary Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0561][Array Partition I]/[0561][Array Partition I].iml" filepath="$PROJECT_DIR$/[0561][Array Partition I]/[0561][Array Partition I].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml" filepath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml" filepath="$PROJECT_DIR$/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml" filepath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" filepath="$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index eb7ed93..1aca74a 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,20 +2,24 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/[0538][Convert BST to Greater Tree].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0538][Convert BST to Greater Tree]/src/TreeNode.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0541][Reverse String II]/[0541][Reverse String II].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0541][Reverse String II]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0541][Reverse String II]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/[0543][Diameter of Binary Tree].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0543][Diameter of Binary Tree]/src/TreeNode.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0551][Student Attendance Record I]/[0551][Student Attendance Record I].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0551][Student Attendance Record I]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0551][Student Attendance Record I]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/[0559][Maximum Depth of N-ary Tree].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/src/Node.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0566][Reshape the Matrix]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0566][Reshape the Matrix]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/TreeNode.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -84,70 +88,69 @@
     <key name="CreateTestDialog.RecentsKey">
       <recent name="" />
     </key>
-    <key name="CreateClassDialog.RecentsKey">
+    <key name="MoveFile.RECENT_KEYS">
+      <recent name="$PROJECT_DIR$/[0463][Island Perimeter]/src" />
+      <recent name="$PROJECT_DIR$" />
+    </key>
+    <key name="CreateTestDialog.Recents.Supers">
       <recent name="" />
     </key>
     <key name="CopyClassDialog.RECENTS_KEY">
       <recent name="" />
     </key>
-    <key name="CreateTestDialog.Recents.Supers">
+    <key name="CreateClassDialog.RecentsKey">
       <recent name="" />
     </key>
-    <key name="MoveFile.RECENT_KEYS">
-      <recent name="$PROJECT_DIR$/[0463][Island Perimeter]/src" />
-      <recent name="$PROJECT_DIR$" />
-    </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.diameterOfBinaryTree">
-    <configuration name="SolutionTest.convertBST" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0538][Convert BST to Greater Tree]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.isSubtree2">
+    <configuration name="SolutionTest" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0563][Binary Tree Tilt]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="convertBST" />
-      <option name="TEST_OBJECT" value="method" />
+      <option name="TEST_OBJECT" value="class" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.diameterOfBinaryTree" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0543][Diameter of Binary Tree]" />
+    <configuration name="SolutionTest.checkRecord" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0551][Student Attendance Record I]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="diameterOfBinaryTree" />
+      <option name="METHOD_NAME" value="checkRecord" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.findPairs" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0523][K Diff Pairs In An Array]" />
+    <configuration name="SolutionTest.isSubtree" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0572][Subtree of Another Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findPairs" />
+      <option name="METHOD_NAME" value="isSubtree" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.getMinimumDifference2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0530][Minimum Absolute Difference in BST]" />
+    <configuration name="SolutionTest.isSubtree2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0572][Subtree of Another Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="getMinimumDifference2" />
+      <option name="METHOD_NAME" value="isSubtree2" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.reverseStr" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0541][Reverse String II]" />
+    <configuration name="SolutionTest.matrixReshape" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0566][Reshape the Matrix]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="reverseStr" />
+      <option name="METHOD_NAME" value="matrixReshape" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -162,19 +165,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.getMinimumDifference2" />
-      <item itemvalue="JUnit.SolutionTest.findPairs" />
-      <item itemvalue="JUnit.SolutionTest.convertBST" />
-      <item itemvalue="JUnit.SolutionTest.reverseStr" />
-      <item itemvalue="JUnit.SolutionTest.diameterOfBinaryTree" />
+      <item itemvalue="JUnit.SolutionTest.checkRecord" />
+      <item itemvalue="JUnit.SolutionTest" />
+      <item itemvalue="JUnit.SolutionTest.matrixReshape" />
+      <item itemvalue="JUnit.SolutionTest.isSubtree" />
+      <item itemvalue="JUnit.SolutionTest.isSubtree2" />
     </list>
     <recent_temporary>
       <list>
-        <item itemvalue="JUnit.SolutionTest.diameterOfBinaryTree" />
-        <item itemvalue="JUnit.SolutionTest.reverseStr" />
-        <item itemvalue="JUnit.SolutionTest.convertBST" />
-        <item itemvalue="JUnit.SolutionTest.findPairs" />
-        <item itemvalue="JUnit.SolutionTest.getMinimumDifference2" />
+        <item itemvalue="JUnit.SolutionTest.isSubtree2" />
+        <item itemvalue="JUnit.SolutionTest.isSubtree" />
+        <item itemvalue="JUnit.SolutionTest.matrixReshape" />
+        <item itemvalue="JUnit.SolutionTest" />
+        <item itemvalue="JUnit.SolutionTest.checkRecord" />
       </list>
     </recent_temporary>
   </component>
@@ -238,7 +241,8 @@
       <workItem from="1593474505742" duration="5061000" />
       <workItem from="1593492568375" duration="770000" />
       <workItem from="1593564530445" duration="24000" />
-      <workItem from="1593564572043" duration="1968000" />
+      <workItem from="1593564572043" duration="2267000" />
+      <workItem from="1593647589537" duration="4805000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -598,10 +602,11 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="208" y="31" key="#Project_Structure/0.0.1440.900@0.0.1440.900" timestamp="1593390815779" />
-    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog" timestamp="1593391139304">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog" timestamp="1593651681333">
+      <screen x="43" y="23" width="1397" height="877" />
     </state>
     <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog/0.0.1440.900@0.0.1440.900" timestamp="1593391139304" />
+    <state x="100" y="100" width="1240" height="700" key="#com.intellij.execution.junit2.states.ComparisonFailureState$DiffDialog/43.23.1397.877@43.23.1397.877" timestamp="1593651681333" />
     <state x="533" y="165" key="#com.intellij.ide.util.MemberChooser" timestamp="1593387493079">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
@@ -610,12 +615,13 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1397" height="369" key="GridCell.Tab.0.bottom" timestamp="1593566336646">
+    <state width="1397" height="324" key="GridCell.Tab.0.bottom" timestamp="1593652747283">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="369" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593566336646" />
+    <state width="1397" height="324" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593652747283" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
     <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108980" />
+    <state width="1397" height="202" key="GridCell.Tab.0.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
     <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682468" />
     <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081570" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008024" />
@@ -623,12 +629,13 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1397" height="369" key="GridCell.Tab.0.center" timestamp="1593566336645">
+    <state width="1397" height="324" key="GridCell.Tab.0.center" timestamp="1593652747282">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="369" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593566336645" />
+    <state width="1397" height="324" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593652747282" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
     <state width="1880" height="293" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108978" />
+    <state width="1397" height="202" key="GridCell.Tab.0.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123892" />
     <state width="1880" height="293" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682467" />
     <state width="1880" height="293" key="GridCell.Tab.0.center/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081523" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
@@ -636,12 +643,13 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1397" height="369" key="GridCell.Tab.0.left" timestamp="1593566336644">
+    <state width="1397" height="324" key="GridCell.Tab.0.left" timestamp="1593652747282">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="369" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593566336644" />
+    <state width="1397" height="324" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593652747282" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
     <state width="1880" height="293" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108977" />
+    <state width="1397" height="202" key="GridCell.Tab.0.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123891" />
     <state width="1880" height="293" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682466" />
     <state width="1880" height="293" key="GridCell.Tab.0.left/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081511" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008022" />
@@ -649,12 +657,13 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1397" height="369" key="GridCell.Tab.0.right" timestamp="1593566336646">
+    <state width="1397" height="324" key="GridCell.Tab.0.right" timestamp="1593652747283">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="369" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593566336646" />
+    <state width="1397" height="324" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593652747283" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
     <state width="1880" height="293" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108979" />
+    <state width="1397" height="202" key="GridCell.Tab.0.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
     <state width="1880" height="293" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682468" />
     <state width="1880" height="293" key="GridCell.Tab.0.right/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081565" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
@@ -662,33 +671,37 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1397" height="369" key="GridCell.Tab.1.bottom" timestamp="1593566336553">
+    <state width="1397" height="324" key="GridCell.Tab.1.bottom" timestamp="1593652747515">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="369" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593566336553" />
+    <state width="1397" height="324" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593652747515" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
     <state width="1400" height="438" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682568" />
+    <state width="1397" height="202" key="GridCell.Tab.1.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123896" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1397" height="369" key="GridCell.Tab.1.center" timestamp="1593566336552">
+    <state width="1397" height="324" key="GridCell.Tab.1.center" timestamp="1593652747514">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="369" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593566336552" />
+    <state width="1397" height="324" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593652747514" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
     <state width="1400" height="438" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682565" />
+    <state width="1397" height="202" key="GridCell.Tab.1.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1397" height="369" key="GridCell.Tab.1.left" timestamp="1593566336551">
+    <state width="1397" height="324" key="GridCell.Tab.1.left" timestamp="1593652747514">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="369" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593566336551" />
+    <state width="1397" height="324" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593652747514" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
     <state width="1400" height="438" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682563" />
+    <state width="1397" height="202" key="GridCell.Tab.1.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123894" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1397" height="369" key="GridCell.Tab.1.right" timestamp="1593566336552">
+    <state width="1397" height="324" key="GridCell.Tab.1.right" timestamp="1593652747515">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="369" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593566336552" />
+    <state width="1397" height="324" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593652747515" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
     <state width="1400" height="438" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682566" />
+    <state width="1397" height="202" key="GridCell.Tab.1.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
     <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog" timestamp="1593161435798">
       <screen x="0" y="0" width="1440" height="900" />
@@ -709,28 +722,28 @@
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593565072194">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593652321235">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593565072193" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593652321235" />
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492899262" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593565067674">
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593652317964">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593565067674" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593652317964" />
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
     <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492895688" />
     <state x="402" y="49" width="636" height="801" key="find.popup" timestamp="1593262516580">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593564755950">
+    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593651708233">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593564755950" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593651708233" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492613592" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
@@ -995,6 +1008,27 @@
           <line>19</line>
           <option name="timeStamp" value="124" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0551][Student Attendance Record I]/src/Solution.java</url>
+          <line>12</line>
+          <option name="timeStamp" value="125" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0566][Reshape the Matrix]/src/SolutionTest.java</url>
+          <line>24</line>
+          <option name="timeStamp" value="127" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/Solution.java</url>
+          <line>23</line>
+          <option name="timeStamp" value="129" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <condition expression="root.val == 4" language="JAVA" />
+          <url>file://$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/Solution.java</url>
+          <line>32</line>
+          <option name="timeStamp" value="130" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
@@ -1014,90 +1048,4 @@
       </breakpoints>
     </breakpoint-manager>
   </component>
-  <component name="debuggerHistoryManager">
-    <expressions id="breakpointCondition">
-      <expression>
-        <expression-string>course == 1</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>i == 3</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>index &gt;= s.length()</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>path.size()==4</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>path.size() == 3</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>idx &gt;= nums.length</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>start2 + k - 1 &gt;= nums2.length</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-    </expressions>
-    <expressions id="evaluateExpression">
-      <expression>
-        <expression-string>t.charAt(i)</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>(2 &lt;&lt; h1) - 1</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>dependency[1]</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>operator.subList(i + 1, operator.size())</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>operand.subList(i + 1, operand.size())</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>new ArrayList&lt;&gt;(operator.subList(0, i))</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>operand.subList(0, i + 1)</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>nums[i - 1] - 1</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-      <expression>
-        <expression-string>result.first()</expression-string>
-        <language-id>JAVA</language-id>
-        <evaluation-mode>EXPRESSION</evaluation-mode>
-      </expression>
-    </expressions>
-  </component>
 </project>
\ No newline at end of file
diff --git a/[0551][Student Attendance Record I]/[0551][Student Attendance Record I].iml b/[0551][Student Attendance Record I]/[0551][Student Attendance Record I].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0551][Student Attendance Record I]/[0551][Student Attendance Record I].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>
\ No newline at end of file
diff --git a/[0551][Student Attendance Record I]/src/Solution.java b/[0551][Student Attendance Record I]/src/Solution.java
new file mode 100644
index 0000000..3ca6969
--- /dev/null
+++ b/[0551][Student Attendance Record I]/src/Solution.java	
@@ -0,0 +1,41 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 08:05
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public boolean checkRecord(String s) {
+        int a = 0;
+        int l = 0;
+        int preLIndex = -1;
+        if (s != null) {
+            for (int i = 0; i < s.length(); i++) {
+                switch (s.charAt(i)) {
+                    case 'A':
+                        a++;
+                        break;
+                    case 'L':
+                        if (l < 3) { // 连续两个L后面步不用记录了
+                            if (preLIndex == -1) { // 刚开始记录
+                                preLIndex = i;
+                                l = 1;
+                            } else if (preLIndex + 1 == i) { // 当前和前一个都是L
+                                l++;
+                                preLIndex = i;
+                            } else { // 前一个不是L，重新记数
+                                preLIndex = i;
+                                l = 1;
+                            }
+                        }
+                        break;
+                    default:
+                        // do nothing
+                }
+            }
+        }
+
+        return a <= 1 && l < 3;
+    }
+}
diff --git a/[0551][Student Attendance Record I]/src/SolutionTest.java b/[0551][Student Attendance Record I]/src/SolutionTest.java
new file mode 100644
index 0000000..4c102f4
--- /dev/null
+++ b/[0551][Student Attendance Record I]/src/SolutionTest.java	
@@ -0,0 +1,27 @@
+import org.junit.Assert;
+import org.junit.Test;
+
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 08:12
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @Test
+    public void checkRecord() {
+        Solution s  = new Solution();
+        Object[][] data = {
+                {"PPALLP", true},
+                {"PPALLL", false},
+        };
+
+        for (Object[] d : data) {
+            Assert.assertEquals(d[1], s.checkRecord((String) d[0]));
+        }
+    }
+
+}
\ No newline at end of file
diff --git a/[0559][Maximum Depth of N-ary Tree]/[0559][Maximum Depth of N-ary Tree].iml b/[0559][Maximum Depth of N-ary Tree]/[0559][Maximum Depth of N-ary Tree].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0559][Maximum Depth of N-ary Tree]/[0559][Maximum Depth of N-ary 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>
\ No newline at end of file
diff --git a/[0559][Maximum Depth of N-ary Tree]/src/Node.java b/[0559][Maximum Depth of N-ary Tree]/src/Node.java
new file mode 100644
index 0000000..bf5b87a
--- /dev/null
+++ b/[0559][Maximum Depth of N-ary Tree]/src/Node.java	
@@ -0,0 +1,25 @@
+import java.util.List;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 07:58
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Node {
+    public int val;
+    public List<Node> children;
+
+    public Node() {
+    }
+
+    public Node(int val) {
+        this.val = val;
+    }
+
+    public Node(int val, List<Node> children) {
+        this.val = val;
+        this.children = children;
+    }
+}
diff --git a/[0559][Maximum Depth of N-ary Tree]/src/Solution.java b/[0559][Maximum Depth of N-ary Tree]/src/Solution.java
new file mode 100644
index 0000000..d43fa08
--- /dev/null
+++ b/[0559][Maximum Depth of N-ary Tree]/src/Solution.java	
@@ -0,0 +1,27 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 07:58
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public int maxDepth(Node root) {
+        if (root == null) {
+            return 0;
+        }
+
+        if (root.children == null || root.children.isEmpty()) {
+            return 1;
+        }
+
+        int max = 0;
+
+        for (Node child : root.children) {
+            max = Math.max(max, maxDepth(child));
+        }
+
+        return 1 + max;
+    }
+}
+
diff --git a/[0559][Maximum Depth of N-ary Tree]/src/SolutionTest.java b/[0559][Maximum Depth of N-ary Tree]/src/SolutionTest.java
new file mode 100644
index 0000000..4aebf27
--- /dev/null
+++ b/[0559][Maximum Depth of N-ary Tree]/src/SolutionTest.java	
@@ -0,0 +1,31 @@
+import org.junit.Assert;
+
+import java.util.ArrayList;
+
+import static org.junit.Assert.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 08:00
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void maxDepth() {
+        Node root = new Node(1);
+        root.children = new ArrayList<>();
+        root.children.add(new Node(3));
+        root.children.add(new Node(2));
+        root.children.add(new Node(4));
+        root.children.get(0).children = new ArrayList<>();
+        root.children.get(0).children.add(new Node(5));
+        root.children.get(0).children.add(new Node(6));
+
+        Solution s  =new Solution();
+
+        Assert.assertEquals(3, s.maxDepth(root));
+    }
+}
\ No newline at end of file
diff --git a/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml b/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].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>
\ No newline at end of file
diff --git a/[0563][Binary Tree Tilt]/src/Solution.java b/[0563][Binary Tree Tilt]/src/Solution.java
new file mode 100644
index 0000000..a3ae597
--- /dev/null
+++ b/[0563][Binary Tree Tilt]/src/Solution.java	
@@ -0,0 +1,47 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 08:26
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 解题思路
+     * 一个树的坡度等于=左子树的坡度+右子树的坡度+根节点的坡度
+     * 子树同样适应
+     *
+     * @param root
+     * @return
+     */
+    public int findTilt(TreeNode root) {
+        return findTiltHelp(root)[0];
+    }
+
+    /**
+     * 第一个返回值表示root的坡度
+     * 第二个返回值表示root的为根的树的节点和
+     *
+     * @param root
+     * @return
+     */
+    public int[] findTiltHelp(TreeNode root) {
+        // 空结点或者左右孩子为都空的结点
+        if (root == null) {
+            return new int[]{0, 0};
+        } else if (root.left == null && root.right == null) {
+            return new int[]{0, root.val};
+        }
+
+
+        int[] left = findTiltHelp(root.left);
+        int[] right = findTiltHelp(root.right);
+
+        int[] result = {0, 0};
+
+        result[0] = left[0] + right[0] + Math.abs(left[1] - right[1]);
+        result[1] = left[1] + right[1] + root.val;
+
+        return result;
+    }
+}
diff --git a/[0563][Binary Tree Tilt]/src/SolutionTest.java b/[0563][Binary Tree Tilt]/src/SolutionTest.java
new file mode 100644
index 0000000..358cd67
--- /dev/null
+++ b/[0563][Binary Tree Tilt]/src/SolutionTest.java	
@@ -0,0 +1,22 @@
+import org.junit.Assert;
+
+import static org.junit.Assert.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 08:38
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findTilt() {
+        Solution s = new Solution();
+        TreeNode root = new TreeNode(1);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(3);
+        Assert.assertEquals(1, s.findTilt(root));
+    }
+}
\ No newline at end of file
diff --git a/[0563][Binary Tree Tilt]/src/TreeNode.java b/[0563][Binary Tree Tilt]/src/TreeNode.java
new file mode 100644
index 0000000..8b88e24
--- /dev/null
+++ b/[0563][Binary Tree Tilt]/src/TreeNode.java	
@@ -0,0 +1,16 @@
+/**
+ * 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;
+    }
+}
+
diff --git a/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml b/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].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>
\ No newline at end of file
diff --git a/[0566][Reshape the Matrix]/src/Solution.java b/[0566][Reshape the Matrix]/src/Solution.java
new file mode 100644
index 0000000..f4516d8
--- /dev/null
+++ b/[0566][Reshape the Matrix]/src/Solution.java	
@@ -0,0 +1,29 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 08:43
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public int[][] matrixReshape(int[][] nums, int r, int c) {
+        int row = nums.length;
+        int col = nums[0].length;
+        if (row * col != r * c) {
+            return nums;
+        }
+
+        int[][] result = new int[r][c];
+        for (int i = 0; i < r; i++) {
+            result[i] = new int[c];
+        }
+
+        int num = row * col;
+
+        for (int i = 0; i < num; i++) {
+            result[i / c][i % c] = nums[i / col][i % col];
+        }
+
+        return result;
+    }
+}
diff --git a/[0566][Reshape the Matrix]/src/SolutionTest.java b/[0566][Reshape the Matrix]/src/SolutionTest.java
new file mode 100644
index 0000000..d21e1f9
--- /dev/null
+++ b/[0566][Reshape the Matrix]/src/SolutionTest.java	
@@ -0,0 +1,32 @@
+import org.junit.Assert;
+
+import static org.junit.Assert.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 08:46
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void matrixReshape() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[][]{{1, 2}, {3, 4}}, 1, 4, new int[][]{{1, 2, 3, 4}}},
+                {new int[][]{{1, 2}, {3, 4}}, 2, 4, new int[][]{{1, 2}, {3, 4}}},
+        };
+
+        for (Object[] d : data) {
+            int[][] result =  s.matrixReshape((int[][]) d[0], (Integer) d[1], (Integer) d[2]);
+            int[][] actual = (int[][]) d[3];
+            Assert.assertEquals(result.length, actual.length);
+
+            for (int i = 0; i < result.length; i++) {
+                Assert.assertArrayEquals(actual[i], result[i]);
+            }
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml b/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0572][Subtree of Another Tree]/[0572][Subtree of Another 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>
\ No newline at end of file
diff --git a/[0572][Subtree of Another Tree]/src/Solution.java b/[0572][Subtree of Another Tree]/src/Solution.java
new file mode 100644
index 0000000..f14f241
--- /dev/null
+++ b/[0572][Subtree of Another Tree]/src/Solution.java	
@@ -0,0 +1,56 @@
+import java.util.Deque;
+import java.util.LinkedList;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 09:02
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public boolean isSubtree(TreeNode s, TreeNode t) {
+
+        if (s == t || t == null) {
+            return true;
+        }
+
+        if (s == null) {
+            return false;
+        }
+
+        Deque<TreeNode> queue = new LinkedList<>();
+        queue.addFirst(s);
+        while (!queue.isEmpty()) {
+            TreeNode root = queue.removeFirst();
+            if (root.right != null) {
+                queue.addFirst(root.right);
+            }
+            if (root.left != null) {
+                queue.addFirst(root.left);
+            }
+
+            if(isSame(root, t)) {
+                return true;
+            }
+
+        }
+
+        return false;
+    }
+
+    public boolean isSame(TreeNode s, TreeNode t) {
+        if (s == t) {
+            return true;
+        }
+
+        if (s == null || t == null) {
+            return false;
+        }
+
+        boolean leftSame = isSame(s.left, t.left);
+        boolean rightSame = isSame(s.right, t.right);
+
+        return s.val == t.val && leftSame && rightSame;
+    }
+}
diff --git a/[0572][Subtree of Another Tree]/src/SolutionTest.java b/[0572][Subtree of Another Tree]/src/SolutionTest.java
new file mode 100644
index 0000000..15b8f13
--- /dev/null
+++ b/[0572][Subtree of Another Tree]/src/SolutionTest.java	
@@ -0,0 +1,46 @@
+import org.junit.Assert;
+
+import static org.junit.Assert.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-02 09:11
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void isSubtree() {
+        Solution s = new Solution();
+        TreeNode root = new TreeNode(3);
+        root.left = new TreeNode(4);
+        root.right = new TreeNode(5);
+        root.left.left = new TreeNode(1);
+        root.left.right = new TreeNode(2);
+
+        TreeNode t = new TreeNode(4);
+        t.left = new TreeNode(1);
+        t.right = new TreeNode(2);
+
+        Assert.assertEquals(true, s.isSubtree(root, t));
+    }
+
+    @org.junit.Test
+    public void isSubtree2() {
+        Solution s = new Solution();
+        TreeNode root = new TreeNode(3);
+        root.left = new TreeNode(4);
+        root.right = new TreeNode(5);
+        root.left.left = new TreeNode(1);
+        root.left.right = new TreeNode(2);
+        root.left.right.left = new TreeNode(0);
+
+        TreeNode t = new TreeNode(4);
+        t.left = new TreeNode(1);
+        t.right = new TreeNode(2);
+
+        Assert.assertEquals(false, s.isSubtree(root, t));
+    }
+}
\ No newline at end of file
diff --git a/[0572][Subtree of Another Tree]/src/TreeNode.java b/[0572][Subtree of Another Tree]/src/TreeNode.java
new file mode 100644
index 0000000..ac7b907
--- /dev/null
+++ b/[0572][Subtree of Another Tree]/src/TreeNode.java	
@@ -0,0 +1,22 @@
+/**
+ * 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;
+    }
+
+    TreeNode(int val, TreeNode left, TreeNode right) {
+        this.val = val;
+        this.left = left;
+        this.right = right;
+    }
+}

From 931f4b3cd7421c8c67339e960b3a4571ba58d5e7 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Sat, 4 Jul 2020 15:07:54 +0800
Subject: [PATCH 12/19] commit

Change-Id: I98a51095df2f343d8a10ba5542749cb0f34e35ed
---
 .idea/modules.xml                             |   3 +
 .idea/workspace.xml                           | 186 ++++++++++--------
 .../[0575][Distribute Candies].iml            |  21 ++
 [0575][Distribute Candies]/src/Solution.java  |  32 +++
 .../src/SolutionTest.java                     |  27 +++
 .../[0589][N-ary Tree Preorder Traversal].iml |  11 ++
 .../src/Node.java                             |  24 +++
 .../src/Solution.java                         |  56 ++++++
 ...[0590][N-ary Tree postorder Traversal].iml |  21 ++
 .../src/Node.java                             |  24 +++
 .../src/Solution.java                         |  63 ++++++
 .../src/SolutionTest.java                     |  35 ++++
 12 files changed, 418 insertions(+), 85 deletions(-)
 create mode 100644 [0575][Distribute Candies]/[0575][Distribute Candies].iml
 create mode 100644 [0575][Distribute Candies]/src/Solution.java
 create mode 100644 [0575][Distribute Candies]/src/SolutionTest.java
 create mode 100644 [0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml
 create mode 100644 [0589][N-ary Tree Preorder Traversal]/src/Node.java
 create mode 100644 [0589][N-ary Tree Preorder Traversal]/src/Solution.java
 create mode 100644 [0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml
 create mode 100644 [0590][N-ary Tree postorder Traversal]/src/Node.java
 create mode 100644 [0590][N-ary Tree postorder Traversal]/src/Solution.java
 create mode 100644 [0590][N-ary Tree postorder Traversal]/src/SolutionTest.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index c99a8c1..e6b4609 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -260,6 +260,9 @@
       <module fileurl="file://$PROJECT_DIR$/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml" filepath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml" filepath="$PROJECT_DIR$/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml" filepath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0575][Distribute Candies]/[0575][Distribute Candies].iml" filepath="$PROJECT_DIR$/[0575][Distribute Candies]/[0575][Distribute Candies].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml" filepath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml" filepath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" filepath="$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 1aca74a..a5b758c 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,24 +2,16 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0551][Student Attendance Record I]/[0551][Student Attendance Record I].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0551][Student Attendance Record I]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0551][Student Attendance Record I]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/[0559][Maximum Depth of N-ary Tree].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/src/Node.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0559][Maximum Depth of N-ary Tree]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/[0563][Binary Tree Tilt].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0563][Binary Tree Tilt]/src/TreeNode.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0566][Reshape the Matrix]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0566][Reshape the Matrix]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0575][Distribute Candies]/[0575][Distribute Candies].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0575][Distribute Candies]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0575][Distribute Candies]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/src/Node.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/src/Node.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/src/SolutionTest.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -77,47 +69,41 @@
     <property name="go.gopath.indexing.explicitly.defined" value="true" />
     <property name="go.import.settings.migrated" value="true" />
     <property name="jdk.selected.JAVA_MODULE" value="14" />
+    <property name="last_opened_file_path" value="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/src" />
     <property name="nodejs_package_manager_path" value="npm" />
     <property name="project.structure.last.edited" value="Modules" />
     <property name="project.structure.proportion" value="0.124843955" />
     <property name="project.structure.side.proportion" value="0.29248658" />
     <property name="scala_project_settings_configurable.last_selected_tab_index" value="0" />
-    <property name="settings.editor.selected.configurable" value="leetcode.id" />
+    <property name="settings.editor.selected.configurable" value="editing.templates" />
   </component>
   <component name="RecentsManager">
     <key name="CreateTestDialog.RecentsKey">
       <recent name="" />
     </key>
+    <key name="CreateTestDialog.Recents.Supers">
+      <recent name="" />
+    </key>
     <key name="MoveFile.RECENT_KEYS">
       <recent name="$PROJECT_DIR$/[0463][Island Perimeter]/src" />
       <recent name="$PROJECT_DIR$" />
     </key>
-    <key name="CreateTestDialog.Recents.Supers">
-      <recent name="" />
-    </key>
     <key name="CopyClassDialog.RECENTS_KEY">
       <recent name="" />
     </key>
+    <key name="CopyFile.RECENT_KEYS">
+      <recent name="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/src" />
+    </key>
     <key name="CreateClassDialog.RecentsKey">
       <recent name="" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.isSubtree2">
-    <configuration name="SolutionTest" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0563][Binary Tree Tilt]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.postorder">
+    <configuration name="SolutionTest.distributeCandies" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0575][Distribute Candies]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="TEST_OBJECT" value="class" />
-      <method v="2">
-        <option name="Make" enabled="true" />
-        <option name="BSP.BeforeRunTask" enabled="true" />
-      </method>
-    </configuration>
-    <configuration name="SolutionTest.checkRecord" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0551][Student Attendance Record I]" />
-      <option name="PACKAGE_NAME" value="" />
-      <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="checkRecord" />
+      <option name="METHOD_NAME" value="distributeCandies" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -157,6 +143,17 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
+    <configuration name="SolutionTest.postorder" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0590][N-ary Tree postorder Traversal]" />
+      <option name="PACKAGE_NAME" value="" />
+      <option name="MAIN_CLASS_NAME" value="SolutionTest" />
+      <option name="METHOD_NAME" value="postorder" />
+      <option name="TEST_OBJECT" value="method" />
+      <method v="2">
+        <option name="Make" enabled="true" />
+        <option name="BSP.BeforeRunTask" enabled="true" />
+      </method>
+    </configuration>
     <configuration default="true" type="JUnit" factoryName="JUnit">
       <option name="TEST_OBJECT" value="class" />
       <method v="2">
@@ -165,19 +162,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.checkRecord" />
-      <item itemvalue="JUnit.SolutionTest" />
       <item itemvalue="JUnit.SolutionTest.matrixReshape" />
       <item itemvalue="JUnit.SolutionTest.isSubtree" />
       <item itemvalue="JUnit.SolutionTest.isSubtree2" />
+      <item itemvalue="JUnit.SolutionTest.distributeCandies" />
+      <item itemvalue="JUnit.SolutionTest.postorder" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.postorder" />
+        <item itemvalue="JUnit.SolutionTest.distributeCandies" />
         <item itemvalue="JUnit.SolutionTest.isSubtree2" />
         <item itemvalue="JUnit.SolutionTest.isSubtree" />
         <item itemvalue="JUnit.SolutionTest.matrixReshape" />
-        <item itemvalue="JUnit.SolutionTest" />
-        <item itemvalue="JUnit.SolutionTest.checkRecord" />
       </list>
     </recent_temporary>
   </component>
@@ -242,7 +239,9 @@
       <workItem from="1593492568375" duration="770000" />
       <workItem from="1593564530445" duration="24000" />
       <workItem from="1593564572043" duration="2267000" />
-      <workItem from="1593647589537" duration="4805000" />
+      <workItem from="1593647589537" duration="5696000" />
+      <workItem from="1593741566759" duration="56000" />
+      <workItem from="1593741641747" duration="4341000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -615,13 +614,15 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1397" height="324" key="GridCell.Tab.0.bottom" timestamp="1593652747283">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state width="1877" height="402" key="GridCell.Tab.0.bottom" timestamp="1593746004768">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593652747283" />
+    <state width="1397" height="294" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593653018746" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
-    <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108980" />
+    <state width="1877" height="402" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004768" />
     <state width="1397" height="202" key="GridCell.Tab.0.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
+    <state width="1877" height="365" key="GridCell.Tab.0.bottom/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735334" />
+    <state width="1397" height="324" key="GridCell.Tab.0.bottom/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529745" />
     <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682468" />
     <state width="1880" height="293" key="GridCell.Tab.0.bottom/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081570" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008024" />
@@ -629,13 +630,15 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1397" height="324" key="GridCell.Tab.0.center" timestamp="1593652747282">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state width="1877" height="402" key="GridCell.Tab.0.center" timestamp="1593746004767">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593652747282" />
+    <state width="1397" height="294" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593653018744" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
-    <state width="1880" height="293" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108978" />
+    <state width="1877" height="402" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123892" />
+    <state width="1877" height="365" key="GridCell.Tab.0.center/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735330" />
+    <state width="1397" height="324" key="GridCell.Tab.0.center/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529743" />
     <state width="1880" height="293" key="GridCell.Tab.0.center/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682467" />
     <state width="1880" height="293" key="GridCell.Tab.0.center/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081523" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
@@ -643,13 +646,15 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1397" height="324" key="GridCell.Tab.0.left" timestamp="1593652747282">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state width="1877" height="402" key="GridCell.Tab.0.left" timestamp="1593746004766">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593652747282" />
+    <state width="1397" height="294" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593653018744" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
-    <state width="1880" height="293" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108977" />
+    <state width="1877" height="402" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004766" />
     <state width="1397" height="202" key="GridCell.Tab.0.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123891" />
+    <state width="1877" height="365" key="GridCell.Tab.0.left/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735322" />
+    <state width="1397" height="324" key="GridCell.Tab.0.left/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529742" />
     <state width="1880" height="293" key="GridCell.Tab.0.left/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682466" />
     <state width="1880" height="293" key="GridCell.Tab.0.left/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081511" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008022" />
@@ -657,13 +662,15 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1397" height="324" key="GridCell.Tab.0.right" timestamp="1593652747283">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state width="1877" height="402" key="GridCell.Tab.0.right" timestamp="1593746004767">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593652747283" />
+    <state width="1397" height="294" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593653018745" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
-    <state width="1880" height="293" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593493108979" />
+    <state width="1877" height="402" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
+    <state width="1877" height="365" key="GridCell.Tab.0.right/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735333" />
+    <state width="1397" height="324" key="GridCell.Tab.0.right/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529744" />
     <state width="1880" height="293" key="GridCell.Tab.0.right/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1593484682468" />
     <state width="1880" height="293" key="GridCell.Tab.0.right/1440.23.1920.1057/44.23.1396.877@1440.23.1920.1057" timestamp="1593498081565" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008023" />
@@ -671,37 +678,41 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1397" height="324" key="GridCell.Tab.1.bottom" timestamp="1593652747515">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state width="1877" height="402" key="GridCell.Tab.1.bottom" timestamp="1593746004770">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593652747515" />
+    <state width="1397" height="324" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593652970230" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
-    <state width="1400" height="438" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682568" />
+    <state width="1877" height="402" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123896" />
+    <state width="1397" height="324" key="GridCell.Tab.1.bottom/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529748" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1397" height="324" key="GridCell.Tab.1.center" timestamp="1593652747514">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state width="1877" height="402" key="GridCell.Tab.1.center" timestamp="1593746004769">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593652747514" />
+    <state width="1397" height="324" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593652970229" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
-    <state width="1400" height="438" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682565" />
+    <state width="1877" height="402" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
+    <state width="1397" height="324" key="GridCell.Tab.1.center/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1397" height="324" key="GridCell.Tab.1.left" timestamp="1593652747514">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state width="1877" height="402" key="GridCell.Tab.1.left" timestamp="1593746004769">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593652747514" />
+    <state width="1397" height="324" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593652970229" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
-    <state width="1400" height="438" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682563" />
+    <state width="1877" height="402" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123894" />
+    <state width="1397" height="324" key="GridCell.Tab.1.left/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529746" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1397" height="324" key="GridCell.Tab.1.right" timestamp="1593652747515">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state width="1877" height="402" key="GridCell.Tab.1.right" timestamp="1593746004770">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593652747515" />
+    <state width="1397" height="324" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593652970229" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
-    <state width="1400" height="438" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593484682566" />
+    <state width="1877" height="402" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
+    <state width="1397" height="324" key="GridCell.Tab.1.right/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
     <state x="293" y="193" width="824" height="504" key="IDE.errors.dialog" timestamp="1593161435798">
       <screen x="0" y="0" width="1440" height="900" />
@@ -713,39 +724,39 @@
     </state>
     <state x="367" y="208" key="RollbackChangesDialog/0.0.1440.900@0.0.1440.900" timestamp="1593386374017" />
     <state x="1929" y="250" key="RollbackChangesDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592905880584" />
-    <state x="130" y="74" width="1184" height="722" key="SettingsEditor" timestamp="1593564606813">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state x="1801" y="172" width="1394" height="869" key="SettingsEditor" timestamp="1593742588950">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="130" y="74" width="1184" height="722" key="SettingsEditor/0.0.1440.900@0.0.1440.900" timestamp="1593564606813" />
     <state x="129" y="74" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593310819945" />
-    <state x="1939" y="179" width="1089" height="722" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592907781087" />
+    <state x="1801" y="172" width="1394" height="869" key="SettingsEditor/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593742588950" />
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593652321235">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593744481391">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593652321235" />
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
-    <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492899262" />
+    <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744481391" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593652317964">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593744477730">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593652317964" />
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
-    <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492895688" />
+    <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744477730" />
     <state x="402" y="49" width="636" height="801" key="find.popup" timestamp="1593262516580">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593651708233">
-      <screen x="0" y="0" width="1440" height="900" />
+    <state x="1618" y="163" width="1147" height="750" key="new project wizard" timestamp="1593743567550">
+      <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593651708233" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
-    <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593492613592" />
+    <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593743567550" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="108" y="144" key="new project wizard/41.23.1399.877@41.23.1399.877" timestamp="1593387189945" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
@@ -1029,6 +1040,11 @@
           <line>32</line>
           <option name="timeStamp" value="130" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0572][Subtree of Another Tree]/src/Solution.java</url>
+          <line>42</line>
+          <option name="timeStamp" value="131" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
diff --git a/[0575][Distribute Candies]/[0575][Distribute Candies].iml b/[0575][Distribute Candies]/[0575][Distribute Candies].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0575][Distribute Candies]/[0575][Distribute Candies].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>
\ No newline at end of file
diff --git a/[0575][Distribute Candies]/src/Solution.java b/[0575][Distribute Candies]/src/Solution.java
new file mode 100644
index 0000000..660aaac
--- /dev/null
+++ b/[0575][Distribute Candies]/src/Solution.java	
@@ -0,0 +1,32 @@
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Set;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-03 10:03
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 找出共有多少种糖果，如果种类大于糖果数目的一半就取糖果数目的一半，否则就取糖果的种类数
+     *
+     * @param candies
+     * @return
+     */
+    public int distributeCandies(int[] candies) {
+        if (candies == null || candies.length % 2 != 0) {
+            throw new IllegalArgumentException("illegal candies: " + Arrays.toString(candies));
+        }
+
+        Set<Integer> set = new HashSet<>(candies.length);
+        for (int c : candies) {
+            set.add(c);
+        }
+
+        return Math.min(set.size(), candies.length / 2);
+    }
+
+}
diff --git a/[0575][Distribute Candies]/src/SolutionTest.java b/[0575][Distribute Candies]/src/SolutionTest.java
new file mode 100644
index 0000000..a066444
--- /dev/null
+++ b/[0575][Distribute Candies]/src/SolutionTest.java	
@@ -0,0 +1,27 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-03 10:08
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void distributeCandies() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{1, 1, 2, 2, 3, 3}, 3},
+                {new int[]{1, 1, 2, 3}, 2},
+                {new int[]{1, 2, 3, 4}, 2},
+        };
+
+        for (Object[] d : data) {
+            int result = s.distributeCandies((int[]) d[0]);
+            Assert.assertEquals(d[1], result);
+        }
+
+    }
+}
\ No newline at end of file
diff --git a/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml b/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].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>
\ No newline at end of file
diff --git a/[0589][N-ary Tree Preorder Traversal]/src/Node.java b/[0589][N-ary Tree Preorder Traversal]/src/Node.java
new file mode 100644
index 0000000..6df4c7f
--- /dev/null
+++ b/[0589][N-ary Tree Preorder Traversal]/src/Node.java	
@@ -0,0 +1,24 @@
+import java.util.List;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-03 10:20
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+class Node {
+    public int val;
+    public List<Node> children;
+
+    public Node() {}
+
+    public Node(int _val) {
+        this.val = _val;
+    }
+
+    public Node(int val, List<Node> children) {
+        this.val = val;
+        this.children = children;
+    }
+}
diff --git a/[0589][N-ary Tree Preorder Traversal]/src/Solution.java b/[0589][N-ary Tree Preorder Traversal]/src/Solution.java
new file mode 100644
index 0000000..f4cc00d
--- /dev/null
+++ b/[0589][N-ary Tree Preorder Traversal]/src/Solution.java	
@@ -0,0 +1,56 @@
+import java.util.Deque;
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-03 10:20
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public List<Integer> preorder(Node root) {
+        List<Integer> result = new LinkedList<>();
+//        preorderReserve(root, result);
+        preorderIterator(root, result);
+        return result;
+    }
+
+    public void preorderIterator(Node root, List<Integer> result) {
+        if (root == null) {
+            return;
+        }
+
+        Deque<Node> deque = new LinkedList<>();
+        deque.addFirst(root);
+
+        while (!deque.isEmpty()) {
+            Node n = deque.removeFirst();
+            result.add(n.val);
+            if (n.children != null) {
+                int size = n.children.size();
+                for (int i = size - 1; i >= 0; i--) {
+                    Node child = n.children.get(i);
+                    if (child != null) {
+                        deque.addFirst(child);
+                    }
+                }
+            }
+        }
+    }
+
+    public void preorderReserve(Node root, List<Integer> result) {
+
+        if (root == null) {
+            return;
+        }
+
+        result.add(root.val);
+        if (root.children != null) {
+            for (Node n : root.children) {
+                preorderReserve(n, result);
+            }
+        }
+    }
+}
diff --git a/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml b/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].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>
\ No newline at end of file
diff --git a/[0590][N-ary Tree postorder Traversal]/src/Node.java b/[0590][N-ary Tree postorder Traversal]/src/Node.java
new file mode 100644
index 0000000..a6c2e09
--- /dev/null
+++ b/[0590][N-ary Tree postorder Traversal]/src/Node.java	
@@ -0,0 +1,24 @@
+import java.util.List;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-03 10:20
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+class Node {
+    public int val;
+    public List<Node> children;
+
+    public Node() {}
+
+    public Node(int val) {
+        this.val = val;
+    }
+
+    public Node(int val, List<Node> children) {
+        this.val = val;
+        this.children = children;
+    }
+}
diff --git a/[0590][N-ary Tree postorder Traversal]/src/Solution.java b/[0590][N-ary Tree postorder Traversal]/src/Solution.java
new file mode 100644
index 0000000..0dcb602
--- /dev/null
+++ b/[0590][N-ary Tree postorder Traversal]/src/Solution.java	
@@ -0,0 +1,63 @@
+import java.util.Deque;
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-03 10:20
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public List<Integer> postorder(Node root) {
+        List<Integer> result = new LinkedList<>();
+//        postorderReserve(root, result);
+        postorderIterator(root, result);
+        return result;
+    }
+
+    public void postorderIterator(Node root, List<Integer> result) {
+        if (root == null) {
+            return;
+        }
+
+        Deque<Node> deque = new LinkedList<>();
+        deque.addFirst(root);
+        Node curr;
+        Node prev = null;
+        while (!deque.isEmpty()) {
+            curr = deque.getFirst();
+            if (curr.children == null || curr.children.isEmpty() // 没有子孩子
+                    ||(prev != null && prev == curr.children.get(curr.children.size() - 1))) { // 前一个遍历的元素是最后一个子孩子，说明子树已经遍历完了
+                result.add(curr.val);
+                prev = curr;
+                deque.removeFirst();
+            } else {
+                // 有孩子先处理孩子
+                int size = curr.children.size();
+                for (int i = size - 1; i >= 0; i--) {
+                    Node child = curr.children.get(i);
+                    if (child != null) {
+                        deque.addFirst(child);
+                    }
+                }
+            }
+        }
+    }
+
+    public void postorderReserve(Node root, List<Integer> result) {
+
+        if (root == null) {
+            return;
+        }
+
+        if (root.children != null) {
+            for (Node n : root.children) {
+                postorderReserve(n, result);
+            }
+        }
+
+        result.add(root.val);
+    }
+}
diff --git a/[0590][N-ary Tree postorder Traversal]/src/SolutionTest.java b/[0590][N-ary Tree postorder Traversal]/src/SolutionTest.java
new file mode 100644
index 0000000..36f1259
--- /dev/null
+++ b/[0590][N-ary Tree postorder Traversal]/src/SolutionTest.java	
@@ -0,0 +1,35 @@
+import org.junit.Assert;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+import static org.junit.Assert.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-03 10:47
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void postorder() {
+        Solution s = new Solution();
+
+        Node root = new Node(1);
+        root.children = new ArrayList<>();
+        root.children.add(new Node(3));
+        root.children.add(new Node(2));
+        root.children.add(new Node(4));
+        root.children.get(0).children = new ArrayList<>();
+        root.children.get(0).children.add(new Node(5));
+        root.children.get(0).children.add(new Node(6));
+
+        List<Integer> result = Arrays.asList(5,6,3,2,4,1);
+
+        Assert.assertEquals(result, s.postorder(root));
+    }
+}
\ No newline at end of file

From 1b0d9b2b550b7d0e1a1b4371931507eab660f8f0 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Sat, 4 Jul 2020 16:38:51 +0800
Subject: [PATCH 13/19] commit

Change-Id: Iff97484d4b18b71009ad166d6370bade0adbab35
---
 .idea/modules.xml                             |   4 +
 .idea/workspace.xml                           | 157 ++++++++++--------
 ...[0594][Longest Harmonious Subsequence].iml |  21 +++
 .../src/Solution.java                         |  78 +++++++++
 .../src/SolutionTest.java                     |  26 +++
 .../[0598][Range Addition II].iml             |  21 +++
 [0598][Range Addition II]/src/Solution.java   |  29 ++++
 .../src/SolutionTest.java                     |  26 +++
 ...[0599][Minimum Index Sum of Two Lists].iml |  21 +++
 .../src/Solution.java                         |  39 +++++
 .../src/SolutionTest.java                     |  34 ++++
 ...637][Average of Levels in Binary Tree].iml |  11 ++
 .../src/Solution.java                         |  48 ++++++
 .../src/TreeNode.java                         |  13 ++
 14 files changed, 456 insertions(+), 72 deletions(-)
 create mode 100644 [0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml
 create mode 100644 [0594][Longest Harmonious Subsequence]/src/Solution.java
 create mode 100644 [0594][Longest Harmonious Subsequence]/src/SolutionTest.java
 create mode 100644 [0598][Range Addition II]/[0598][Range Addition II].iml
 create mode 100644 [0598][Range Addition II]/src/Solution.java
 create mode 100644 [0598][Range Addition II]/src/SolutionTest.java
 create mode 100644 [0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml
 create mode 100644 [0599][Minimum Index Sum of Two Lists]/src/Solution.java
 create mode 100644 [0599][Minimum Index Sum of Two Lists]/src/SolutionTest.java
 create mode 100644 [0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml
 create mode 100644 [0637][Average of Levels in Binary Tree]/src/Solution.java
 create mode 100644 [0637][Average of Levels in Binary Tree]/src/TreeNode.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index e6b4609..84d7a15 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -263,7 +263,11 @@
       <module fileurl="file://$PROJECT_DIR$/[0575][Distribute Candies]/[0575][Distribute Candies].iml" filepath="$PROJECT_DIR$/[0575][Distribute Candies]/[0575][Distribute Candies].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml" filepath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml" filepath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml" filepath="$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0598][Range Addition II]/[0598][Range Addition II].iml" filepath="$PROJECT_DIR$/[0598][Range Addition II]/[0598][Range Addition II].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml" filepath="$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" filepath="$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml" filepath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" filepath="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index a5b758c..f34fe15 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,16 +2,18 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0575][Distribute Candies]/[0575][Distribute Candies].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0575][Distribute Candies]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0575][Distribute Candies]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/src/Node.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/src/Node.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0598][Range Addition II]/[0598][Range Addition II].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0598][Range Addition II]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0598][Range Addition II]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/src/TreeNode.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -29,8 +31,8 @@
   <component name="FileTemplateManagerImpl">
     <option name="RECENT_TEMPLATES">
       <list>
-        <option value="Class" />
         <option value="JUnit4 Test Class" />
+        <option value="Class" />
       </list>
     </option>
   </component>
@@ -98,56 +100,54 @@
       <recent name="" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.postorder">
-    <configuration name="SolutionTest.distributeCandies" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0575][Distribute Candies]" />
+  <component name="RunManager" selected="JUnit.SolutionTest (1)">
+    <configuration name="SolutionTest (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0599][Minimum Index Sum of Two Lists]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="distributeCandies" />
-      <option name="TEST_OBJECT" value="method" />
+      <option name="TEST_OBJECT" value="class" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.isSubtree" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0572][Subtree of Another Tree]" />
+    <configuration name="SolutionTest" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0594][Longest Harmonious Subsequence]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="isSubtree" />
-      <option name="TEST_OBJECT" value="method" />
+      <option name="TEST_OBJECT" value="class" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.isSubtree2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0572][Subtree of Another Tree]" />
+    <configuration name="SolutionTest.findLHS" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0594][Longest Harmonious Subsequence]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="isSubtree2" />
+      <option name="METHOD_NAME" value="findLHS" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.matrixReshape" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0566][Reshape the Matrix]" />
+    <configuration name="SolutionTest.findRestaurant" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0599][Minimum Index Sum of Two Lists]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="matrixReshape" />
+      <option name="METHOD_NAME" value="findRestaurant" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.postorder" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0590][N-ary Tree postorder Traversal]" />
+    <configuration name="SolutionTest.maxCount" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0598][Range Addition II]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="postorder" />
+      <option name="METHOD_NAME" value="maxCount" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -162,19 +162,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.matrixReshape" />
-      <item itemvalue="JUnit.SolutionTest.isSubtree" />
-      <item itemvalue="JUnit.SolutionTest.isSubtree2" />
-      <item itemvalue="JUnit.SolutionTest.distributeCandies" />
-      <item itemvalue="JUnit.SolutionTest.postorder" />
+      <item itemvalue="JUnit.SolutionTest.findLHS" />
+      <item itemvalue="JUnit.SolutionTest" />
+      <item itemvalue="JUnit.SolutionTest.maxCount" />
+      <item itemvalue="JUnit.SolutionTest.findRestaurant" />
+      <item itemvalue="JUnit.SolutionTest (1)" />
     </list>
     <recent_temporary>
       <list>
-        <item itemvalue="JUnit.SolutionTest.postorder" />
-        <item itemvalue="JUnit.SolutionTest.distributeCandies" />
-        <item itemvalue="JUnit.SolutionTest.isSubtree2" />
-        <item itemvalue="JUnit.SolutionTest.isSubtree" />
-        <item itemvalue="JUnit.SolutionTest.matrixReshape" />
+        <item itemvalue="JUnit.SolutionTest (1)" />
+        <item itemvalue="JUnit.SolutionTest.findRestaurant" />
+        <item itemvalue="JUnit.SolutionTest.maxCount" />
+        <item itemvalue="JUnit.SolutionTest.findLHS" />
+        <item itemvalue="JUnit.SolutionTest" />
       </list>
     </recent_temporary>
   </component>
@@ -242,6 +242,7 @@
       <workItem from="1593647589537" duration="5696000" />
       <workItem from="1593741566759" duration="56000" />
       <workItem from="1593741641747" duration="4341000" />
+      <workItem from="1593846317598" duration="5382000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -614,10 +615,10 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1877" height="402" key="GridCell.Tab.0.bottom" timestamp="1593746004768">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state width="1397" height="224" key="GridCell.Tab.0.bottom" timestamp="1593851609944">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="294" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593653018746" />
+    <state width="1397" height="224" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593851609944" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
     <state width="1877" height="402" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004768" />
     <state width="1397" height="202" key="GridCell.Tab.0.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
@@ -630,10 +631,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1877" height="402" key="GridCell.Tab.0.center" timestamp="1593746004767">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state width="1397" height="224" key="GridCell.Tab.0.center" timestamp="1593851609943">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="294" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593653018744" />
+    <state width="1397" height="224" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593851609943" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
     <state width="1877" height="402" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123892" />
@@ -646,10 +647,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1877" height="402" key="GridCell.Tab.0.left" timestamp="1593746004766">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state width="1397" height="224" key="GridCell.Tab.0.left" timestamp="1593851609943">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="294" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593653018744" />
+    <state width="1397" height="224" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593851609943" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
     <state width="1877" height="402" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004766" />
     <state width="1397" height="202" key="GridCell.Tab.0.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123891" />
@@ -662,10 +663,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1877" height="402" key="GridCell.Tab.0.right" timestamp="1593746004767">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state width="1397" height="224" key="GridCell.Tab.0.right" timestamp="1593851609944">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="294" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593653018745" />
+    <state width="1397" height="224" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593851609944" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
     <state width="1877" height="402" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
@@ -678,37 +679,37 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1877" height="402" key="GridCell.Tab.1.bottom" timestamp="1593746004770">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state width="1397" height="367" key="GridCell.Tab.1.bottom" timestamp="1593851475108">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593652970230" />
+    <state width="1397" height="367" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593851475108" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
     <state width="1877" height="402" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123896" />
     <state width="1397" height="324" key="GridCell.Tab.1.bottom/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529748" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1877" height="402" key="GridCell.Tab.1.center" timestamp="1593746004769">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state width="1397" height="367" key="GridCell.Tab.1.center" timestamp="1593851475107">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593652970229" />
+    <state width="1397" height="367" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593851475107" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
     <state width="1877" height="402" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1397" height="324" key="GridCell.Tab.1.center/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1877" height="402" key="GridCell.Tab.1.left" timestamp="1593746004769">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state width="1397" height="367" key="GridCell.Tab.1.left" timestamp="1593851475107">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593652970229" />
+    <state width="1397" height="367" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593851475107" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
     <state width="1877" height="402" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123894" />
     <state width="1397" height="324" key="GridCell.Tab.1.left/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529746" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1877" height="402" key="GridCell.Tab.1.right" timestamp="1593746004770">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state width="1397" height="367" key="GridCell.Tab.1.right" timestamp="1593851475108">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="324" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593652970229" />
+    <state width="1397" height="367" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593851475108" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
     <state width="1877" height="402" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
@@ -733,28 +734,32 @@
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593744481391">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593851020543">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593652321235" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593851020543" />
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744481391" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593744477730">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593851017305">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593652317964" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593851017305" />
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
     <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744477730" />
+    <state x="252" y="186" key="com.intellij.xdebugger.impl.breakpoints.ui.BreakpointsDialogFactory$2" timestamp="1593851354569">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="252" y="186" key="com.intellij.xdebugger.impl.breakpoints.ui.BreakpointsDialogFactory$2/0.0.1440.900@0.0.1440.900" timestamp="1593851354569" />
     <state x="402" y="49" width="636" height="801" key="find.popup" timestamp="1593262516580">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="1618" y="163" width="1147" height="750" key="new project wizard" timestamp="1593743567550">
-      <screen x="1440" y="0" width="1920" height="1080" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593851568121">
+      <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593651708233" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593851568121" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593743567550" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
@@ -1045,6 +1050,11 @@
           <line>42</line>
           <option name="timeStamp" value="131" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/src/Solution.java</url>
+          <line>23</line>
+          <option name="timeStamp" value="135" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
@@ -1064,4 +1074,7 @@
       </breakpoints>
     </breakpoint-manager>
   </component>
+  <component name="com.intellij.coverage.CoverageDataManagerImpl">
+    <SUITE FILE_PATH="coverage/leetcode$SolutionTest_findLHS.ic" NAME="SolutionTest.findLHS Coverage Results" MODIFIED="1593847358758" SOURCE_PROVIDER="com.intellij.coverage.DefaultCoverageFileProvider" RUNNER="idea" COVERAGE_BY_TEST_ENABLED="false" COVERAGE_TRACING_ENABLED="false" />
+  </component>
 </project>
\ No newline at end of file
diff --git a/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml b/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].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>
\ No newline at end of file
diff --git a/[0594][Longest Harmonious Subsequence]/src/Solution.java b/[0594][Longest Harmonious Subsequence]/src/Solution.java
new file mode 100644
index 0000000..d3ec9aa
--- /dev/null
+++ b/[0594][Longest Harmonious Subsequence]/src/Solution.java	
@@ -0,0 +1,78 @@
+import java.util.Arrays;
+import java.util.Map;
+import java.util.SortedMap;
+import java.util.TreeMap;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 15:09
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+
+    /**
+     * 求每个元素的个数，再找相邻元素之和最大的
+     * 相邻指元素之差为1
+     *
+     * @param nums
+     * @return
+     */
+    public int findLHS(int[] nums) {
+        if (nums == null || nums.length < 2) {
+            return 0;
+        }
+
+        int max = 0;
+        Arrays.sort(nums);
+
+        int prevNum = Integer.MIN_VALUE;
+        int prevCnt = 0;
+        for (int i = 0; i < nums.length; ) {
+            int next = i + 1;
+            while (next < nums.length && nums[next] == nums[i]) {
+                next++;
+            }
+            if (prevNum + 1 == nums[i]) {
+                max = Math.max(max, prevCnt + next - i);
+            }
+
+            prevNum = nums[i];
+            prevCnt = next - i;
+            i = next;
+
+        }
+
+        return max;
+    }
+
+    /**
+     * 求每个元素的个数，再找相邻元素之和最大的
+     * 相邻指元素之差为1
+     *
+     * @param nums
+     * @return
+     */
+    public int findLHS2(int[] nums) {
+        if (nums == null || nums.length < 2) {
+            return 0;
+        }
+
+        SortedMap<Integer, Integer> map = new TreeMap<>();
+        for (int n : nums) {
+            map.put(n, map.getOrDefault(n, 0) + 1);
+        }
+
+        int max = 0;
+        Map.Entry<Integer, Integer> prev = null; // 前一个遍历的元素
+        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+            if (prev != null && prev.getKey() + 1 == entry.getKey()) { // 相邻元素
+                max = Math.max(max, prev.getValue() + entry.getValue()); // 取较大的
+            }
+            prev = entry;
+        }
+
+        return max;
+    }
+}
diff --git a/[0594][Longest Harmonious Subsequence]/src/SolutionTest.java b/[0594][Longest Harmonious Subsequence]/src/SolutionTest.java
new file mode 100644
index 0000000..f51d032
--- /dev/null
+++ b/[0594][Longest Harmonious Subsequence]/src/SolutionTest.java	
@@ -0,0 +1,26 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 15:20
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findLHS() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{1, 3, 2, 2, 5, 2, 3, 7}, 5},
+                {new int[]{-2, 0, 2, 2, 5, 5, 5, 5}, 0},
+                {new int[]{1, 1, 1, 1}, 0},
+        };
+
+        for (Object[] d : data) {
+            int result = s.findLHS((int[]) d[0]);
+            Assert.assertEquals(d[1], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0598][Range Addition II]/[0598][Range Addition II].iml b/[0598][Range Addition II]/[0598][Range Addition II].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0598][Range Addition II]/[0598][Range Addition II].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>
\ No newline at end of file
diff --git a/[0598][Range Addition II]/src/Solution.java b/[0598][Range Addition II]/src/Solution.java
new file mode 100644
index 0000000..49747ce
--- /dev/null
+++ b/[0598][Range Addition II]/src/Solution.java	
@@ -0,0 +1,29 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 15:50
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 数组的第一元素一定是最大的，要找最大的元素个数，只要找ops中min(ops[0])*min(ops[1])
+     *
+     * @param m
+     * @param n
+     * @param ops
+     * @return
+     */
+    public int maxCount(int m, int n, int[][] ops) {
+
+
+        int row = m;
+        int col = n;
+        for (int[] op : ops) {
+            row = Math.min(op[0], row);
+            col = Math.min(op[1], col);
+        }
+
+        return row * col;
+    }
+}
diff --git a/[0598][Range Addition II]/src/SolutionTest.java b/[0598][Range Addition II]/src/SolutionTest.java
new file mode 100644
index 0000000..8550371
--- /dev/null
+++ b/[0598][Range Addition II]/src/SolutionTest.java	
@@ -0,0 +1,26 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 16:04
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void maxCount() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {3, 3, new int[][]{{2, 2}, {3, 3}}, 4},
+                {3, 3, new int[][]{{2, 3}, {3, 2}}, 4},
+                {3, 3, new int[][]{}, 9},
+        };
+
+        for (Object[] d : data) {
+            Object result = s.maxCount((int) d[0], (int)d[1], (int[][]) d[2]);
+            Assert.assertEquals(d[3], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml b/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].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>
\ No newline at end of file
diff --git a/[0599][Minimum Index Sum of Two Lists]/src/Solution.java b/[0599][Minimum Index Sum of Two Lists]/src/Solution.java
new file mode 100644
index 0000000..238a202
--- /dev/null
+++ b/[0599][Minimum Index Sum of Two Lists]/src/Solution.java	
@@ -0,0 +1,39 @@
+import java.util.*;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 16:13
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public String[] findRestaurant(String[] list1, String[] list2) {
+        if (list1 == null || list2 == null){
+            return null;
+        }
+
+        Map<String,Integer> map = new HashMap<>();
+        for (int i = 0; i < list1.length; i++) {
+            map.put(list1[i], i);
+        }
+        List<String> result = new ArrayList<>(list1.length);
+
+        int min = Integer.MAX_VALUE;
+
+        for (int i = 0; i < list2.length; i++) {
+            if (map.containsKey(list2[i])) {
+                if (map.get(list2[i]) + i < min) {
+                    result.clear();
+                    min = map.get(list2[i]) + i;
+                    result.add(list2[i]);
+                } else if (map.get(list2[i]) + i == min) {
+                    result.add(list2[i]);
+                }
+
+            }
+        }
+
+        return result.toArray(new String[0]);
+    }
+}
diff --git a/[0599][Minimum Index Sum of Two Lists]/src/SolutionTest.java b/[0599][Minimum Index Sum of Two Lists]/src/SolutionTest.java
new file mode 100644
index 0000000..671b81b
--- /dev/null
+++ b/[0599][Minimum Index Sum of Two Lists]/src/SolutionTest.java	
@@ -0,0 +1,34 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 16:23
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findRestaurant() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {
+                        new String[]{"Shogun", "Tapioca Express", "Burger King", "KFC"},
+                        new String[]{"Piatti", "The Grill at Torrey Pines", "Hungry Hunter Steakhouse", "Shogun"},
+                        new String[]{"Shogun"},
+                },
+                {
+                        new String[]{"Shogun","Tapioca Express","Burger King","KFC"},
+                        new String[]{"KFC","Shogun","Burger King"},
+                        new String[]{"Shogun"},
+                }
+
+        };
+
+        for (Object[] d : data) {
+            String[] result = s.findRestaurant((String[]) d[0], (String[]) d[1]);
+            Assert.assertArrayEquals((String[]) d[2], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml b/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in 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>
\ No newline at end of file
diff --git a/[0637][Average of Levels in Binary Tree]/src/Solution.java b/[0637][Average of Levels in Binary Tree]/src/Solution.java
new file mode 100644
index 0000000..9e113fb
--- /dev/null
+++ b/[0637][Average of Levels in Binary Tree]/src/Solution.java	
@@ -0,0 +1,48 @@
+import java.util.ArrayList;
+import java.util.Deque;
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 16:32
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public List<Double> averageOfLevels(TreeNode root) {
+        List<Double> result = new ArrayList<>();
+
+        if (root == null) {
+            return result;
+        }
+
+        Deque<TreeNode> curr = new LinkedList<>();
+        Deque<TreeNode> next = new LinkedList<>();
+        curr.addFirst(root);
+
+        while (!curr.isEmpty()) {
+
+            double count = curr.size();
+            double sum = 0;
+            while (!curr.isEmpty()) {
+                TreeNode node = curr.removeFirst();
+                sum += node.val;
+
+                if (node.left != null) {
+                    next.addLast(node.left);
+                }
+                if (node.right != null) {
+                    next.addLast(node.right);
+                }
+            }
+
+            result.add(sum / count);
+            curr = next;
+            next = new LinkedList<>();
+        }
+
+        return result;
+    }
+}
diff --git a/[0637][Average of Levels in Binary Tree]/src/TreeNode.java b/[0637][Average of Levels in Binary Tree]/src/TreeNode.java
new file mode 100644
index 0000000..5554849
--- /dev/null
+++ b/[0637][Average of Levels in Binary Tree]/src/TreeNode.java	
@@ -0,0 +1,13 @@
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-09 18:52
+ **/
+public class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+
+    TreeNode(int x) {
+        val = x;
+    }
+}

From 42224d22c543fb9b4e911c8ad0260f3a622a57b4 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Sat, 4 Jul 2020 20:56:46 +0800
Subject: [PATCH 14/19] commit

Change-Id: I691b70a8c8e75476ab877915ebe2dfc7f7a0dc34
---
 .idea/modules.xml                             |   5 +
 .idea/workspace.xml                           | 122 ++++++++++--------
 ...Shortest Unsorted Continuous Subarray].iml |  21 +++
 .../src/Solution.java                         |  39 ++++++
 .../src/SolutionTest.java                     |  26 ++++
 .../[0605][Can Place Flowers].iml             |  21 +++
 [0605][Can Place Flowers]/src/Solution.java   |  54 ++++++++
 .../src/SolutionTest.java                     |  31 +++++
 ...06][Construct String from Binary Tree].iml |  21 +++
 .../src/Solution.java                         |  41 ++++++
 .../src/SolutionTest.java                     |  33 +++++
 .../src/TreeNode.java                         |  16 +++
 ...628][Maximum Product of Three Numbers].iml |  21 +++
 .../src/Solution.java                         |  29 +++++
 .../src/SolutionTest.java                     |  24 ++++
 .../[0657][Robot Return to Origin].iml        |  11 ++
 .../src/Solution.java                         |  34 +++++
 17 files changed, 492 insertions(+), 57 deletions(-)
 create mode 100644 [0581][Shortest Unsorted Continuous Subarray]/[0581][Shortest Unsorted Continuous Subarray].iml
 create mode 100644 [0581][Shortest Unsorted Continuous Subarray]/src/Solution.java
 create mode 100644 [0581][Shortest Unsorted Continuous Subarray]/src/SolutionTest.java
 create mode 100644 [0605][Can Place Flowers]/[0605][Can Place Flowers].iml
 create mode 100644 [0605][Can Place Flowers]/src/Solution.java
 create mode 100644 [0605][Can Place Flowers]/src/SolutionTest.java
 create mode 100644 [0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml
 create mode 100644 [0606][Construct String from Binary Tree]/src/Solution.java
 create mode 100644 [0606][Construct String from Binary Tree]/src/SolutionTest.java
 create mode 100644 [0606][Construct String from Binary Tree]/src/TreeNode.java
 create mode 100644 [0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml
 create mode 100644 [0628][Maximum Product of Three Numbers]/src/Solution.java
 create mode 100644 [0628][Maximum Product of Three Numbers]/src/SolutionTest.java
 create mode 100644 [0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml
 create mode 100644 [0657][Robot Return to Origin]/src/Solution.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index 84d7a15..eeab3fb 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -261,13 +261,18 @@
       <module fileurl="file://$PROJECT_DIR$/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml" filepath="$PROJECT_DIR$/[0566][Reshape the Matrix]/[0566][Reshape the Matrix].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml" filepath="$PROJECT_DIR$/[0572][Subtree of Another Tree]/[0572][Subtree of Another Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0575][Distribute Candies]/[0575][Distribute Candies].iml" filepath="$PROJECT_DIR$/[0575][Distribute Candies]/[0575][Distribute Candies].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0581][Shortest Unsorted Continuous Subarray]/[0581][Shortest Unsorted Continuous Subarray].iml" filepath="$PROJECT_DIR$/[0581][Shortest Unsorted Continuous Subarray]/[0581][Shortest Unsorted Continuous Subarray].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml" filepath="$PROJECT_DIR$/[0589][N-ary Tree Preorder Traversal]/[0589][N-ary Tree Preorder Traversal].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml" filepath="$PROJECT_DIR$/[0590][N-ary Tree postorder Traversal]/[0590][N-ary Tree postorder Traversal].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml" filepath="$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0598][Range Addition II]/[0598][Range Addition II].iml" filepath="$PROJECT_DIR$/[0598][Range Addition II]/[0598][Range Addition II].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml" filepath="$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0605][Can Place Flowers]/[0605][Can Place Flowers].iml" filepath="$PROJECT_DIR$/[0605][Can Place Flowers]/[0605][Can Place Flowers].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml" filepath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" filepath="$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml" filepath="$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml" filepath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml" filepath="$PROJECT_DIR$/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" filepath="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index f34fe15..2c0e64c 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,18 +2,20 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/[0594][Longest Harmonious Subsequence].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0594][Longest Harmonious Subsequence]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0598][Range Addition II]/[0598][Range Addition II].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0598][Range Addition II]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0598][Range Addition II]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/[0599][Minimum Index Sum of Two Lists].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0599][Minimum Index Sum of Two Lists]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0581][Shortest Unsorted Continuous Subarray]/[0581][Shortest Unsorted Continuous Subarray].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0581][Shortest Unsorted Continuous Subarray]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0581][Shortest Unsorted Continuous Subarray]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0605][Can Place Flowers]/[0605][Can Place Flowers].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0605][Can Place Flowers]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0605][Can Place Flowers]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0657][Robot Return to Origin]/src/Solution.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -100,9 +102,9 @@
       <recent name="" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest (1)">
+  <component name="RunManager" selected="JUnit.SolutionTest.maximumProduct">
     <configuration name="SolutionTest (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0599][Minimum Index Sum of Two Lists]" />
+      <module name="[0606][Construct String from Binary Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
       <option name="TEST_OBJECT" value="class" />
@@ -111,43 +113,44 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0594][Longest Harmonious Subsequence]" />
+    <configuration name="SolutionTest.canPlaceFlowers" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0605][Can Place Flowers]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="TEST_OBJECT" value="class" />
+      <option name="METHOD_NAME" value="canPlaceFlowers" />
+      <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.findLHS" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0594][Longest Harmonious Subsequence]" />
+    <configuration name="SolutionTest.maximumProduct" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0628][Maximum Product of Three Numbers]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findLHS" />
+      <option name="METHOD_NAME" value="maximumProduct" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.findRestaurant" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0599][Minimum Index Sum of Two Lists]" />
+    <configuration name="SolutionTest.tree2str" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0606][Construct String from Binary Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findRestaurant" />
+      <option name="METHOD_NAME" value="tree2str" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.maxCount" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0598][Range Addition II]" />
+    <configuration name="SolutionTest.tree2str2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0606][Construct String from Binary Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="maxCount" />
+      <option name="METHOD_NAME" value="tree2str2" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -162,19 +165,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.findLHS" />
-      <item itemvalue="JUnit.SolutionTest" />
-      <item itemvalue="JUnit.SolutionTest.maxCount" />
-      <item itemvalue="JUnit.SolutionTest.findRestaurant" />
+      <item itemvalue="JUnit.SolutionTest.canPlaceFlowers" />
+      <item itemvalue="JUnit.SolutionTest.tree2str" />
+      <item itemvalue="JUnit.SolutionTest.tree2str2" />
       <item itemvalue="JUnit.SolutionTest (1)" />
+      <item itemvalue="JUnit.SolutionTest.maximumProduct" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.maximumProduct" />
         <item itemvalue="JUnit.SolutionTest (1)" />
-        <item itemvalue="JUnit.SolutionTest.findRestaurant" />
-        <item itemvalue="JUnit.SolutionTest.maxCount" />
-        <item itemvalue="JUnit.SolutionTest.findLHS" />
-        <item itemvalue="JUnit.SolutionTest" />
+        <item itemvalue="JUnit.SolutionTest.tree2str2" />
+        <item itemvalue="JUnit.SolutionTest.tree2str" />
+        <item itemvalue="JUnit.SolutionTest.canPlaceFlowers" />
       </list>
     </recent_temporary>
   </component>
@@ -242,7 +245,7 @@
       <workItem from="1593647589537" duration="5696000" />
       <workItem from="1593741566759" duration="56000" />
       <workItem from="1593741641747" duration="4341000" />
-      <workItem from="1593846317598" duration="5382000" />
+      <workItem from="1593846317598" duration="10824000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -615,10 +618,10 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1397" height="224" key="GridCell.Tab.0.bottom" timestamp="1593851609944">
+    <state width="1397" height="224" key="GridCell.Tab.0.bottom" timestamp="1593866808668">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="224" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593851609944" />
+    <state width="1397" height="224" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593866808668" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
     <state width="1877" height="402" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004768" />
     <state width="1397" height="202" key="GridCell.Tab.0.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
@@ -631,10 +634,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1397" height="224" key="GridCell.Tab.0.center" timestamp="1593851609943">
+    <state width="1397" height="224" key="GridCell.Tab.0.center" timestamp="1593866808666">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="224" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593851609943" />
+    <state width="1397" height="224" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593866808666" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
     <state width="1877" height="402" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123892" />
@@ -647,10 +650,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1397" height="224" key="GridCell.Tab.0.left" timestamp="1593851609943">
+    <state width="1397" height="224" key="GridCell.Tab.0.left" timestamp="1593866808665">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="224" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593851609943" />
+    <state width="1397" height="224" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593866808665" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
     <state width="1877" height="402" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004766" />
     <state width="1397" height="202" key="GridCell.Tab.0.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123891" />
@@ -663,10 +666,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1397" height="224" key="GridCell.Tab.0.right" timestamp="1593851609944">
+    <state width="1397" height="224" key="GridCell.Tab.0.right" timestamp="1593866808666">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="224" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593851609944" />
+    <state width="1397" height="224" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593866808666" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
     <state width="1877" height="402" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
@@ -679,37 +682,37 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1397" height="367" key="GridCell.Tab.1.bottom" timestamp="1593851475108">
+    <state width="1397" height="303" key="GridCell.Tab.1.bottom" timestamp="1593864255811">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="367" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593851475108" />
+    <state width="1397" height="303" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593864255811" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
     <state width="1877" height="402" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123896" />
     <state width="1397" height="324" key="GridCell.Tab.1.bottom/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529748" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1397" height="367" key="GridCell.Tab.1.center" timestamp="1593851475107">
+    <state width="1397" height="303" key="GridCell.Tab.1.center" timestamp="1593864255810">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="367" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593851475107" />
+    <state width="1397" height="303" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593864255810" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
     <state width="1877" height="402" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1397" height="324" key="GridCell.Tab.1.center/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1397" height="367" key="GridCell.Tab.1.left" timestamp="1593851475107">
+    <state width="1397" height="303" key="GridCell.Tab.1.left" timestamp="1593864255810">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="367" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593851475107" />
+    <state width="1397" height="303" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593864255810" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
     <state width="1877" height="402" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123894" />
     <state width="1397" height="324" key="GridCell.Tab.1.left/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529746" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1397" height="367" key="GridCell.Tab.1.right" timestamp="1593851475108">
+    <state width="1397" height="303" key="GridCell.Tab.1.right" timestamp="1593864255811">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="367" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593851475108" />
+    <state width="1397" height="303" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593864255811" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
     <state width="1877" height="402" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
@@ -734,18 +737,18 @@
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593851020543">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593866757997">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593851020543" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593866757997" />
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744481391" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593851017305">
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593866754399">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593851017305" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593866754399" />
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
     <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744477730" />
     <state x="252" y="186" key="com.intellij.xdebugger.impl.breakpoints.ui.BreakpointsDialogFactory$2" timestamp="1593851354569">
@@ -756,10 +759,10 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593851568121">
+    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593867072629">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593851568121" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593867072629" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593743567550" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
@@ -1055,6 +1058,11 @@
           <line>23</line>
           <option name="timeStamp" value="135" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0605][Can Place Flowers]/src/Solution.java</url>
+          <line>18</line>
+          <option name="timeStamp" value="140" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
diff --git a/[0581][Shortest Unsorted Continuous Subarray]/[0581][Shortest Unsorted Continuous Subarray].iml b/[0581][Shortest Unsorted Continuous Subarray]/[0581][Shortest Unsorted Continuous Subarray].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0581][Shortest Unsorted Continuous Subarray]/[0581][Shortest Unsorted Continuous Subarray].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>
\ No newline at end of file
diff --git a/[0581][Shortest Unsorted Continuous Subarray]/src/Solution.java b/[0581][Shortest Unsorted Continuous Subarray]/src/Solution.java
new file mode 100644
index 0000000..bace39f
--- /dev/null
+++ b/[0581][Shortest Unsorted Continuous Subarray]/src/Solution.java	
@@ -0,0 +1,39 @@
+import java.util.Arrays;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 19:24
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public int findUnsortedSubarray(int[] nums) {
+        if (nums == null || nums.length < 2) {
+            return 0;
+        }
+
+        int[] sorted = Arrays.copyOf(nums, nums.length);
+        Arrays.sort(sorted);
+
+
+        int diffStart = 0; // 从开始找第一个位置变化的下标
+        while (diffStart < nums.length && nums[diffStart] == sorted[diffStart]) {
+            diffStart++;
+        }
+
+        if (diffStart >= nums.length) {
+            return 0;
+        }
+
+
+        int diffEnd = nums.length - 1; // 从最后找第一个位置变化的下标
+        while (diffEnd >= 0 && nums[diffEnd] == sorted[diffEnd]) {
+            diffEnd--;
+        }
+
+
+
+        return diffEnd - diffStart + 1;
+    }
+}
diff --git a/[0581][Shortest Unsorted Continuous Subarray]/src/SolutionTest.java b/[0581][Shortest Unsorted Continuous Subarray]/src/SolutionTest.java
new file mode 100644
index 0000000..dcda38c
--- /dev/null
+++ b/[0581][Shortest Unsorted Continuous Subarray]/src/SolutionTest.java	
@@ -0,0 +1,26 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 19:32
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findUnsortedSubarray() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{2, 6, 4, 8, 10, 9, 15}, 5},
+                {new int[]{1, 2, 3, 4, 5, 6, 7}, 0},
+                {new int[]{7, 6, 5, 4, 3, 2, 1}, 7},
+        };
+
+        for (Object[] d : data) {
+            Object result = s.findUnsortedSubarray((int[]) d[0]);
+            Assert.assertEquals(d[1], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0605][Can Place Flowers]/[0605][Can Place Flowers].iml b/[0605][Can Place Flowers]/[0605][Can Place Flowers].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0605][Can Place Flowers]/[0605][Can Place Flowers].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>
\ No newline at end of file
diff --git a/[0605][Can Place Flowers]/src/Solution.java b/[0605][Can Place Flowers]/src/Solution.java
new file mode 100644
index 0000000..d6aed3c
--- /dev/null
+++ b/[0605][Can Place Flowers]/src/Solution.java	
@@ -0,0 +1,54 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 19:42
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public boolean canPlaceFlowers(int[] flowerbed, int n) {
+        if (flowerbed == null || flowerbed.length < 1) {
+            return false;
+        }
+
+        if (n < 1) {
+            return true;
+        }
+
+        // 找第一个1的位置
+        int firstOneIdx = 0;
+        while (firstOneIdx < flowerbed.length && flowerbed[firstOneIdx] == 0) {
+            firstOneIdx++;
+        }
+
+        // [0,0,0] => 2
+        // [0,0] => 1
+        // [0] => 0
+        int num = firstOneIdx / 2 + firstOneIdx % 2;
+
+        if (firstOneIdx >= flowerbed.length) {
+            return num >= n;
+        } else {
+            // [0,0,0,1] => 1
+            // [0,0,1] => 1
+            // [0,1] => 0
+            num -= firstOneIdx % 2;
+        }
+
+        int prev = flowerbed[firstOneIdx];
+        for (int i = firstOneIdx + 1; i < flowerbed.length; i++) {
+            if (prev == 0 && flowerbed[i] == 0) {
+                // i是最后一个，或者下一个位置也没有种花
+                if (i + 1 >= flowerbed.length || flowerbed[i + 1] == 0) {
+                    num++;
+                    flowerbed[i] = 1;
+                }
+            }
+
+            prev = flowerbed[i];
+        }
+
+
+        return num >= n;
+    }
+}
diff --git a/[0605][Can Place Flowers]/src/SolutionTest.java b/[0605][Can Place Flowers]/src/SolutionTest.java
new file mode 100644
index 0000000..b37b2f1
--- /dev/null
+++ b/[0605][Can Place Flowers]/src/SolutionTest.java	
@@ -0,0 +1,31 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 19:52
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void canPlaceFlowers() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{1, 0, 0, 0, 1}, 1, true},
+                {new int[]{1, 0, 0, 0, 1}, 2, false},
+                {new int[]{1, 0, 1, 0, 1}, 1, false},
+                {new int[]{1, 0, 1, 0, 0}, 2, false},
+                {new int[]{0, 0, 0, 0, 0}, 3, true},
+                {new int[]{1, 0, 0, 0, 0, 1}, 2, false},
+                {new int[]{1, 0, 0, 0, 0, 1}, 2, false},
+                {new int[]{ 0, 0, 1, 0, 1}, 1, true},
+        };
+
+        for (Object[] d : data) {
+            Object result = s.canPlaceFlowers((int[]) d[0], (Integer) d[1]);
+            Assert.assertEquals(d[2], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml b/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary 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>
\ No newline at end of file
diff --git a/[0606][Construct String from Binary Tree]/src/Solution.java b/[0606][Construct String from Binary Tree]/src/Solution.java
new file mode 100644
index 0000000..36c2245
--- /dev/null
+++ b/[0606][Construct String from Binary Tree]/src/Solution.java	
@@ -0,0 +1,41 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 20:09
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public String tree2str(TreeNode t) {
+        StringBuilder builder = new StringBuilder(100);
+        tree2str(t, builder);
+        return builder.toString();
+    }
+
+    private void tree2str(TreeNode root, StringBuilder builder) {
+        if (root == null) {
+            return;
+        }
+
+        builder.append(root.val);
+
+        if (root.left == null && root.right == null) {
+            return;
+        }
+
+        if (root.left != null && root.right == null) {
+            builder.append("(");
+            tree2str(root.left, builder);
+            builder.append(")");
+        }
+
+        if (root.right != null) {
+            builder.append("(");
+            tree2str(root.left, builder);
+            builder.append(")");
+            builder.append("(");
+            tree2str(root.right, builder);
+            builder.append(")");
+        }
+    }
+}
diff --git a/[0606][Construct String from Binary Tree]/src/SolutionTest.java b/[0606][Construct String from Binary Tree]/src/SolutionTest.java
new file mode 100644
index 0000000..08f47cc
--- /dev/null
+++ b/[0606][Construct String from Binary Tree]/src/SolutionTest.java	
@@ -0,0 +1,33 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 20:12
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void tree2str() {
+        TreeNode root = new TreeNode(1);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(3);
+        root.left.left = new TreeNode(4);
+
+        Solution s = new Solution();
+        Assert.assertEquals("1(2(4))(3)", s.tree2str(root));
+    }
+
+    @org.junit.Test
+    public void tree2str2() {
+        TreeNode root = new TreeNode(1);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(3);
+        root.left.right = new TreeNode(4);
+
+        Solution s = new Solution();
+        Assert.assertEquals("1(2()(4))(3)", s.tree2str(root));
+    }
+}
\ No newline at end of file
diff --git a/[0606][Construct String from Binary Tree]/src/TreeNode.java b/[0606][Construct String from Binary Tree]/src/TreeNode.java
new file mode 100644
index 0000000..8b88e24
--- /dev/null
+++ b/[0606][Construct String from Binary Tree]/src/TreeNode.java	
@@ -0,0 +1,16 @@
+/**
+ * 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;
+    }
+}
+
diff --git a/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml b/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].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>
\ No newline at end of file
diff --git a/[0628][Maximum Product of Three Numbers]/src/Solution.java b/[0628][Maximum Product of Three Numbers]/src/Solution.java
new file mode 100644
index 0000000..a39a8e8
--- /dev/null
+++ b/[0628][Maximum Product of Three Numbers]/src/Solution.java	
@@ -0,0 +1,29 @@
+import java.util.Arrays;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 20:23
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public int maximumProduct(int[] nums) {
+        if (nums == null || nums.length < 3) {
+            return 0;
+        }
+
+        Arrays.sort(nums);
+
+        int len = nums.length;
+
+        int max = nums[len - 1] * nums[len - 2] * nums[len - 3];
+
+        if (nums[1] < 0) { // 前两个是负数
+            max = Math.max(max, nums[0]*nums[1]*nums[len-1]);
+        }
+
+
+        return max;
+    }
+}
diff --git a/[0628][Maximum Product of Three Numbers]/src/SolutionTest.java b/[0628][Maximum Product of Three Numbers]/src/SolutionTest.java
new file mode 100644
index 0000000..04697b4
--- /dev/null
+++ b/[0628][Maximum Product of Three Numbers]/src/SolutionTest.java	
@@ -0,0 +1,24 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 20:45
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void maximumProduct() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{-4, -3, -2, -1, 60}, 720},
+        };
+
+        for (Object[] d : data) {
+            int result = s.maximumProduct((int[]) d[0]);
+            Assert.assertEquals(d[1], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml b/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].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>
\ No newline at end of file
diff --git a/[0657][Robot Return to Origin]/src/Solution.java b/[0657][Robot Return to Origin]/src/Solution.java
new file mode 100644
index 0000000..e02ca96
--- /dev/null
+++ b/[0657][Robot Return to Origin]/src/Solution.java	
@@ -0,0 +1,34 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-04 20:51
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public boolean judgeCircle(String moves) {
+        if (moves == null || moves.length() < 1) {
+            return true;
+        }
+
+        int[] pos = {0, 0};
+        for (int i = 0; i < moves.length(); i++) {
+            switch (moves.charAt(i)) {
+                case 'U':
+                    pos[1]++;
+                    break;
+                case 'D':
+                    pos[1]--;
+                    break;
+                case 'L':
+                    pos[0]--;
+                    break;
+                case 'R':
+                    pos[0]++;
+                    break;
+            }
+        }
+
+        return pos[0] == 0 && pos[1] == 0;
+    }
+}

From 948f0b829d895311069784dc7ad696a43e0835d9 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Sun, 5 Jul 2020 18:44:04 +0800
Subject: [PATCH 15/19] commit

Change-Id: Id5a1f40a8be85dd941a6e477563cc39b2019e8ce
---
 .idea/modules.xml                             |   4 +
 .idea/workspace.xml                           | 133 ++++++++++--------
 .../[0633][Sum of Square Numbers].iml         |  21 +++
 .../src/Solution.java                         |  36 +++++
 .../src/SolutionTest.java                     |  30 ++++
 .../[0643][Maximum Average Subarray I].iml    |  21 +++
 .../src/Solution.java                         |  28 ++++
 .../src/SolutionTest.java                     |  25 ++++
 [0645][Set Mismatch]/[0645][Set Mismatch].iml |  21 +++
 [0645][Set Mismatch]/src/Solution.java        |  43 ++++++
 [0645][Set Mismatch]/src/SolutionTest.java    |  25 ++++
 .../[0653][Two Sum IV - Input is a BST].iml   |  21 +++
 .../src/Solution.java                         |  69 +++++++++
 .../src/SolutionTest.java                     |  19 +++
 .../src/TreeNode.java                         |  13 ++
 15 files changed, 447 insertions(+), 62 deletions(-)
 create mode 100644 [0633][Sum of Square Numbers]/[0633][Sum of Square Numbers].iml
 create mode 100644 [0633][Sum of Square Numbers]/src/Solution.java
 create mode 100644 [0633][Sum of Square Numbers]/src/SolutionTest.java
 create mode 100644 [0643][Maximum Average Subarray I]/[0643][Maximum Average Subarray I].iml
 create mode 100644 [0643][Maximum Average Subarray I]/src/Solution.java
 create mode 100644 [0643][Maximum Average Subarray I]/src/SolutionTest.java
 create mode 100644 [0645][Set Mismatch]/[0645][Set Mismatch].iml
 create mode 100644 [0645][Set Mismatch]/src/Solution.java
 create mode 100644 [0645][Set Mismatch]/src/SolutionTest.java
 create mode 100644 [0653][Two Sum IV - Input is a BST]/[0653][Two Sum IV - Input is a BST].iml
 create mode 100644 [0653][Two Sum IV - Input is a BST]/src/Solution.java
 create mode 100644 [0653][Two Sum IV - Input is a BST]/src/SolutionTest.java
 create mode 100644 [0653][Two Sum IV - Input is a BST]/src/TreeNode.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index eeab3fb..a13d1d7 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -271,7 +271,11 @@
       <module fileurl="file://$PROJECT_DIR$/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml" filepath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" filepath="$PROJECT_DIR$/[0617][Merge Two Binary Trees]/[0617][Merge Two Binary Trees].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml" filepath="$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0633][Sum of Square Numbers]/[0633][Sum of Square Numbers].iml" filepath="$PROJECT_DIR$/[0633][Sum of Square Numbers]/[0633][Sum of Square Numbers].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml" filepath="$PROJECT_DIR$/[0637][Average of Levels in Binary Tree]/[0637][Average of Levels in Binary Tree].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0643][Maximum Average Subarray I]/[0643][Maximum Average Subarray I].iml" filepath="$PROJECT_DIR$/[0643][Maximum Average Subarray I]/[0643][Maximum Average Subarray I].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0645][Set Mismatch]/[0645][Set Mismatch].iml" filepath="$PROJECT_DIR$/[0645][Set Mismatch]/[0645][Set Mismatch].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/[0653][Two Sum IV - Input is a BST].iml" filepath="$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/[0653][Two Sum IV - Input is a BST].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml" filepath="$PROJECT_DIR$/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 2c0e64c..41b8758 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,20 +2,18 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0581][Shortest Unsorted Continuous Subarray]/[0581][Shortest Unsorted Continuous Subarray].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0581][Shortest Unsorted Continuous Subarray]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0581][Shortest Unsorted Continuous Subarray]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0605][Can Place Flowers]/[0605][Can Place Flowers].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0605][Can Place Flowers]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0605][Can Place Flowers]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/[0606][Construct String from Binary Tree].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0606][Construct String from Binary Tree]/src/TreeNode.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/[0628][Maximum Product of Three Numbers].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0628][Maximum Product of Three Numbers]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0657][Robot Return to Origin]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0633][Sum of Square Numbers]/[0633][Sum of Square Numbers].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0633][Sum of Square Numbers]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0633][Sum of Square Numbers]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0643][Maximum Average Subarray I]/[0643][Maximum Average Subarray I].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0643][Maximum Average Subarray I]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0643][Maximum Average Subarray I]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0645][Set Mismatch]/[0645][Set Mismatch].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0645][Set Mismatch]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0645][Set Mismatch]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/src/TreeNode.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -33,8 +31,8 @@
   <component name="FileTemplateManagerImpl">
     <option name="RECENT_TEMPLATES">
       <list>
-        <option value="JUnit4 Test Class" />
         <option value="Class" />
+        <option value="JUnit4 Test Class" />
       </list>
     </option>
   </component>
@@ -102,55 +100,56 @@
       <recent name="" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.maximumProduct">
-    <configuration name="SolutionTest (1)" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0606][Construct String from Binary Tree]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.findTarget">
+    <configuration name="SolutionTest.findErrorNums" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0645][Set Mismatch]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="TEST_OBJECT" value="class" />
+      <option name="METHOD_NAME" value="findErrorNums" />
+      <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.canPlaceFlowers" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0605][Can Place Flowers]" />
+    <configuration name="SolutionTest.findMaxAverage" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0643][Maximum Average Subarray I]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="canPlaceFlowers" />
+      <option name="METHOD_NAME" value="findMaxAverage" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.maximumProduct" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0628][Maximum Product of Three Numbers]" />
+    <configuration name="SolutionTest.findTarget" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0653][Two Sum IV - Input is a BST]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="maximumProduct" />
+      <option name="METHOD_NAME" value="findTarget" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.tree2str" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0606][Construct String from Binary Tree]" />
+    <configuration name="SolutionTest.judgeSquareSum" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0633][Sum of Square Numbers]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="tree2str" />
+      <option name="METHOD_NAME" value="judgeSquareSum" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.tree2str2" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0606][Construct String from Binary Tree]" />
+    <configuration name="SolutionTest.maximumProduct" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0628][Maximum Product of Three Numbers]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="tree2str2" />
+      <option name="METHOD_NAME" value="maximumProduct" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -165,19 +164,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.canPlaceFlowers" />
-      <item itemvalue="JUnit.SolutionTest.tree2str" />
-      <item itemvalue="JUnit.SolutionTest.tree2str2" />
-      <item itemvalue="JUnit.SolutionTest (1)" />
       <item itemvalue="JUnit.SolutionTest.maximumProduct" />
+      <item itemvalue="JUnit.SolutionTest.findMaxAverage" />
+      <item itemvalue="JUnit.SolutionTest.judgeSquareSum" />
+      <item itemvalue="JUnit.SolutionTest.findErrorNums" />
+      <item itemvalue="JUnit.SolutionTest.findTarget" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.findTarget" />
+        <item itemvalue="JUnit.SolutionTest.findErrorNums" />
+        <item itemvalue="JUnit.SolutionTest.judgeSquareSum" />
+        <item itemvalue="JUnit.SolutionTest.findMaxAverage" />
         <item itemvalue="JUnit.SolutionTest.maximumProduct" />
-        <item itemvalue="JUnit.SolutionTest (1)" />
-        <item itemvalue="JUnit.SolutionTest.tree2str2" />
-        <item itemvalue="JUnit.SolutionTest.tree2str" />
-        <item itemvalue="JUnit.SolutionTest.canPlaceFlowers" />
       </list>
     </recent_temporary>
   </component>
@@ -245,7 +244,7 @@
       <workItem from="1593647589537" duration="5696000" />
       <workItem from="1593741566759" duration="56000" />
       <workItem from="1593741641747" duration="4341000" />
-      <workItem from="1593846317598" duration="10824000" />
+      <workItem from="1593846317598" duration="18685000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -618,10 +617,10 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1397" height="224" key="GridCell.Tab.0.bottom" timestamp="1593866808668">
+    <state width="1397" height="337" key="GridCell.Tab.0.bottom" timestamp="1593945435620">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="224" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593866808668" />
+    <state width="1397" height="337" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593945435620" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
     <state width="1877" height="402" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004768" />
     <state width="1397" height="202" key="GridCell.Tab.0.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
@@ -634,10 +633,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1397" height="224" key="GridCell.Tab.0.center" timestamp="1593866808666">
+    <state width="1397" height="337" key="GridCell.Tab.0.center" timestamp="1593945435618">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="224" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593866808666" />
+    <state width="1397" height="337" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593945435618" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
     <state width="1877" height="402" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123892" />
@@ -650,10 +649,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1397" height="224" key="GridCell.Tab.0.left" timestamp="1593866808665">
+    <state width="1397" height="337" key="GridCell.Tab.0.left" timestamp="1593945435618">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="224" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593866808665" />
+    <state width="1397" height="337" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593945435618" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
     <state width="1877" height="402" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004766" />
     <state width="1397" height="202" key="GridCell.Tab.0.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123891" />
@@ -666,10 +665,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1397" height="224" key="GridCell.Tab.0.right" timestamp="1593866808666">
+    <state width="1397" height="337" key="GridCell.Tab.0.right" timestamp="1593945435619">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="224" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593866808666" />
+    <state width="1397" height="337" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593945435619" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
     <state width="1877" height="402" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
@@ -682,37 +681,37 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1397" height="303" key="GridCell.Tab.1.bottom" timestamp="1593864255811">
+    <state width="1397" height="337" key="GridCell.Tab.1.bottom" timestamp="1593945435622">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="303" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593864255811" />
+    <state width="1397" height="337" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593945435622" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
     <state width="1877" height="402" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123896" />
     <state width="1397" height="324" key="GridCell.Tab.1.bottom/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529748" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1397" height="303" key="GridCell.Tab.1.center" timestamp="1593864255810">
+    <state width="1397" height="337" key="GridCell.Tab.1.center" timestamp="1593945435621">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="303" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593864255810" />
+    <state width="1397" height="337" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593945435621" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
     <state width="1877" height="402" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1397" height="324" key="GridCell.Tab.1.center/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1397" height="303" key="GridCell.Tab.1.left" timestamp="1593864255810">
+    <state width="1397" height="337" key="GridCell.Tab.1.left" timestamp="1593945435620">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="303" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593864255810" />
+    <state width="1397" height="337" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593945435620" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
     <state width="1877" height="402" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123894" />
     <state width="1397" height="324" key="GridCell.Tab.1.left/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529746" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1397" height="303" key="GridCell.Tab.1.right" timestamp="1593864255811">
+    <state width="1397" height="337" key="GridCell.Tab.1.right" timestamp="1593945435622">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="303" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593864255811" />
+    <state width="1397" height="337" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593945435622" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
     <state width="1877" height="402" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
@@ -737,18 +736,18 @@
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593866757997">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593945341464">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593866757997" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593945341464" />
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744481391" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593866754399">
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593945308064">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593866754399" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593945308064" />
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
     <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744477730" />
     <state x="252" y="186" key="com.intellij.xdebugger.impl.breakpoints.ui.BreakpointsDialogFactory$2" timestamp="1593851354569">
@@ -759,10 +758,10 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593867072629">
+    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593944445019">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593867072629" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593944445019" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593743567550" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
@@ -1063,6 +1062,16 @@
           <line>18</line>
           <option name="timeStamp" value="140" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0643][Maximum Average Subarray I]/src/Solution.java</url>
+          <line>19</line>
+          <option name="timeStamp" value="141" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/src/Solution.java</url>
+          <line>34</line>
+          <option name="timeStamp" value="147" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
diff --git a/[0633][Sum of Square Numbers]/[0633][Sum of Square Numbers].iml b/[0633][Sum of Square Numbers]/[0633][Sum of Square Numbers].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0633][Sum of Square Numbers]/[0633][Sum of Square Numbers].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>
\ No newline at end of file
diff --git a/[0633][Sum of Square Numbers]/src/Solution.java b/[0633][Sum of Square Numbers]/src/Solution.java
new file mode 100644
index 0000000..816b16e
--- /dev/null
+++ b/[0633][Sum of Square Numbers]/src/Solution.java	
@@ -0,0 +1,36 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-05 16:55
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 解题思路：
+     * 1、假设b >=a >= 0
+     * ==> sqrt(c/2) <= b <= sqrt(c)
+     * @param c
+     * @return
+     */
+    public boolean judgeSquareSum(int c) {
+
+        if (c < 0) {
+            return false;
+        }
+
+
+        int sqrt = (int) Math.sqrt(c);
+        int halfSqrt = (int) Math.sqrt(c / 2.0);
+
+        for (int i = halfSqrt; i <= sqrt; i++) {
+
+            int sqrt2 = (int) Math.sqrt(c - i * i);
+            if (sqrt2 * sqrt2 + i * i == c) {
+                return true;
+            }
+        }
+
+        return false;
+    }
+}
diff --git a/[0633][Sum of Square Numbers]/src/SolutionTest.java b/[0633][Sum of Square Numbers]/src/SolutionTest.java
new file mode 100644
index 0000000..a859ba2
--- /dev/null
+++ b/[0633][Sum of Square Numbers]/src/SolutionTest.java	
@@ -0,0 +1,30 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-05 17:00
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void judgeSquareSum() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {0, true},
+                {1, true},
+                {2, true},
+                {3, false},
+                {4, true},
+                {5, true},
+                {1000, true},
+        };
+
+        for (Object[] d : data) {
+            Object result = s.judgeSquareSum((int) d[0]);
+            Assert.assertEquals(d[1], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0643][Maximum Average Subarray I]/[0643][Maximum Average Subarray I].iml b/[0643][Maximum Average Subarray I]/[0643][Maximum Average Subarray I].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0643][Maximum Average Subarray I]/[0643][Maximum Average Subarray I].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>
\ No newline at end of file
diff --git a/[0643][Maximum Average Subarray I]/src/Solution.java b/[0643][Maximum Average Subarray I]/src/Solution.java
new file mode 100644
index 0000000..d0a7f8c
--- /dev/null
+++ b/[0643][Maximum Average Subarray I]/src/Solution.java	
@@ -0,0 +1,28 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-05 16:23
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public double findMaxAverage(int[] nums, int k) {
+        if (nums == null || nums.length < 1 || k < 1) {
+            return 0;
+        }
+
+        double sum = 0;
+        for (int i = 0; i < nums.length && i < k; i++) { // 求nums[0, k-1]的和
+            sum += nums[i];
+        }
+
+        double max = sum;
+        for (int j = k; j < nums.length; j++) { // 求nums[j-k,j]中的大值
+            sum = sum + nums[j] - nums[j - k];
+            max = Math.max(max, sum);
+
+        }
+
+        return max / k;
+    }
+}
diff --git a/[0643][Maximum Average Subarray I]/src/SolutionTest.java b/[0643][Maximum Average Subarray I]/src/SolutionTest.java
new file mode 100644
index 0000000..f698ef1
--- /dev/null
+++ b/[0643][Maximum Average Subarray I]/src/SolutionTest.java	
@@ -0,0 +1,25 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-05 16:29
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findMaxAverage() {
+        Solution s = new Solution();
+        Object[][] data = {
+//                {new int[]{1, 12, -5, -6, 50, 3}, 4, 12.75},
+                {new int[]{7, 4, 5, 8, 8, 3, 9, 8, 7, 6}, 7, 7.0},
+        };
+
+        for (Object[] d : data) {
+            Object result = s.findMaxAverage((int[]) d[0], (Integer) d[1]);
+            Assert.assertEquals(d[2], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0645][Set Mismatch]/[0645][Set Mismatch].iml b/[0645][Set Mismatch]/[0645][Set Mismatch].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0645][Set Mismatch]/[0645][Set Mismatch].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>
\ No newline at end of file
diff --git a/[0645][Set Mismatch]/src/Solution.java b/[0645][Set Mismatch]/src/Solution.java
new file mode 100644
index 0000000..006c5f8
--- /dev/null
+++ b/[0645][Set Mismatch]/src/Solution.java	
@@ -0,0 +1,43 @@
+import java.util.HashSet;
+import java.util.Set;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-05 17:13
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 通过求和找丢失的数
+     * m + x + y = total
+     * m + x + x = sum
+     * y - x = total -sum
+     *
+     * @param nums
+     * @return
+     */
+    public int[] findErrorNums(int[] nums) {
+        if (nums == null || nums.length < 1) {
+            return null;
+        }
+
+        Set<Integer> map = new HashSet<>();
+        int num = 1;
+        int sum = 0;
+
+        for (int n : nums) {
+            if (map.contains(n)) {
+                num = n;
+            } else {
+                map.add(n);
+            }
+            sum += n;
+        }
+
+        return new int[]{num, (1 + nums.length) * nums.length / 2 - sum + num};
+
+    }
+
+}
diff --git a/[0645][Set Mismatch]/src/SolutionTest.java b/[0645][Set Mismatch]/src/SolutionTest.java
new file mode 100644
index 0000000..93087a5
--- /dev/null
+++ b/[0645][Set Mismatch]/src/SolutionTest.java	
@@ -0,0 +1,25 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-05 17:19
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findErrorNums() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{1, 2, 2, 4}, new int[]{2, 3}},
+                {new int[]{1, 3, 2, 4, 4}, new int[]{4, 5}},
+        };
+
+        for (Object[] d : data) {
+            int[] result = s.findErrorNums((int[]) d[0]);
+            Assert.assertArrayEquals((int[]) d[1], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0653][Two Sum IV - Input is a BST]/[0653][Two Sum IV - Input is a BST].iml b/[0653][Two Sum IV - Input is a BST]/[0653][Two Sum IV - Input is a BST].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0653][Two Sum IV - Input is a BST]/[0653][Two Sum IV - Input is a BST].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>
\ No newline at end of file
diff --git a/[0653][Two Sum IV - Input is a BST]/src/Solution.java b/[0653][Two Sum IV - Input is a BST]/src/Solution.java
new file mode 100644
index 0000000..05f7a25
--- /dev/null
+++ b/[0653][Two Sum IV - Input is a BST]/src/Solution.java	
@@ -0,0 +1,69 @@
+import java.util.HashSet;
+import java.util.Set;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-05 18:20
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * 二叉查找树（Binary Search Tree），（又：二叉搜索树，二叉排序树）它或者是一棵空树，或者是具有下列性质的二叉树：
+     * 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值；
+     * 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值；
+     * 它的左、右子树也分别为二叉排序树。
+     *
+     * @param root
+     * @param k
+     * @return
+     */
+
+
+    public boolean findTarget(TreeNode root, int k) {
+        Set<Integer> set = new HashSet<>();
+        return findTargetHelp(root, k, set);
+    }
+
+    private boolean findTargetHelp(TreeNode root, int k, Set<Integer> set) {
+        if (root == null) {
+            return false;
+        }
+        if (set.contains(k - root.val)) {
+            return true;
+        }
+
+        set.add(root.val);
+
+        return findTargetHelp(root.left, k, set) || findTargetHelp(root.right, k, set);
+    }
+
+    public boolean findTarget2(TreeNode root, int k) {
+        if (root == null) {
+            return false;
+        }
+
+        Set<Integer> set = new HashSet<>();
+        visitTree(root, set);
+
+        for (Integer n : set) {
+            if (n != k - n && set.contains(k - n)) {
+                return true;
+            }
+        }
+
+        return false;
+    }
+
+    public void visitTree(TreeNode root, Set<Integer> set) {
+        if (root == null) {
+            return;
+        }
+
+        set.add(root.val);
+
+        visitTree(root.left, set);
+        visitTree(root.right, set);
+    }
+}
diff --git a/[0653][Two Sum IV - Input is a BST]/src/SolutionTest.java b/[0653][Two Sum IV - Input is a BST]/src/SolutionTest.java
new file mode 100644
index 0000000..792632a
--- /dev/null
+++ b/[0653][Two Sum IV - Input is a BST]/src/SolutionTest.java	
@@ -0,0 +1,19 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-05 18:35
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findTarget() {
+        Solution s = new Solution();
+        TreeNode root = new TreeNode(1);
+
+        Assert.assertFalse(s.findTarget(root, 2));
+    }
+}
\ No newline at end of file
diff --git a/[0653][Two Sum IV - Input is a BST]/src/TreeNode.java b/[0653][Two Sum IV - Input is a BST]/src/TreeNode.java
new file mode 100644
index 0000000..5554849
--- /dev/null
+++ b/[0653][Two Sum IV - Input is a BST]/src/TreeNode.java	
@@ -0,0 +1,13 @@
+/**
+ * @author: wangjunchao(王俊超)
+ * @time: 2019-07-09 18:52
+ **/
+public class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+
+    TreeNode(int x) {
+        val = x;
+    }
+}

From 5e1d814362ce394a2a1620c58495d310d47608df Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Mon, 6 Jul 2020 09:08:06 +0800
Subject: [PATCH 16/19] commit

Change-Id: Id25b4ebafc431d7b6c6810459fe09ef51532dabd
---
 .idea/modules.xml                             |   3 +
 .idea/workspace.xml                           | 120 ++++++++++--------
 .../[0661][Image Smoother].iml                |  21 +++
 [0661][Image Smoother]/src/Solution.java      |  32 +++++
 [0661][Image Smoother]/src/SolutionTest.java  |  29 +++++
 .../[0665][Non-decreasing Array].iml          |  21 +++
 .../src/Solution.java                         |  34 +++++
 .../src/SolutionTest.java                     |  28 ++++
 .../[0669][Trim a Binary Search Tree].iml     |  11 ++
 .../src/Solution.java                         |  33 +++++
 .../src/TreeNode.java                         |  16 +++
 11 files changed, 294 insertions(+), 54 deletions(-)
 create mode 100644 [0661][Image Smoother]/[0661][Image Smoother].iml
 create mode 100644 [0661][Image Smoother]/src/Solution.java
 create mode 100644 [0661][Image Smoother]/src/SolutionTest.java
 create mode 100644 [0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml
 create mode 100644 [0665][Non-decreasing Array]/src/Solution.java
 create mode 100644 [0665][Non-decreasing Array]/src/SolutionTest.java
 create mode 100644 [0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml
 create mode 100644 [0669][Trim a Binary Search Tree]/src/Solution.java
 create mode 100644 [0669][Trim a Binary Search Tree]/src/TreeNode.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index a13d1d7..b70f6ff 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -277,6 +277,9 @@
       <module fileurl="file://$PROJECT_DIR$/[0645][Set Mismatch]/[0645][Set Mismatch].iml" filepath="$PROJECT_DIR$/[0645][Set Mismatch]/[0645][Set Mismatch].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/[0653][Two Sum IV - Input is a BST].iml" filepath="$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/[0653][Two Sum IV - Input is a BST].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml" filepath="$PROJECT_DIR$/[0657][Robot Return to Origin]/[0657][Robot Return to Origin].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0661][Image Smoother]/[0661][Image Smoother].iml" filepath="$PROJECT_DIR$/[0661][Image Smoother]/[0661][Image Smoother].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml" filepath="$PROJECT_DIR$/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml" filepath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" filepath="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 41b8758..2a170ed 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,18 +2,15 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0633][Sum of Square Numbers]/[0633][Sum of Square Numbers].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0633][Sum of Square Numbers]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0633][Sum of Square Numbers]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0643][Maximum Average Subarray I]/[0643][Maximum Average Subarray I].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0643][Maximum Average Subarray I]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0643][Maximum Average Subarray I]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0645][Set Mismatch]/[0645][Set Mismatch].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0645][Set Mismatch]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0645][Set Mismatch]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0661][Image Smoother]/[0661][Image Smoother].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0661][Image Smoother]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0661][Image Smoother]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0665][Non-decreasing Array]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0665][Non-decreasing Array]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/src/TreeNode.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -31,8 +28,8 @@
   <component name="FileTemplateManagerImpl">
     <option name="RECENT_TEMPLATES">
       <list>
-        <option value="Class" />
         <option value="JUnit4 Test Class" />
+        <option value="Class" />
       </list>
     </option>
   </component>
@@ -100,23 +97,23 @@
       <recent name="" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.findTarget">
-    <configuration name="SolutionTest.findErrorNums" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0645][Set Mismatch]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.checkPossibility">
+    <configuration name="SolutionTest.checkPossibility" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0665][Non-decreasing Array]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findErrorNums" />
+      <option name="METHOD_NAME" value="checkPossibility" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.findMaxAverage" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0643][Maximum Average Subarray I]" />
+    <configuration name="SolutionTest.findErrorNums" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0645][Set Mismatch]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findMaxAverage" />
+      <option name="METHOD_NAME" value="findErrorNums" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -134,22 +131,22 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.judgeSquareSum" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0633][Sum of Square Numbers]" />
+    <configuration name="SolutionTest.imageSmoother" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0661][Image Smoother]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="judgeSquareSum" />
+      <option name="METHOD_NAME" value="imageSmoother" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.maximumProduct" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0628][Maximum Product of Three Numbers]" />
+    <configuration name="SolutionTest.judgeSquareSum" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0633][Sum of Square Numbers]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="maximumProduct" />
+      <option name="METHOD_NAME" value="judgeSquareSum" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -164,19 +161,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.maximumProduct" />
-      <item itemvalue="JUnit.SolutionTest.findMaxAverage" />
       <item itemvalue="JUnit.SolutionTest.judgeSquareSum" />
       <item itemvalue="JUnit.SolutionTest.findErrorNums" />
       <item itemvalue="JUnit.SolutionTest.findTarget" />
+      <item itemvalue="JUnit.SolutionTest.imageSmoother" />
+      <item itemvalue="JUnit.SolutionTest.checkPossibility" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.checkPossibility" />
+        <item itemvalue="JUnit.SolutionTest.imageSmoother" />
         <item itemvalue="JUnit.SolutionTest.findTarget" />
         <item itemvalue="JUnit.SolutionTest.findErrorNums" />
         <item itemvalue="JUnit.SolutionTest.judgeSquareSum" />
-        <item itemvalue="JUnit.SolutionTest.findMaxAverage" />
-        <item itemvalue="JUnit.SolutionTest.maximumProduct" />
       </list>
     </recent_temporary>
   </component>
@@ -244,7 +241,8 @@
       <workItem from="1593647589537" duration="5696000" />
       <workItem from="1593741566759" duration="56000" />
       <workItem from="1593741641747" duration="4341000" />
-      <workItem from="1593846317598" duration="18685000" />
+      <workItem from="1593846317598" duration="19196000" />
+      <workItem from="1593994138409" duration="3060000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -617,10 +615,10 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1397" height="337" key="GridCell.Tab.0.bottom" timestamp="1593945435620">
+    <state width="1397" height="298" key="GridCell.Tab.0.bottom" timestamp="1593996339909">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="337" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593945435620" />
+    <state width="1397" height="298" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593996339909" />
     <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
     <state width="1877" height="402" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004768" />
     <state width="1397" height="202" key="GridCell.Tab.0.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
@@ -633,10 +631,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1397" height="337" key="GridCell.Tab.0.center" timestamp="1593945435618">
+    <state width="1397" height="298" key="GridCell.Tab.0.center" timestamp="1593996339908">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="337" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593945435618" />
+    <state width="1397" height="298" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593996339908" />
     <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
     <state width="1877" height="402" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123892" />
@@ -649,10 +647,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1397" height="337" key="GridCell.Tab.0.left" timestamp="1593945435618">
+    <state width="1397" height="298" key="GridCell.Tab.0.left" timestamp="1593996339907">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="337" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593945435618" />
+    <state width="1397" height="298" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593996339907" />
     <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
     <state width="1877" height="402" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004766" />
     <state width="1397" height="202" key="GridCell.Tab.0.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123891" />
@@ -665,10 +663,10 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1397" height="337" key="GridCell.Tab.0.right" timestamp="1593945435619">
+    <state width="1397" height="298" key="GridCell.Tab.0.right" timestamp="1593996339908">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="337" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593945435619" />
+    <state width="1397" height="298" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593996339908" />
     <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
     <state width="1877" height="402" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
@@ -681,37 +679,37 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1397" height="337" key="GridCell.Tab.1.bottom" timestamp="1593945435622">
+    <state width="1397" height="298" key="GridCell.Tab.1.bottom" timestamp="1593996340149">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="337" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593945435622" />
+    <state width="1397" height="298" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593996340149" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
     <state width="1877" height="402" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123896" />
     <state width="1397" height="324" key="GridCell.Tab.1.bottom/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529748" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1397" height="337" key="GridCell.Tab.1.center" timestamp="1593945435621">
+    <state width="1397" height="298" key="GridCell.Tab.1.center" timestamp="1593996340148">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="337" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593945435621" />
+    <state width="1397" height="298" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593996340148" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
     <state width="1877" height="402" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1397" height="324" key="GridCell.Tab.1.center/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1397" height="337" key="GridCell.Tab.1.left" timestamp="1593945435620">
+    <state width="1397" height="298" key="GridCell.Tab.1.left" timestamp="1593996340147">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="337" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593945435620" />
+    <state width="1397" height="298" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593996340147" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
     <state width="1877" height="402" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123894" />
     <state width="1397" height="324" key="GridCell.Tab.1.left/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529746" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1397" height="337" key="GridCell.Tab.1.right" timestamp="1593945435622">
+    <state width="1397" height="298" key="GridCell.Tab.1.right" timestamp="1593996340148">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="337" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593945435622" />
+    <state width="1397" height="298" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593996340148" />
     <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
     <state width="1877" height="402" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
@@ -736,18 +734,18 @@
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593945341464">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593995937295">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593945341464" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593995937295" />
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744481391" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593945308064">
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593995932124">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593945308064" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593995932124" />
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
     <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744477730" />
     <state x="252" y="186" key="com.intellij.xdebugger.impl.breakpoints.ui.BreakpointsDialogFactory$2" timestamp="1593851354569">
@@ -758,15 +756,19 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593944445019">
+    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593997101055">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593944445019" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593997101055" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593743567550" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="108" y="144" key="new project wizard/41.23.1399.877@41.23.1399.877" timestamp="1593387189945" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
+    <state x="424" y="242" key="refactoring.ChangeSignatureDialog" timestamp="1593945577657">
+      <screen x="0" y="0" width="1440" height="900" />
+    </state>
+    <state x="424" y="242" key="refactoring.ChangeSignatureDialog/0.0.1440.900@0.0.1440.900" timestamp="1593945577657" />
     <state x="469" y="200" width="670" height="676" key="search.everywhere.popup" timestamp="1593479622928">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
@@ -1069,9 +1071,19 @@
         </line-breakpoint>
         <line-breakpoint enabled="true" type="java-line">
           <url>file://$PROJECT_DIR$/[0653][Two Sum IV - Input is a BST]/src/Solution.java</url>
-          <line>34</line>
+          <line>49</line>
           <option name="timeStamp" value="147" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0661][Image Smoother]/src/SolutionTest.java</url>
+          <line>23</line>
+          <option name="timeStamp" value="148" />
+        </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0661][Image Smoother]/src/Solution.java</url>
+          <line>25</line>
+          <option name="timeStamp" value="149" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
diff --git a/[0661][Image Smoother]/[0661][Image Smoother].iml b/[0661][Image Smoother]/[0661][Image Smoother].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0661][Image Smoother]/[0661][Image Smoother].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>
\ No newline at end of file
diff --git a/[0661][Image Smoother]/src/Solution.java b/[0661][Image Smoother]/src/Solution.java
new file mode 100644
index 0000000..a92e9d8
--- /dev/null
+++ b/[0661][Image Smoother]/src/Solution.java	
@@ -0,0 +1,32 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-06 08:11
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+
+    public int[][] imageSmoother(int[][] M) {
+        int[][] result = new int[M.length][];
+        for (int i = 0; i < M.length; i++) {
+            result[i] = new int[M[i].length];
+        }
+
+        for (int i = 0; i < M.length; i++) {
+            for (int j = 0; j < M[0].length; j++) {
+                int count = 0;
+                int sum = 0;
+                for (int u = Math.max(0, i - 1); u <= i + 1 && u < M.length; u++) {
+                    for (int v = Math.max(0, j - 1); v <= j + 1 && v < M[0].length; v++) {
+                        count++;
+                        sum += M[u][v];
+                    }
+                }
+                result[i][j] = sum / count;
+            }
+        }
+
+        return result;
+    }
+}
diff --git a/[0661][Image Smoother]/src/SolutionTest.java b/[0661][Image Smoother]/src/SolutionTest.java
new file mode 100644
index 0000000..311d241
--- /dev/null
+++ b/[0661][Image Smoother]/src/SolutionTest.java	
@@ -0,0 +1,29 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-06 08:17
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void imageSmoother() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {
+                        new int[][]{{1, 1, 1}, {1, 0, 1}, {1, 1, 1}},
+                        new int[][]{{0, 0, 0}, {0, 0, 0}, {0, 0, 0}},
+                },
+        };
+
+        for (Object[] d : data) {
+            int[][] result = s.imageSmoother((int[][]) d[0]);
+            for (int i = 0; i < result.length; i++) {
+                Assert.assertArrayEquals(((int[][]) d[1])[i], result[i]);
+            }
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml b/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].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>
\ No newline at end of file
diff --git a/[0665][Non-decreasing Array]/src/Solution.java b/[0665][Non-decreasing Array]/src/Solution.java
new file mode 100644
index 0000000..db06448
--- /dev/null
+++ b/[0665][Non-decreasing Array]/src/Solution.java	
@@ -0,0 +1,34 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-06 08:27
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+
+    /**
+     * 解题思路：
+     * 其实说的简单点，有2种情况：
+     * 升序序列中，突然有个数字小了，则nums[i]=nums[i-1]
+     * 升序序列中，突然有个数字大了，则nums[i-1]=nums[i]
+     *
+     * @param nums
+     * @return
+     */
+    public boolean checkPossibility(int[] nums) {
+        int fix = 0;
+        for (int i = 1; i < nums.length && fix <= 1; i++) {
+            if (nums[i] >= nums[i - 1]) {
+                continue;
+            }
+            fix++;
+            if (i - 2 >= 0 && (nums[i] < nums[i - 2])) { // 突然有个数字小了
+                nums[i] = nums[i - 1];
+            } else {// 突然有个数字大了
+                nums[i - 1] = nums[i];
+            }
+        }
+        return fix <= 1;
+    }
+}
diff --git a/[0665][Non-decreasing Array]/src/SolutionTest.java b/[0665][Non-decreasing Array]/src/SolutionTest.java
new file mode 100644
index 0000000..1667886
--- /dev/null
+++ b/[0665][Non-decreasing Array]/src/SolutionTest.java	
@@ -0,0 +1,28 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-06 08:38
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void checkPossibility() {
+        Solution s = new Solution();
+        Object[][] data = {
+//                {new int[]{1, 2, 3, 4, 6, 5, 7, 8, 9}, true},
+//                {new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9}, true},
+//                {new int[]{4, 2, 3}, true},
+//                {new int[]{4, 2, 1}, false},
+                {new int[]{-1, 4, 2, 3}, false},
+        };
+
+        for (Object[] d : data) {
+            boolean result = s.checkPossibility((int[]) d[0]);
+            Assert.assertEquals(d[1], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml b/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search 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>
\ No newline at end of file
diff --git a/[0669][Trim a Binary Search Tree]/src/Solution.java b/[0669][Trim a Binary Search Tree]/src/Solution.java
new file mode 100644
index 0000000..8bc8fa1
--- /dev/null
+++ b/[0669][Trim a Binary Search Tree]/src/Solution.java	
@@ -0,0 +1,33 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-06 08:58
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public TreeNode trimBST(TreeNode root, int L, int R) {
+        if (root == null) {
+            return null;
+        }
+
+        if (root.val == L) {
+            root.left = null;
+            root.right = trimBST(root, L, R);
+            return root;
+        } else if (root.val == R) {
+            root.right = null;
+            root.left = trimBST(root.left, L, R);
+            return root;
+        } else if (root.val < L) {
+            return trimBST(root.right, L, R);
+        } else if (root.val > R) {
+            return trimBST(root.left, L, R);
+        }
+
+        root.left = trimBST(root.left, L, R);
+        root.right = trimBST(root.right, L, R);
+
+        return root;
+    }
+}
diff --git a/[0669][Trim a Binary Search Tree]/src/TreeNode.java b/[0669][Trim a Binary Search Tree]/src/TreeNode.java
new file mode 100644
index 0000000..bff99a6
--- /dev/null
+++ b/[0669][Trim a Binary Search 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;
+    }
+}

From 0790b0e84934cf6892932bff718d09eed8aec11b Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Mon, 6 Jul 2020 09:10:04 +0800
Subject: [PATCH 17/19] commit

Change-Id: I820959b1cfc713576e66ee7653b8ab36ac7418c3
---
 [0669][Trim a Binary Search Tree]/src/Solution.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/[0669][Trim a Binary Search Tree]/src/Solution.java b/[0669][Trim a Binary Search Tree]/src/Solution.java
index 8bc8fa1..c86b80d 100644
--- a/[0669][Trim a Binary Search Tree]/src/Solution.java	
+++ b/[0669][Trim a Binary Search Tree]/src/Solution.java	
@@ -13,11 +13,11 @@ public TreeNode trimBST(TreeNode root, int L, int R) {
 
         if (root.val == L) {
             root.left = null;
-            root.right = trimBST(root, L, R);
+            root.right = trimBST(root.right, L, R);
             return root;
         } else if (root.val == R) {
-            root.right = null;
             root.left = trimBST(root.left, L, R);
+            root.right = null;
             return root;
         } else if (root.val < L) {
             return trimBST(root.right, L, R);

From 7a208fa954fca7fec49334b86cc71683f6edc797 Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Tue, 7 Jul 2020 09:23:55 +0800
Subject: [PATCH 18/19] commit

Change-Id: I7e09e7afc5094e80010f136cc272e55762f94407
---
 .idea/modules.xml                             |   1 +
 .idea/workspace.xml                           | 111 +++++++++---------
 ...[Second Minimum Node In a Binary Tree].iml |  21 ++++
 .../src/Solution.java                         |  68 +++++++++++
 .../src/SolutionTest.java                     |  24 ++++
 .../src/TreeNode.java                         |  16 +++
 6 files changed, 186 insertions(+), 55 deletions(-)
 create mode 100644 [0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml
 create mode 100644 [0671][Second Minimum Node In a Binary Tree]/src/Solution.java
 create mode 100644 [0671][Second Minimum Node In a Binary Tree]/src/SolutionTest.java
 create mode 100644 [0671][Second Minimum Node In a Binary Tree]/src/TreeNode.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index b70f6ff..6af2ce0 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -280,6 +280,7 @@
       <module fileurl="file://$PROJECT_DIR$/[0661][Image Smoother]/[0661][Image Smoother].iml" filepath="$PROJECT_DIR$/[0661][Image Smoother]/[0661][Image Smoother].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml" filepath="$PROJECT_DIR$/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml" filepath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml" filepath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" filepath="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 2a170ed..69b73b9 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,15 +2,10 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0661][Image Smoother]/[0661][Image Smoother].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0661][Image Smoother]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0661][Image Smoother]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0665][Non-decreasing Array]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0665][Non-decreasing Array]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/src/TreeNode.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -28,8 +23,8 @@
   <component name="FileTemplateManagerImpl">
     <option name="RECENT_TEMPLATES">
       <list>
-        <option value="JUnit4 Test Class" />
         <option value="Class" />
+        <option value="JUnit4 Test Class" />
       </list>
     </option>
   </component>
@@ -97,7 +92,7 @@
       <recent name="" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.checkPossibility">
+  <component name="RunManager" selected="JUnit.SolutionTest.findSecondMinimumValue">
     <configuration name="SolutionTest.checkPossibility" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
       <module name="[0665][Non-decreasing Array]" />
       <option name="PACKAGE_NAME" value="" />
@@ -120,33 +115,33 @@
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.findTarget" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0653][Two Sum IV - Input is a BST]" />
+    <configuration name="SolutionTest.findSecondMinimumValue" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0671][Second Minimum Node In a Binary Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findTarget" />
+      <option name="METHOD_NAME" value="findSecondMinimumValue" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.imageSmoother" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0661][Image Smoother]" />
+    <configuration name="SolutionTest.findTarget" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0653][Two Sum IV - Input is a BST]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="imageSmoother" />
+      <option name="METHOD_NAME" value="findTarget" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.judgeSquareSum" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0633][Sum of Square Numbers]" />
+    <configuration name="SolutionTest.imageSmoother" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0661][Image Smoother]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="judgeSquareSum" />
+      <option name="METHOD_NAME" value="imageSmoother" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -161,19 +156,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.judgeSquareSum" />
       <item itemvalue="JUnit.SolutionTest.findErrorNums" />
       <item itemvalue="JUnit.SolutionTest.findTarget" />
       <item itemvalue="JUnit.SolutionTest.imageSmoother" />
       <item itemvalue="JUnit.SolutionTest.checkPossibility" />
+      <item itemvalue="JUnit.SolutionTest.findSecondMinimumValue" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.findSecondMinimumValue" />
         <item itemvalue="JUnit.SolutionTest.checkPossibility" />
         <item itemvalue="JUnit.SolutionTest.imageSmoother" />
         <item itemvalue="JUnit.SolutionTest.findTarget" />
         <item itemvalue="JUnit.SolutionTest.findErrorNums" />
-        <item itemvalue="JUnit.SolutionTest.judgeSquareSum" />
       </list>
     </recent_temporary>
   </component>
@@ -242,7 +237,8 @@
       <workItem from="1593741566759" duration="56000" />
       <workItem from="1593741641747" duration="4341000" />
       <workItem from="1593846317598" duration="19196000" />
-      <workItem from="1593994138409" duration="3060000" />
+      <workItem from="1593994138409" duration="4028000" />
+      <workItem from="1594083345639" duration="1634000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -615,11 +611,11 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1397" height="298" key="GridCell.Tab.0.bottom" timestamp="1593996339909">
+    <state width="1397" height="319" key="GridCell.Tab.0.bottom" timestamp="1594084846600">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="298" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593996339909" />
-    <state width="1400" height="273" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539423" />
+    <state width="1397" height="319" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1594084846600" />
+    <state width="1397" height="264" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031068" />
     <state width="1877" height="402" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004768" />
     <state width="1397" height="202" key="GridCell.Tab.0.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
     <state width="1877" height="365" key="GridCell.Tab.0.bottom/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735334" />
@@ -631,11 +627,11 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1397" height="298" key="GridCell.Tab.0.center" timestamp="1593996339908">
+    <state width="1397" height="319" key="GridCell.Tab.0.center" timestamp="1594084846599">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="298" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1593996339908" />
-    <state width="1400" height="273" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539421" />
+    <state width="1397" height="319" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1594084846599" />
+    <state width="1397" height="264" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031067" />
     <state width="1877" height="402" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123892" />
     <state width="1877" height="365" key="GridCell.Tab.0.center/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735330" />
@@ -647,11 +643,11 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1397" height="298" key="GridCell.Tab.0.left" timestamp="1593996339907">
+    <state width="1397" height="319" key="GridCell.Tab.0.left" timestamp="1594084846598">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="298" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1593996339907" />
-    <state width="1400" height="273" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539420" />
+    <state width="1397" height="319" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1594084846598" />
+    <state width="1397" height="264" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031065" />
     <state width="1877" height="402" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004766" />
     <state width="1397" height="202" key="GridCell.Tab.0.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123891" />
     <state width="1877" height="365" key="GridCell.Tab.0.left/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735322" />
@@ -663,11 +659,11 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1397" height="298" key="GridCell.Tab.0.right" timestamp="1593996339908">
+    <state width="1397" height="319" key="GridCell.Tab.0.right" timestamp="1594084846599">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="298" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1593996339908" />
-    <state width="1400" height="273" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406539422" />
+    <state width="1397" height="319" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1594084846599" />
+    <state width="1397" height="264" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031068" />
     <state width="1877" height="402" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
     <state width="1877" height="365" key="GridCell.Tab.0.right/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735333" />
@@ -679,38 +675,38 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1397" height="298" key="GridCell.Tab.1.bottom" timestamp="1593996340149">
+    <state width="1397" height="319" key="GridCell.Tab.1.bottom" timestamp="1594084846602">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="298" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1593996340149" />
-    <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535659" />
+    <state width="1397" height="319" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1594084846602" />
+    <state width="1397" height="264" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031071" />
     <state width="1877" height="402" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123896" />
     <state width="1397" height="324" key="GridCell.Tab.1.bottom/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529748" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1397" height="298" key="GridCell.Tab.1.center" timestamp="1593996340148">
+    <state width="1397" height="319" key="GridCell.Tab.1.center" timestamp="1594084846601">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="298" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1593996340148" />
-    <state width="1400" height="273" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535657" />
+    <state width="1397" height="319" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1594084846601" />
+    <state width="1397" height="264" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031069" />
     <state width="1877" height="402" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1397" height="324" key="GridCell.Tab.1.center/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1397" height="298" key="GridCell.Tab.1.left" timestamp="1593996340147">
+    <state width="1397" height="319" key="GridCell.Tab.1.left" timestamp="1594084846601">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="298" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1593996340147" />
-    <state width="1400" height="273" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535656" />
+    <state width="1397" height="319" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1594084846601" />
+    <state width="1397" height="264" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031069" />
     <state width="1877" height="402" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123894" />
     <state width="1397" height="324" key="GridCell.Tab.1.left/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529746" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1397" height="298" key="GridCell.Tab.1.right" timestamp="1593996340148">
+    <state width="1397" height="319" key="GridCell.Tab.1.right" timestamp="1594084846602">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="298" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1593996340148" />
-    <state width="1400" height="273" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593406535658" />
+    <state width="1397" height="319" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1594084846602" />
+    <state width="1397" height="264" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031070" />
     <state width="1877" height="402" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1397" height="324" key="GridCell.Tab.1.right/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
@@ -734,18 +730,18 @@
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1593995937295">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1594084517296">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1593995937295" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1594084517296" />
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744481391" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1593995932124">
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1594084439945">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1593995932124" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1594084439945" />
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
     <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744477730" />
     <state x="252" y="186" key="com.intellij.xdebugger.impl.breakpoints.ui.BreakpointsDialogFactory$2" timestamp="1593851354569">
@@ -756,19 +752,19 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1593997101055">
+    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1594083515558">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1593997101055" />
+    <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1594083515558" />
     <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593743567550" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="108" y="144" key="new project wizard/41.23.1399.877@41.23.1399.877" timestamp="1593387189945" />
     <state x="44" y="147" key="new project wizard/44.23.1396.877@44.23.1396.877" timestamp="1592952740780" />
-    <state x="424" y="242" key="refactoring.ChangeSignatureDialog" timestamp="1593945577657">
+    <state x="424" y="242" key="refactoring.ChangeSignatureDialog" timestamp="1594084773119">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state x="424" y="242" key="refactoring.ChangeSignatureDialog/0.0.1440.900@0.0.1440.900" timestamp="1593945577657" />
+    <state x="424" y="242" key="refactoring.ChangeSignatureDialog/0.0.1440.900@0.0.1440.900" timestamp="1594084773119" />
     <state x="469" y="200" width="670" height="676" key="search.everywhere.popup" timestamp="1593479622928">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
@@ -1084,6 +1080,11 @@
           <line>25</line>
           <option name="timeStamp" value="149" />
         </line-breakpoint>
+        <line-breakpoint enabled="true" type="java-line">
+          <url>file://$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/src/Solution.java</url>
+          <line>60</line>
+          <option name="timeStamp" value="150" />
+        </line-breakpoint>
         <line-breakpoint enabled="true" type="java-method">
           <url>file://$PROJECT_DIR$/[081][Search In Rotated Sorted Array II]/src/Solution2.java</url>
           <line>17</line>
diff --git a/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml b/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary 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>
\ No newline at end of file
diff --git a/[0671][Second Minimum Node In a Binary Tree]/src/Solution.java b/[0671][Second Minimum Node In a Binary Tree]/src/Solution.java
new file mode 100644
index 0000000..6562244
--- /dev/null
+++ b/[0671][Second Minimum Node In a Binary Tree]/src/Solution.java	
@@ -0,0 +1,68 @@
+import java.util.SortedSet;
+import java.util.TreeSet;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-07 08:58
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    /**
+     * @param root
+     * @return
+     */
+
+    public int findSecondMinimumValue(TreeNode root) {
+        if (root == null){
+            return -1;
+        }
+        return help(root, root.val);
+    }
+
+    private int help(TreeNode root, int min) {
+        if (root == null){
+            return -1;
+        }
+        if (root.val > min) {
+            return root.val;
+        }
+        int left = help(root.left, min);
+        int right = help(root.right, min);
+
+        if (left == -1) {
+            return right;
+        }
+        if (right == -1) {
+            return left;
+        }
+
+        return Math.min(left, right);
+    }
+
+    public int findSecondMinimumValue2(TreeNode root) {
+        SortedSet<Integer> result = new TreeSet<>();
+        findSecondMinimumValue(root, result);
+
+        if (result.size() < 2) {
+            return -1;
+        }
+
+        result.remove(result.first());
+        return result.first();
+    }
+
+    /**
+     * @param root
+     * @param result 是一个从小到大的size=2的有序数组
+     */
+    private void findSecondMinimumValue(TreeNode root, SortedSet<Integer> result) {
+        if (root == null) {
+            return;
+        }
+        result.add(root.val);
+        findSecondMinimumValue(root.left, result);
+        findSecondMinimumValue(root.right, result);
+    }
+}
diff --git a/[0671][Second Minimum Node In a Binary Tree]/src/SolutionTest.java b/[0671][Second Minimum Node In a Binary Tree]/src/SolutionTest.java
new file mode 100644
index 0000000..26dc827
--- /dev/null
+++ b/[0671][Second Minimum Node In a Binary Tree]/src/SolutionTest.java	
@@ -0,0 +1,24 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-07 09:13
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findSecondMinimumValue() {
+        Solution s = new Solution();
+
+        TreeNode root = new TreeNode(2);
+        root.left = new TreeNode(2);
+        root.right = new TreeNode(5);
+        root.right.left = new TreeNode(5);
+        root.right.right = new TreeNode(7);
+
+        Assert.assertEquals(5, s.findSecondMinimumValue(root));
+    }
+}
\ No newline at end of file
diff --git a/[0671][Second Minimum Node In a Binary Tree]/src/TreeNode.java b/[0671][Second Minimum Node In a Binary Tree]/src/TreeNode.java
new file mode 100644
index 0000000..bff99a6
--- /dev/null
+++ b/[0671][Second Minimum Node In a 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;
+    }
+}

From ce53c9790b91bdd22b99f21d106365d5c7eb971c Mon Sep 17 00:00:00 2001
From: Wang-Jun-Chao <shining-glory@qq.com>
Date: Thu, 9 Jul 2020 07:14:03 +0800
Subject: [PATCH 19/19] commit

Change-Id: Ib8fb3df671488e52b13296e875a02e3473b0473b
---
 .idea/modules.xml                             |   3 +
 .idea/workspace.xml                           | 101 +++++++++---------
 ...est Continuous Increasing Subsequence].iml |  21 ++++
 .../src/Solution.java                         |  30 ++++++
 .../src/SolutionTest.java                     |  27 +++++
 .../[0680][Valid Palindrome II].iml           |  11 ++
 [0680][Valid Palindrome II]/src/Solution.java |  35 ++++++
 .../[0682][Baseball Game].iml                 |  21 ++++
 [0682][Baseball Game]/src/Solution.java       |  43 ++++++++
 [0682][Baseball Game]/src/SolutionTest.java   |  25 +++++
 10 files changed, 269 insertions(+), 48 deletions(-)
 create mode 100644 [0674][Longest Continuous Increasing Subsequence]/[0674][Longest Continuous Increasing Subsequence].iml
 create mode 100644 [0674][Longest Continuous Increasing Subsequence]/src/Solution.java
 create mode 100644 [0674][Longest Continuous Increasing Subsequence]/src/SolutionTest.java
 create mode 100644 [0680][Valid Palindrome II]/[0680][Valid Palindrome II].iml
 create mode 100644 [0680][Valid Palindrome II]/src/Solution.java
 create mode 100644 [0682][Baseball Game]/[0682][Baseball Game].iml
 create mode 100644 [0682][Baseball Game]/src/Solution.java
 create mode 100644 [0682][Baseball Game]/src/SolutionTest.java

diff --git a/.idea/modules.xml b/.idea/modules.xml
index 6af2ce0..9dde46f 100644
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -281,6 +281,9 @@
       <module fileurl="file://$PROJECT_DIR$/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml" filepath="$PROJECT_DIR$/[0665][Non-decreasing Array]/[0665][Non-decreasing Array].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml" filepath="$PROJECT_DIR$/[0669][Trim a Binary Search Tree]/[0669][Trim a Binary Search Tree].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml" filepath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0674][Longest Continuous Increasing Subsequence]/[0674][Longest Continuous Increasing Subsequence].iml" filepath="$PROJECT_DIR$/[0674][Longest Continuous Increasing Subsequence]/[0674][Longest Continuous Increasing Subsequence].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0680][Valid Palindrome II]/[0680][Valid Palindrome II].iml" filepath="$PROJECT_DIR$/[0680][Valid Palindrome II]/[0680][Valid Palindrome II].iml" />
+      <module fileurl="file://$PROJECT_DIR$/[0682][Baseball Game]/[0682][Baseball Game].iml" filepath="$PROJECT_DIR$/[0682][Baseball Game]/[0682][Baseball Game].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" filepath="$PROJECT_DIR$/[0783][Minimum Distance Between BST Nodes]/[0783][Minimum Distance Between BST Nodes].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" filepath="$PROJECT_DIR$/[0969][Pancake Sorting]/[0969][Pancake Sorting].iml" />
       <module fileurl="file://$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" filepath="$PROJECT_DIR$/[0979][Distribute Coins in Binary Tree]/[0979][Distribute Coins in Binary Tree].iml" />
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 69b73b9..4b16f3e 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,10 +2,14 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="ce385e91-de99-4e13-9d76-ab57b6a23494" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/[0671][Second Minimum Node In a Binary Tree].iml" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/src/Solution.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/src/SolutionTest.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/[0671][Second Minimum Node In a Binary Tree]/src/TreeNode.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0674][Longest Continuous Increasing Subsequence]/[0674][Longest Continuous Increasing Subsequence].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0674][Longest Continuous Increasing Subsequence]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0674][Longest Continuous Increasing Subsequence]/src/SolutionTest.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0680][Valid Palindrome II]/[0680][Valid Palindrome II].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0680][Valid Palindrome II]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0682][Baseball Game]/[0682][Baseball Game].iml" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0682][Baseball Game]/src/Solution.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/[0682][Baseball Game]/src/SolutionTest.java" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/modules.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/modules.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
     </list>
@@ -92,45 +96,45 @@
       <recent name="" />
     </key>
   </component>
-  <component name="RunManager" selected="JUnit.SolutionTest.findSecondMinimumValue">
-    <configuration name="SolutionTest.checkPossibility" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0665][Non-decreasing Array]" />
+  <component name="RunManager" selected="JUnit.SolutionTest.calPoints">
+    <configuration name="SolutionTest.calPoints" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0682][Baseball Game]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="checkPossibility" />
+      <option name="METHOD_NAME" value="calPoints" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.findErrorNums" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0645][Set Mismatch]" />
+    <configuration name="SolutionTest.checkPossibility" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0665][Non-decreasing Array]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findErrorNums" />
+      <option name="METHOD_NAME" value="checkPossibility" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.findSecondMinimumValue" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0671][Second Minimum Node In a Binary Tree]" />
+    <configuration name="SolutionTest.findLengthOfLCIS" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0674][Longest Continuous Increasing Subsequence]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findSecondMinimumValue" />
+      <option name="METHOD_NAME" value="findLengthOfLCIS" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
         <option name="BSP.BeforeRunTask" enabled="true" />
       </method>
     </configuration>
-    <configuration name="SolutionTest.findTarget" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
-      <module name="[0653][Two Sum IV - Input is a BST]" />
+    <configuration name="SolutionTest.findSecondMinimumValue" type="JUnit" factoryName="JUnit" temporary="true" nameIsGenerated="true">
+      <module name="[0671][Second Minimum Node In a Binary Tree]" />
       <option name="PACKAGE_NAME" value="" />
       <option name="MAIN_CLASS_NAME" value="SolutionTest" />
-      <option name="METHOD_NAME" value="findTarget" />
+      <option name="METHOD_NAME" value="findSecondMinimumValue" />
       <option name="TEST_OBJECT" value="method" />
       <method v="2">
         <option name="Make" enabled="true" />
@@ -156,19 +160,19 @@
       </method>
     </configuration>
     <list>
-      <item itemvalue="JUnit.SolutionTest.findErrorNums" />
-      <item itemvalue="JUnit.SolutionTest.findTarget" />
       <item itemvalue="JUnit.SolutionTest.imageSmoother" />
       <item itemvalue="JUnit.SolutionTest.checkPossibility" />
       <item itemvalue="JUnit.SolutionTest.findSecondMinimumValue" />
+      <item itemvalue="JUnit.SolutionTest.findLengthOfLCIS" />
+      <item itemvalue="JUnit.SolutionTest.calPoints" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="JUnit.SolutionTest.calPoints" />
+        <item itemvalue="JUnit.SolutionTest.findLengthOfLCIS" />
         <item itemvalue="JUnit.SolutionTest.findSecondMinimumValue" />
         <item itemvalue="JUnit.SolutionTest.checkPossibility" />
         <item itemvalue="JUnit.SolutionTest.imageSmoother" />
-        <item itemvalue="JUnit.SolutionTest.findTarget" />
-        <item itemvalue="JUnit.SolutionTest.findErrorNums" />
       </list>
     </recent_temporary>
   </component>
@@ -238,7 +242,8 @@
       <workItem from="1593741641747" duration="4341000" />
       <workItem from="1593846317598" duration="19196000" />
       <workItem from="1593994138409" duration="4028000" />
-      <workItem from="1594083345639" duration="1634000" />
+      <workItem from="1594083345639" duration="3237000" />
+      <workItem from="1594096965599" duration="847000" />
     </task>
     <task id="LOCAL-00040" summary="commit">
       <created>1560552440693</created>
@@ -611,11 +616,11 @@
       <screen x="1440" y="0" width="1920" height="1080" />
     </state>
     <state x="1921" y="215" key="#com.intellij.openapi.keymap.impl.ui.EditKeymapsDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1592906253060" />
-    <state width="1397" height="319" key="GridCell.Tab.0.bottom" timestamp="1594084846600">
+    <state width="1397" height="286" key="GridCell.Tab.0.bottom" timestamp="1594102147278">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="319" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1594084846600" />
-    <state width="1397" height="264" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031068" />
+    <state width="1397" height="286" key="GridCell.Tab.0.bottom/0.0.1440.900@0.0.1440.900" timestamp="1594085022386" />
+    <state width="1397" height="286" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594102147278" />
     <state width="1877" height="402" key="GridCell.Tab.0.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004768" />
     <state width="1397" height="202" key="GridCell.Tab.0.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
     <state width="1877" height="365" key="GridCell.Tab.0.bottom/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735334" />
@@ -627,11 +632,11 @@
     <state width="1359" height="229" key="GridCell.Tab.0.bottom/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.bottom/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.bottom/52.23.1388.877@52.23.1388.877" timestamp="1593066870420" />
-    <state width="1397" height="319" key="GridCell.Tab.0.center" timestamp="1594084846599">
+    <state width="1397" height="286" key="GridCell.Tab.0.center" timestamp="1594102147276">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="319" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1594084846599" />
-    <state width="1397" height="264" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031067" />
+    <state width="1397" height="286" key="GridCell.Tab.0.center/0.0.1440.900@0.0.1440.900" timestamp="1594085022385" />
+    <state width="1397" height="286" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594102147276" />
     <state width="1877" height="402" key="GridCell.Tab.0.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123892" />
     <state width="1877" height="365" key="GridCell.Tab.0.center/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735330" />
@@ -643,11 +648,11 @@
     <state width="1359" height="229" key="GridCell.Tab.0.center/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.center/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.center/52.23.1388.877@52.23.1388.877" timestamp="1593066870418" />
-    <state width="1397" height="319" key="GridCell.Tab.0.left" timestamp="1594084846598">
+    <state width="1397" height="286" key="GridCell.Tab.0.left" timestamp="1594102147276">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="319" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1594084846598" />
-    <state width="1397" height="264" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031065" />
+    <state width="1397" height="286" key="GridCell.Tab.0.left/0.0.1440.900@0.0.1440.900" timestamp="1594085022383" />
+    <state width="1397" height="286" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594102147276" />
     <state width="1877" height="402" key="GridCell.Tab.0.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004766" />
     <state width="1397" height="202" key="GridCell.Tab.0.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123891" />
     <state width="1877" height="365" key="GridCell.Tab.0.left/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735322" />
@@ -659,11 +664,11 @@
     <state width="1359" height="229" key="GridCell.Tab.0.left/43.23.1397.877@43.23.1397.877" timestamp="1592951619607" />
     <state width="678" height="229" key="GridCell.Tab.0.left/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.left/52.23.1388.877@52.23.1388.877" timestamp="1593066870417" />
-    <state width="1397" height="319" key="GridCell.Tab.0.right" timestamp="1594084846599">
+    <state width="1397" height="286" key="GridCell.Tab.0.right" timestamp="1594102147277">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
-    <state width="1397" height="319" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1594084846599" />
-    <state width="1397" height="264" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031068" />
+    <state width="1397" height="286" key="GridCell.Tab.0.right/0.0.1440.900@0.0.1440.900" timestamp="1594085022386" />
+    <state width="1397" height="286" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594102147277" />
     <state width="1877" height="402" key="GridCell.Tab.0.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004767" />
     <state width="1397" height="202" key="GridCell.Tab.0.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123893" />
     <state width="1877" height="365" key="GridCell.Tab.0.right/1440.23.1920.1057/41.23.1399.877@1440.23.1920.1057" timestamp="1593744735333" />
@@ -675,38 +680,38 @@
     <state width="1359" height="229" key="GridCell.Tab.0.right/43.23.1397.877@43.23.1397.877" timestamp="1592951619608" />
     <state width="678" height="229" key="GridCell.Tab.0.right/44.23.1396.877@44.23.1396.877" timestamp="1592952531164" />
     <state width="1400" height="238" key="GridCell.Tab.0.right/52.23.1388.877@52.23.1388.877" timestamp="1593066870419" />
-    <state width="1397" height="319" key="GridCell.Tab.1.bottom" timestamp="1594084846602">
+    <state width="1397" height="319" key="GridCell.Tab.1.bottom" timestamp="1594088716728">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state width="1397" height="319" key="GridCell.Tab.1.bottom/0.0.1440.900@0.0.1440.900" timestamp="1594084846602" />
-    <state width="1397" height="264" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031071" />
+    <state width="1397" height="319" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594088716728" />
     <state width="1877" height="402" key="GridCell.Tab.1.bottom/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.bottom/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123896" />
     <state width="1397" height="324" key="GridCell.Tab.1.bottom/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529748" />
     <state width="1400" height="273" key="GridCell.Tab.1.bottom/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008027" />
-    <state width="1397" height="319" key="GridCell.Tab.1.center" timestamp="1594084846601">
+    <state width="1397" height="319" key="GridCell.Tab.1.center" timestamp="1594088716727">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state width="1397" height="319" key="GridCell.Tab.1.center/0.0.1440.900@0.0.1440.900" timestamp="1594084846601" />
-    <state width="1397" height="264" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031069" />
+    <state width="1397" height="319" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594088716727" />
     <state width="1877" height="402" key="GridCell.Tab.1.center/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.center/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1397" height="324" key="GridCell.Tab.1.center/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
     <state width="1400" height="273" key="GridCell.Tab.1.center/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008026" />
-    <state width="1397" height="319" key="GridCell.Tab.1.left" timestamp="1594084846601">
+    <state width="1397" height="319" key="GridCell.Tab.1.left" timestamp="1594088716727">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state width="1397" height="319" key="GridCell.Tab.1.left/0.0.1440.900@0.0.1440.900" timestamp="1594084846601" />
-    <state width="1397" height="264" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031069" />
+    <state width="1397" height="319" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594088716727" />
     <state width="1877" height="402" key="GridCell.Tab.1.left/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004769" />
     <state width="1397" height="202" key="GridCell.Tab.1.left/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123894" />
     <state width="1397" height="324" key="GridCell.Tab.1.left/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529746" />
     <state width="1400" height="273" key="GridCell.Tab.1.left/1440.23.1920.1057/44.23.1396.877@44.23.1396.877" timestamp="1593416008025" />
-    <state width="1397" height="319" key="GridCell.Tab.1.right" timestamp="1594084846602">
+    <state width="1397" height="319" key="GridCell.Tab.1.right" timestamp="1594088716728">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state width="1397" height="319" key="GridCell.Tab.1.right/0.0.1440.900@0.0.1440.900" timestamp="1594084846602" />
-    <state width="1397" height="264" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594002031070" />
+    <state width="1397" height="319" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594088716728" />
     <state width="1877" height="402" key="GridCell.Tab.1.right/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593746004770" />
     <state width="1397" height="202" key="GridCell.Tab.1.right/1440.23.1920.1057/0.0.1440.900@0.0.1440.900" timestamp="1593569123895" />
     <state width="1397" height="324" key="GridCell.Tab.1.right/1440.23.1920.1057/41.23.1399.877@41.23.1399.877" timestamp="1593655529747" />
@@ -730,19 +735,19 @@
     <state x="1613" y="110" key="SettingsEditor/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966837093" />
     <state x="406" y="168" width="900" height="722" key="SettingsEditor/43.23.1397.877@43.23.1397.877" timestamp="1592950943054" />
     <state x="283" y="156" width="1062" height="722" key="SettingsEditor/44.23.1396.877@44.23.1396.877" timestamp="1592952550242" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1594084517296">
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD" timestamp="1594097597388">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/0.0.1440.900@0.0.1440.900" timestamp="1594084517296" />
-    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401615816" />
+    <state x="436" y="367" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594097597388" />
     <state x="2021" y="441" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744481391" />
     <state x="466" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/43.23.1397.877@43.23.1397.877" timestamp="1592951154917" />
     <state x="472" y="381" key="com.intellij.jarRepository.RepositoryAttachDialog-DOWNLOAD/52.23.1388.877@52.23.1388.877" timestamp="1593065041874" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1594084439945">
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog" timestamp="1594097593006">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/0.0.1440.900@0.0.1440.900" timestamp="1594084439945" />
-    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593401608213" />
+    <state x="499" y="267" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594097593006" />
     <state x="2105" y="320" key="com.intellij.testIntegration.createTest.CreateTestDialog/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593744477730" />
     <state x="252" y="186" key="com.intellij.xdebugger.impl.breakpoints.ui.BreakpointsDialogFactory$2" timestamp="1593851354569">
       <screen x="0" y="0" width="1440" height="900" />
@@ -752,11 +757,11 @@
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="402" y="49" width="636" height="801" key="find.popup/0.0.1440.900@0.0.1440.900" timestamp="1593262516580" />
-    <state x="241" y="113" width="1147" height="750" key="new project wizard" timestamp="1594083515558">
+    <state x="108" y="124" width="1147" height="750" key="new project wizard" timestamp="1594097169907">
       <screen x="0" y="0" width="1440" height="900" />
     </state>
     <state x="241" y="113" width="1147" height="750" key="new project wizard/0.0.1440.900@0.0.1440.900" timestamp="1594083515558" />
-    <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1593396535492" />
+    <state x="108" y="124" width="1206" height="749" key="new project wizard/1440.0.1920.1080/0.0.1440.900@0.0.1440.900" timestamp="1594097169907" />
     <state x="1618" y="163" key="new project wizard/1440.0.1920.1080/0.0.1440.900@1440.0.1920.1080" timestamp="1593743567550" />
     <state x="1440" y="172" key="new project wizard/1440.23.1920.1057/43.23.1397.877@1440.23.1920.1057" timestamp="1592966881705" />
     <state x="108" y="144" key="new project wizard/41.23.1399.877@41.23.1399.877" timestamp="1593387189945" />
diff --git a/[0674][Longest Continuous Increasing Subsequence]/[0674][Longest Continuous Increasing Subsequence].iml b/[0674][Longest Continuous Increasing Subsequence]/[0674][Longest Continuous Increasing Subsequence].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0674][Longest Continuous Increasing Subsequence]/[0674][Longest Continuous Increasing Subsequence].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>
\ No newline at end of file
diff --git a/[0674][Longest Continuous Increasing Subsequence]/src/Solution.java b/[0674][Longest Continuous Increasing Subsequence]/src/Solution.java
new file mode 100644
index 0000000..5a15c9f
--- /dev/null
+++ b/[0674][Longest Continuous Increasing Subsequence]/src/Solution.java	
@@ -0,0 +1,30 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-07 10:03
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+
+    public int findLengthOfLCIS(int[] nums) {
+        if (nums == null) {
+            return 0;
+        } else if (nums.length < 2) {
+            return nums.length;
+        }
+
+        int prev = 0;
+        int max = 0;
+        for (int i = 1; i < nums.length; i++) {
+            while (i < nums.length && nums[i - 1] < nums[i]) {
+                i++;
+            }
+
+            max = Math.max(max, i - prev);
+            prev = i;
+        }
+
+        return max;
+    }
+}
diff --git a/[0674][Longest Continuous Increasing Subsequence]/src/SolutionTest.java b/[0674][Longest Continuous Increasing Subsequence]/src/SolutionTest.java
new file mode 100644
index 0000000..351e6f5
--- /dev/null
+++ b/[0674][Longest Continuous Increasing Subsequence]/src/SolutionTest.java	
@@ -0,0 +1,27 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-07 10:07
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void findLengthOfLCIS() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new int[]{1, 3, 5, 4, 7}, 3},
+                {new int[]{2, 2, 2, 2, 2}, 1},
+                {new int[]{1, 2, 3, 4, 5}, 5},
+                {new int[]{2, 2, 3, 4, 5}, 4},
+        };
+
+        for (Object[] d : data) {
+            int result = s.findLengthOfLCIS((int[]) d[0]);
+            Assert.assertEquals(d[1], result);
+        }
+    }
+}
\ No newline at end of file
diff --git a/[0680][Valid Palindrome II]/[0680][Valid Palindrome II].iml b/[0680][Valid Palindrome II]/[0680][Valid Palindrome II].iml
new file mode 100644
index 0000000..c90834f
--- /dev/null
+++ b/[0680][Valid Palindrome II]/[0680][Valid Palindrome 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>
\ No newline at end of file
diff --git a/[0680][Valid Palindrome II]/src/Solution.java b/[0680][Valid Palindrome II]/src/Solution.java
new file mode 100644
index 0000000..9ae5eb2
--- /dev/null
+++ b/[0680][Valid Palindrome II]/src/Solution.java	
@@ -0,0 +1,35 @@
+/**
+ * Author: 王俊超
+ * Time: 2020-07-07 10:12
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public boolean validPalindrome(String s) {
+        int start = 0;
+        int end = s.length() - 1;
+        while (start < end) {
+            // 有一个不相等，可以抛弃start或者end字符，抛弃一个字符后，后面的都要是回文
+            if (s.charAt(start) != s.charAt(end)) {
+                return validPalindrome(s, start + 1, end) || validPalindrome(s, start, end - 1);
+            }
+            start++;
+            end--;
+        }
+
+        return true;
+    }
+
+    private boolean validPalindrome(String s, int start, int end) {
+        while (start < end) {
+            if (s.charAt(start) != s.charAt(end)) {
+                return false;
+            }
+            start++;
+            end--;
+        }
+
+        return true;
+    }
+}
diff --git a/[0682][Baseball Game]/[0682][Baseball Game].iml b/[0682][Baseball Game]/[0682][Baseball Game].iml
new file mode 100644
index 0000000..c70cbf1
--- /dev/null
+++ b/[0682][Baseball Game]/[0682][Baseball Game].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>
\ No newline at end of file
diff --git a/[0682][Baseball Game]/src/Solution.java b/[0682][Baseball Game]/src/Solution.java
new file mode 100644
index 0000000..4af7f26
--- /dev/null
+++ b/[0682][Baseball Game]/src/Solution.java	
@@ -0,0 +1,43 @@
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-07 12:46
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class Solution {
+    public int calPoints(String[] ops) {
+
+        if (ops == null || ops.length < 1) {
+            return 0;
+        }
+        List<Integer> round = new LinkedList<>();
+
+        for (String o : ops) {
+            int size = round.size();
+            switch (o) {
+                case "+":
+                    round.add(round.get(size - 1) + round.get(size - 2));
+                    break;
+                case "D":
+                    round.add(2 * round.get(size - 1));
+                    break;
+                case "C":
+                    round.remove(size - 1);
+                    break;
+                default:
+                    round.add(Integer.parseInt(o));
+            }
+        }
+
+        int sum = 0;
+        for(Integer n : round) {
+            sum += n;
+        }
+
+        return sum;
+    }
+}
diff --git a/[0682][Baseball Game]/src/SolutionTest.java b/[0682][Baseball Game]/src/SolutionTest.java
new file mode 100644
index 0000000..1cf9c9d
--- /dev/null
+++ b/[0682][Baseball Game]/src/SolutionTest.java	
@@ -0,0 +1,25 @@
+import org.junit.Assert;
+
+/**
+ * Author: 王俊超
+ * Time: 2020-07-07 12:53
+ * CSDN: http://blog.csdn.net/derrantcm
+ * Github: https://github.com/Wang-Jun-Chao
+ * Declaration: All Rights Reserved !!!
+ **/
+public class SolutionTest {
+
+    @org.junit.Test
+    public void calPoints() {
+        Solution s = new Solution();
+        Object[][] data = {
+                {new String[]{"5", "2", "C", "D", "+"}, 30},
+                {new String[]{"5", "-2", "4", "C", "D", "9", "+", "+"}, 27},
+        };
+
+        for (Object[] d : data) {
+            int result = s.calPoints((String[]) d[0]);
+            Assert.assertEquals(d[1], result);
+        }
+    }
+}
\ No newline at end of file