Longest Increasing Subsequence
来源:互联网 发布:广州经纬之创网络 编辑:程序博客网 时间:2024/05/01 00:47
问题:
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 is4
. Note that there may be more than one LIS combination, it is only necessary for you to return the length.
思路:
该题采用动态规划的思想来解决,用F(i)表示以数组i处元素结尾的最长递增子序列,则F(i + 1) = max(F(k) + 1), (其中k在0~i之间,且数组的第k个元素小于第i + 1 个元素)。
代码:
class Solution {public: int lengthOfLIS(vector<int>& nums) { int size = nums.size(); if(size < 1){ return 0; } int *cache = new int[size]; for(int i = 0; i < size; i++){ cache[i] = 0; } cache[0] = 1; int result = 1; for(int i = 1; i < size; i++){ int maxsize = 1; for(int j = i - 1; j >= 0; j--){ if(nums[i] > nums[j]){ if(cache[j] + 1 > maxsize){ maxsize = cache[j] + 1; } } } cache[i] = maxsize; if(cache[i] > result){ result = cache[i]; } } return result; }};
0 0
- Longest Increasing Subsequence
- 【DP】 Longest Increasing Subsequence
- Longest Increasing Subsequence(LIS)
- Longest Increasing Subsequence
- 【算法】Longest Increasing Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence(LIS)
- Longest Increasing Subsequence
- [DP]Longest Increasing Subsequence
- The Longest increasing subsequence
- [刷题]Longest Increasing Subsequence
- longest-increasing-subsequence
- Longest Increasing Subsequence
- codeforces568E.Longest Increasing Subsequence
- Longest Increasing Subsequence
- CSDN博客插入图片
- oracle查询仅中文使用lengthb()方法
- XJOI 公交线路
- J版OpenStack spice云桌面加入声卡设备
- 【基础练习】【并查集】codevs2796 最小完全图题解
- Longest Increasing Subsequence
- Eclipse中clean server失败
- JS浏览器对象
- 基于Metronic的Bootstrap开发框架经验总结(8)--框架功能总体界面介绍
- 非模态对话框的创建及销毁
- The project cannot be built until build path errors are resolved解决方案
- Android播放器, ffmpeg源码添加打印,在logcat显示
- R语言用Shiny包快速搭建交互网页应用
- python sorted()函数cmp,key,reverse参数详解