add 300

Author: codename1995

README.md

@@ -24,7 +24,8 @@ LeetCode solution (C++ and Python)
 064 [Minimum Path Sum](https://leetcode-cn.com/problems/minimum-path-sum/) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/64_Minimum_Path_Sum/64_Minimum_Path_Sum.cpp) | 1. DP|
 070 [Climbing Stairs](https://leetcode-cn.com/problems/climbing-stairs/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/70_Climbing_Stairs/70_Climbing_Stairs.cpp) | 1. DP|
 121 [Best Time To Buy And Sell Stock](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/submissions/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/121_Best_Time_To_Buy_And_Sell_Stock/121_Best_Time_To_Buy_And_Sell_Stock.cpp) | 1. DP|
-322 [Coin Change](https://leetcode-cn.com/problems/coin-change/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/322_Coin_Change/322_Coin_Change.cpp) | 1. DP (Top-down)|
+300 [Longest Increasing Subsequence](https://leetcode-cn.com/problems/longest-increasing-subsequence/solution/zui-chang-shang-sheng-zi-xu-lie-dong-tai-gui-hua-2/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/300_Longest_Increasing_Subsequence/300_Longest_Increasing_Subsequence.cpp) | 1. DP O(n^2) <br> 2. DP + Binary Searcy O(nlogn)|
+322 [Coin Change](https://leetcode-cn.com/problems/coin-change/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/322_Coin_Change/322_Coin_Change.cpp) | 1. DP (Bottom-Up)|
 | 337 [House Robber III](https://leetcode-cn.com/problems/house-robber-iii/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/337_House_Robber_III/337_House_Robber_III.cpp) | 1. 树型DP，子函数返回{MaxWithCurrNode, MaxWithoutCurrNode} |
 
 # Sort by coding-interview (剑指offer)

cpp/300_Longest_Increasing_Subsequence/300_Longest_Increasing_Subsequence.cpp

@@ -0,0 +1,59 @@
+#include <string>
+#include <iostream>
+#include <vector>
+#include <iterator>
+#include <algorithm>
+#include <stack>
+#include <random>
+#include <numeric>
+#include <iomanip>
+#include <map>
+#include <cmath>
+#include <cstring>
+
+using namespace std;
+
+class Solution {
+public:
+	int lengthOfLIS(vector<int>& nums) {
+		// 2. DP + BinarySearch
+		// O(n logn)
+		// It works, but hard to recall it in an interview
+		// Specifically, update an array ('tails') which store a increasing subarray
+		// Visit all numbers, and
+		//	if one number larger than all numbers in 'tails', then append it at last
+		//	otherwise, insert it into 'tails' by binary search.
+		if (nums.size() == 0) return 0;
+		vector<int> tails(1, nums[0]);
+		for (int i = 1; i < nums.size(); ++i)
+		{
+			if (nums[i] > tails.back()) tails.push_back(nums[i]);
+			else {
+				int l = 0, r = tails.size() - 1;
+				while (l < r)
+				{
+					int m = (l + r) >> 1;
+					if (tails[m] < nums[i]) l = m + 1;
+					else r = m;
+				}
+				tails[l] = nums[i];
+			}
+		}
+		return tails.size();
+
+		// 1. DP
+		// O(n^2)
+		if (nums.size() == 0) return 0;
+		vector<int> dp(nums.size(), 1);
+		for (int i = 1; i < nums.size(); ++i) {
+			for (int j = 0; j < i; ++j) {
+				if (nums[j] < nums[i])
+					dp[i] = max(dp[i], dp[j] + 1);
+			}
+		}
+		int maxx = dp[0];
+		for (auto n : dp)
+			maxx = max(maxx, n);
+		return maxx;
+	}
+};