leetcode:Longest Increasing Subsequence
来源：互联网 发布：美国人学编程难吗 编辑：程序博客网 时间：2024/05/19 22:02
Given an unsorted array of integers, find the length of longest increasing subsequence.
For example,
Given [10, 9, 2, 5, 3, 7, 101, 18],
The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note that 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.
class Solution {public:int lengthOfLIS(vector<int>& nums) { if(nums.empty()) return 0;int size = nums.size();vector<int> length(size,1);for(int i=1;i<size;i++){int largest = 0;int len = 0;for(int j=0;j<i;j++){if(nums[i]>nums[j]){len = length[j]+1;}else{len = 1;}if(len>largest){largest = len;}}length[i] = largest;}int l =0;vector<int>::iterator it = length.begin();for(;it!=length.end();it++){if(*it>l)l=*it;}return l;}}; 0 0
- [LeetCode]Longest Increasing Subsequence
- [LeetCode] Longest Increasing Subsequence
- leetcode-Longest Increasing Subsequence
- [LeetCode]Longest Increasing Subsequence
- *LeetCode-Longest Increasing Subsequence
- Leetcode: Longest Increasing Subsequence
- LeetCode Longest Increasing Subsequence
- LeetCode -- Longest Increasing Subsequence
- [Leetcode]Longest Increasing Subsequence
- LeetCode Longest Increasing Subsequence
- Longest increasing subsequence |LeetCode
- Leetcode Longest Increasing Subsequence
- Leetcode: Longest Increasing Subsequence
- 【Leetcode】Longest Increasing Subsequence
- [Leetcode]Longest Increasing Subsequence
- leetcode--Longest Increasing Subsequence
- [LeetCode]Longest Increasing Subsequence
- [leetcode]Longest Increasing Subsequence
- BeanUtils Exception 之 FastHashMap
- nginx代理服务器
- 我的Redis集群搭建之路
- Swift - 是时候学习Swift了
- 十分钟认识单例模式的多种姿势
- leetcode:Longest Increasing Subsequence
- 迷宫求解
- Spring整合Shiro做权限控制模块详细案例分析
- 14.9.4 COMPACT and REDUNDANT Row Formats
- 【leetcode】21. Merge Two Sorted Lists
- MapReduce基础开发之六Map多输入
- 黑马程序员_Java基础_我的day01学习笔记
- 花生壳动态域名软件功能、服务有哪些？
- Generate Parentheses
