Leetcode300. Longest Increasing Subsequence

Given an unsorted array of integers, find the length of longest
increasing subsequence.

Example:

Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation: The longest
increasing subsequence is [2,3,7,101], therefore the length is 4.
Note:

There may be more than one LIS combination, it is only necessary for
you to return the length. Your algorithm should run in O(n2)
complexity. Follow up: Could you improve it to O(n log n) time complexity?

动态规划，40ms

class Solution {
public:
	int lengthOfLIS(vector<int>& nums) {
		int len = nums.size(), ret = 0,minnum=INT_MAX;
		if (len <= 1) {
			return len;
		}
		vector<int> dp(len, 0);
		dp[0] = 1;
		minnum = nums[0];
		for (int i = 0; i <len; ++i) {
			for (int j = 0; j <i;++j) {
				if (nums[j] < nums[i]&&dp[i]<=dp[j] + 1) {
					dp[i] = dp[j] + 1;
				}
				else if(dp[i]==0)
				{
					dp[i] =1;
				}
			}
			//cout << dp[i] << endl;
			if (ret < dp[i]) {
				ret = dp[i];
			}
		}
		return ret;
	}
};