115

Author: wind-liang

SUMMARY.md

@@ -4,8 +4,8 @@
 * [1. Two Sum](leetCode-1-Two-Sum.md)
 * [2. Add Two Numbers](leetCode-2-Add-Two-Numbers.md)
 * [3. Longest Substring Without Repeating Characters](leetCode-3-Longest-Substring-Without-Repeating-Characters.md)
-* [4. Median of Two Sorted Arrays](leetCode-4-Median-of-Two-Sorted-Arrays.md)
-* [5. Longest Palindromic Substring](leetCode-5-Longest-Palindromic-Substring.md)
+* [4*. Median of Two Sorted Arrays](leetCode-4-Median-of-Two-Sorted-Arrays.md)
+* [5*. Longest Palindromic Substring](leetCode-5-Longest-Palindromic-Substring.md)
 * [6. ZigZag Conversion](leetCode-6-ZigZag-Conversion.md)
 * [7. Reverse Integer](leetCode-7-Reverse-Integer.md)
 * [8. String to Integer](leetCode-8-String-to-Integer.md)
@@ -50,7 +50,7 @@
 * [47. Permutations II](leetCode-47-Permutations-II.md)
 * [48. Rotate Image](leetCode-48-Rotate-Image.md)
 * [49. Group Anagrams](leetCode-49-Group-Anagrams.md)
-* [50. Pow(x, n)](leetCode-50-Pow.md)
+* [50*. Pow(x, n)](leetCode-50-Pow.md)
 * [51. N-Queens](leetCode-51-N-Queens.md)
 * [52. N-Queens II](leetCode-52-N-QueensII.md)
 * [53. Maximum Subarray](leetCode-53-Maximum-Subarray.md)
@@ -95,14 +95,14 @@
 * [92. Reverse Linked List II](leetCode-92-Reverse-Linked-ListII.md)
 * [93. Restore IP Addresses](leetCode-93-Restore-IP-Addresses.md)
 * [94. Binary Tree Inorder Traversal](leetCode-94-Binary-Tree-Inorder-Traversal.md)
-* [95. Unique Binary Search Trees II](leetCode-95-Unique-Binary-Search-TreesII.md)
+* [95*. Unique Binary Search Trees II](leetCode-95-Unique-Binary-Search-TreesII.md)
 * [96. Unique Binary Search Trees](leetCode-96-Unique-Binary-Search-Trees.md)
 * [97. Interleaving String](leetCode-97-Interleaving-String.md)
 * [98. Validate Binary Search Tree](leetCode-98-Validate-Binary-Search-Tree.md)
 * [99. Recover Binary Search Tree](leetcode-99-Recover-Binary-Search-Tree.md)
 * [100. Same Tree](leetcode-100-Same-Tree.md)
 * [leetcode 100 斩！回顾](leetcode100斩回顾.md)
-* [101 题到 114 题](leetcode-101-200.md)
+* [101 题到 115 题](leetcode-101-200.md)
     * [101. Symmetric Tree](leetcode-101-Symmetric-Tree.md)
     * [102. Binary Tree Level Order Traversal](leetcode-102-Binary-Tree-Level-Order-Traversal.md)
     * [103. Binary Tree Zigzag Level Order Traversal](leetcode-103-Binary-Tree-Zigzag-Level-Order-Traversal.md)
@@ -116,4 +116,5 @@
     * [111. Minimum Depth of Binary Tree](leetcode-111-Minimum-Depth-of-Binary-Tree.md)
     * [112. Path Sum](leetcode-112-Path-Sum.md)
     * [113. Path Sum II](leetcode-113-Path-SumII.md)
-    * [114. Flatten Binary Tree to Linked List](leetcode-114-Flatten-Binary-Tree-to-Linked-List.md)
+    * [114. Flatten Binary Tree to Linked List](leetcode-114-Flatten-Binary-Tree-to-Linked-List.md)
+    * [115*. Distinct Subsequences](leetcode-115-Distinct-Subsequences.md)

leetcode-101-200.md

@@ -24,4 +24,6 @@
 
 <a href="leetcode-113-Path-SumII.html">113. Path Sum II</a>
 
-<a href="leetcode-114-Flatten-Binary-Tree-to-Linked-List.html">114. Flatten Binary Tree to Linked List</a>
+<a href="leetcode-114-Flatten-Binary-Tree-to-Linked-List.html">114. Flatten Binary Tree to Linked List</a>
+
+<a href="leetcode-115-Distinct-Subsequences.html">115. Distinct Subsequences</a>

leetcode-108-Convert-Sorted-Array-to-Binary-Search-Tree.md

@@ -225,7 +225,7 @@ public TreeNode sortedArrayToBST3(int[] nums) {
 int mid = (start + end) / 2
 ```
 
-但这样有一个缺点，我们知道`int`的最大值是 `Integer.MAX_VALUE` ，也就是`2147483647`。那么有一个问题，如果 `start = 2147483645`，`end = = 2147483645`，虽然 `start` 和 `end`都没有超出最大值，但是如果利用上边的公式，加起来的话就会造成溢出，从而导致`mid`计算错误。
+但这样有一个缺点，我们知道`int`的最大值是 `Integer.MAX_VALUE` ，也就是`2147483647`。那么有一个问题，如果 `start = 2147483645`，`end = 2147483645`，虽然 `start` 和 `end`都没有超出最大值，但是如果利用上边的公式，加起来的话就会造成溢出，从而导致`mid`计算错误。
 
 解决的一个方案就是利用数学上的技巧，我们可以加一个 `start` 再减一个 `start` 将公式变形。