leetcode::number_of_longest_increasing_subsequence::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	findNumberOfLIS (vector< int > &nums)

详细描述

在文件 leetcode.h 第 2499 行定义.

成员函数说明

findNumberOfLIS()

int leetcode::number_of_longest_increasing_subsequence::Solution::findNumberOfLIS ( vector< int > &  nums )

static

在文件 leetcode.cpp 第 6733 行定义.

                                                       {
            const int n = nums.size();
            vector dp(n, map<unsigned, unsigned>());//dp[i][j] = number of increasing subsequence end with i, length is j
            for(int i = 0; i < n; i++) {
                dp[i][1] = 1;
            }
            unsigned max_len = 1;
            for(int i = 0; i < n; i++) {
                for(int j = i + 1; j < n; j++) {
                    auto &[len, cnt] = *dp[i].rbegin();
                    if(nums[j] > nums[i]) {
                        dp[j][len + 1] += cnt;
                        max_len = max(max_len, len + 1);
                    }
                }
            }
            unsigned ans = 0;
            for(int i = 0; i < n; i++) {
                ans += dp[i][max_len];
            }
            return ans;
        }

被这些函数引用 leetcode::number_of_longest_increasing_subsequence::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp