leetcode::longest_increasing_subsequence::Solution类 参考

#include <leetcode.h>

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

详细描述

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

成员函数说明

lengthOfLIS()

int leetcode::longest_increasing_subsequence::Solution::lengthOfLIS ( vector< int > & nums )

static

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

                                                   {
            const int n = nums.size();
            int ans     = 1;
            vector dp(n, 1);//length of longest increasing subsequence end with i
            for(int i = 0; i < n; i++) {
                for(int j = i + 1; j < n; j++) {
                    if(nums[j] > nums[i]) {
                        dp[j] = max(dp[j], dp[i] + 1);
                    }
                }
                ans = max(ans, dp[i]);
            }
            return ans;
        }

被这些函数引用 leetcode::longest_increasing_subsequence::TEST(), leetcode::longest_increasing_subsequence::TEST() , 以及 leetcode::longest_increasing_subsequence::TEST().

---

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

• leetcode.h
• leetcode.cpp