【CODE】最长递增子序列

673. Number of Longest Increasing Subsequence

Medium

111872Add to ListShare

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

Example 1:

Input: [1,3,5,4,7]
Output: 2
Explanation: The two longest increasing subsequence are [1, 3, 4, 7] and [1, 3, 5, 7].

Example 2:

Input: [2,2,2,2,2]
Output: 5
Explanation: The length of longest continuous increasing subsequence is 1, and there are 5 subsequences' length is 1, so output 5.

Note: Length of the given array will be not exceed 2000 and the answer is guaranteed to be fit in 32-bit signed int.

class Solution {
public:
    /*Runtime: 40 ms, faster than 77.91% of C++ online submissions for Number of Longest Increasing Subsequence.
    Memory Usage: 8.2 MB, less than 100.00% of C++ online submissions for Number of Longest Increasing Subsequence.*/
    int findNumberOfLIS(vector<int>& nums) {
        vector<int> len(nums.size(),1),cnt(nums.size(),1);
        int maxx=0,res=0;
        for(int i=0;i<nums.size();i++){
            for(int j=0;j<i;j++){
                if(nums[i]<=nums[j]) continue;
                else{
                    if(len[i]==len[j]+1) cnt[i]+=cnt[j];
                    else if(len[i]<len[j]+1){
                        cnt[i]=cnt[j];
                        len[i]=len[j]+1;
                    }
                }
            }
            if(maxx<len[i]){
                maxx=len[i];
                res=cnt[i];
            }else if(maxx==len[i]){
                res+=cnt[i];
            }
        }
        return res;
    }
};

#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
//单纯求LIS长度
//1.dp
int main1() {
	vector<int> nums = { 3,1,2,6,4,5,10,7 };
	vector<int> dp(nums.size(),1);
	int maxx = 0;
	for (int i = 0; i < nums.size(); i++) {
		for (int j = 0; j < i; j++) {
			if (nums[i] <= nums[j]) continue;
			dp[i] = max(dp[i], dp[j] + 1);
		}
		if (maxx < dp[i]) maxx = dp[i];
	}
	cout << maxx;
	return 0;
}
//2.二分查找+贪心
int main2() {
	vector<int> nums = { 3,1,2,6,4,5,10,7 };
	vector<int> dp;
	int maxx = 0;
	dp.push_back(nums[0]);
	for (int i = 1; i < nums.size(); i++) {
		if (dp.back() < nums[i]) dp.push_back(nums[i]);
		else {
			int dir = lower_bound(dp.begin(), dp.end(), nums[i])-dp.begin();
			dp[dir] = nums[i];
		}
	}
	cout << dp.size();
	return 0;
}
int main() {
	main2();
	main1();
	return 0;
}