Merge branch 'master' of github.com:tujietg/leetcode

Author: tujietg

README.md

@@ -17,52 +17,53 @@ I really **enjoy** it, I will always update it.
   - [DP](#6)
 
 <h2 id = 0>leetcode</h3>
-
 <h3 id = 1>Array</h4>
 
+
 | Problem                                                      | Solution                                                     | Time | Difficulty | Note            |
 | ------------------------------------------------------------ | ------------------------------------------------------------ | ---- | ---------- | --------------- |
-| [26.Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [java](https://github.com/tujietg/leetcode/blob/master/Array/No26.java) | O(N) | Easy       |                 |
-| [27.Remove Element](https://leetcode.com/problems/remove-element) | [java](https://github.com/tujietg/leetcode/blob/master/Array/No27.java) | O(N) | Easy       |                 |
-| [35.Search Insert Position](https://leetcode.com/problems/search-insert-position) | [java](https://github.com/tujietg/leetcode/blob/master/Array/No35.java) | O(N) | Easy       |                 |
-| [53.Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [java](https://github.com/tujietg/leetcode/blob/master/Array/No53.java) |      | Easy       |                 |
-| [66.Plus One](https://leetcode.com/problems/plus-one)        | [java](https://github.com/tujietg/leetcode/blob/master/Array/No66.java) | O(N) | Easy       |                 |
-| [1.Two Sum](https://leetcode.com/problems/two-sum)           | [java](https://github.com/tujietg/leetcode/blob/master/Array/No1.java) |      |            |                 |
-| [14.Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [java](https://github.com/tujietg/leetcode/blob/master/Array/No14.java) | O(N) | Easy       | 😩第一个元素范围 |
+| [26.Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/Array/No26.java) | O(N) | Easy       |                 |
+| [27.Remove Element](https://leetcode.com/problems/remove-element) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/Array/No27.java) | O(N) | Easy       |                 |
+| [35.Search Insert Position](https://leetcode.com/problems/search-insert-position) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/Array/No35.java) | O(N) | Easy       |                 |
+| [53.Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/Array/No53.java) |      | Easy       |                 |
+| [66.Plus One](https://leetcode.com/problems/plus-one)        | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/Array/No66.java) | O(N) | Easy       |                 |
+| [1.Two Sum](https://leetcode.com/problems/two-sum)           | [java](https://github.com/tujietg/Algorithm/blob/master/Array/No1.java) |      |            |                 |
+| [14.Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/Array/No14.java) | O(N) | Easy       | 😩第一个元素范围 |
 
 <h3 id = 2>LinkedList</h4>
 
 | Problem                                                      | Solution                                                     | Time | Difficulty | Note |
 | ------------------------------------------------------------ | ------------------------------------------------------------ | ---- | ---------- | ---- |
-| [21.Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [java](https://github.com/tujietg/leetcode/blob/master/LinkedList/No21.java) | O(N) | Easy       |      |
+| [21.Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/LinkedList/No21.java) | O(N) | Easy       |      |
 
 <h3 id = 3>String</h4>
 
-| Problem                                                      | Solution                                                     | Time         | Difficulty | Note                         |
-| ------------------------------------------------------------ | ------------------------------------------------------------ | ------------ | ---------- | ---------------------------- |
-| [28.Implement strStr()](https://leetcode.com/problems/implement-strstr) | [java](https://github.com/tujietg/leetcode/blob/master/String/No28.java) | O(N)\|\|O(1) | Easy       |                              |
-| [58.Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [java](https://github.com/tujietg/leetcode/blob/master/String/No58.java) |              | Easy       |                              |
-| [20.Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [java](https://github.com/tujietg/leetcode/blob/master/String/No20.java) | O(N)         | Easy       | 🤣最终的返回为stack.isEmpty() |
+| Problem                                                      | Solution                                                     | Time         | Difficulty | Note                                |
+| ------------------------------------------------------------ | ------------------------------------------------------------ | ------------ | ---------- | ----------------------------------- |
+| [28.Implement strStr()](https://leetcode.com/problems/implement-strstr) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/String/No28.java) | O(N)\|\|O(1) | Easy       |                                     |
+| [58.Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/String/No58.java) |              | Easy       |                                     |
+| [20.Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/String/No20.java) | O(N)         | Easy       | 🤣最终的返回为stack.isEmpty()        |
+| [125.Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/String/No125.java) |              | Easy       | API:isLetterOrDigit() toLowerCase() |
 
 <h3 id = 4>Tree</h3>
 
 | Problem                                                  | Solution                                                     | Time | Difficulty | Note |
 | -------------------------------------------------------- | ------------------------------------------------------------ | ---- | ---------- | ---- |
-| [100.Same Tree](https://leetcode.com/problems/same-tree) | [java](https://github.com/tujietg/leetcode/blob/master/Tree/No100.java) | O(N) | Easy       |      |
+| [100.Same Tree](https://leetcode.com/problems/same-tree) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/Tree/No100.java) | O(N) | Easy       |      |
 |                                                          |                                                              |      |            |      |
 
 <h3 id = 5>Math</h3>
 
 | Problem                                                      | Solution                                                     | Time | Difficulty | Note |
 | ------------------------------------------------------------ | ------------------------------------------------------------ | ---- | ---------- | ---- |
-| [7.Reverse Integer](https://leetcode.com/problems/reverse-integer) | [java](https://github.com/tujietg/leetcode/blob/master/math/No07.java) |      | Easy       |      |
-| [9.Palindrome Number](https://leetcode.com/problems/palindrome-number) | [java](https://github.com/tujietg/leetcode/blob/master/math/No09.java) | O(N) | Easy       |      |
+| [7.Reverse Integer](https://leetcode.com/problems/reverse-integer) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/math/No07.java) |      | Easy       |      |
+| [9.Palindrome Number](https://leetcode.com/problems/palindrome-number) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/math/No09.java) | O(N) | Easy       |      |
 
 <h3 id="6">DP</h3>
 
 | Problem                                                      | Solution                                                     | Time | Difficulty | Note                                                         |
 | ------------------------------------------------------------ | ------------------------------------------------------------ | ---- | ---------- | ------------------------------------------------------------ |
-| [70.Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [java](https://github.com/tujietg/leetcode/blob/master/DP/No70.java) | O(N) | Easy       | [DP初步讲解](https://leetcode.com/articles/climbing-stairs/) & [讲解](https://leetcode.com/problems/climbing-stairs/discuss/163347/Python-3000DP-or-tm) |
+| [70.Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [java](https://github.com/tujietg/Algorithm/blob/master/leetcode/DP/No70.java) | O(N) | Easy       | [DP初步讲解](https://leetcode.com/articles/climbing-stairs/) & [讲解](https://leetcode.com/problems/climbing-stairs/discuss/163347/Python-3000DP-or-tm) |