update: 300

Author: hijiangtao

README.md

@@ -101,10 +101,11 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 |289|[Game of Life](https://leetcode.com/problems/game-of-life/) | [JavaScript](./src/game-of-life/res.js)|Medium|
 |295|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [JavaScript](./src/find-median-from-data-stream/res.js)|Hard|
 |299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/) | [JavaScript](./src/bulls-and-cows/res.js)|Medium|
+|300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [JavaScript](./src/longest-increasing-subsequence/res.js)|Medium|
 |307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | [JavaScript](./src/range-sum-query-mutable/res.js)|Medium|
 |309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [JavaScript](./src/best-time-to-buy-and-sell-stock-with-cooldown/res.js)|Medium|
 |310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | [JavaScript](./src/minimum-height-trees/res.js)|Medium|
-|315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | [JavaScript](./src/count-of-smaller-numbers-after-self/res.js)|Hard|
+|315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) <sup>*</sup> | [JavaScript](./src/count-of-smaller-numbers-after-self/res.js)|Hard|
 |327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/) | [JavaScript](./src/count-of-range-sum/res.js)|Hard|
 |334|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | [JavaScript](./src/increasing-triplet-subsequence/res.js)|Medium|
 |342|[Power of Four](https://leetcode.com/problems/power-of-four/) | [JavaScript](./src/power-of-four/res.js)|Easy|

src/count-of-smaller-numbers-after-self/res.js

@@ -18,13 +18,16 @@ var countSmaller = function(nums) {
 }
 
 mid = left + parseInt((right - left) / 2);
-
+
+// 计算一下左边
 helper(nums, left, mid, indexList)
+// 计算一下右边
 helper(nums, mid + 1, right, indexList)
 
 if(nums[indexList[mid]] < nums[indexList[mid+1]])
 return ;
 
+// 两个子序列合并
 sort_and_count_smaller(nums, left, mid, right, indexList);
 }
 

src/longest-increasing-subsequence/res.js

@@ -0,0 +1,22 @@
+/**
+* @param {number[]} nums
+* @return {number}
+*/
+var lengthOfLIS = function(nums) {
+const len = nums.length;
+if (len < 2) return len;
+
+const res = nums.map(() => 1);
+
+for (let i = 0; i < len; i++) {
+for (let j = 0; j < i; j++) {
+if (nums[i] > nums[j]) {
+res[i] = Math.max(res[i], res[j]+1);
+}
+}
+}
+
+let max = res[0];
+res.map(e => e > max ? max=e:null);
+return max;
+};