300. Longest Increasing Subsequence
来源:互联网 发布:ug螺纹铣刀编程 编辑:程序博客网 时间:2024/05/17 04:09
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) { int size = nums.size(); if (size == 0) return 0; vector<int> len(size, 1); int res = 1; for (int i = 1; i < size; ++i) { for (int j = 0; j < i; ++j) { if (nums[j] < nums[i]) len[i] = max(len[i], len[j]+1); }//for res = max (res, len[i]); }//for return res; }};
0 0
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- 300. Longest Increasing Subsequence
- centos 切换用户显示bash-4.2$,不显示用户名路径的问题
- 剑指offer:(10)位运算,计算二进制中1的个数
- 码农的慢思考
- Java 的包
- 97.5%准确率的深度学习中文分词(字嵌入+Bi-LSTM+CRF)
- 300. Longest Increasing Subsequence
- Tensorflow高阶读写教程
- Unable to compile class for JSP 问题解决方法
- 图形入门
- 《代码大全》学习笔记
- SSM框架(Spring+SpringMVC +Mybatis)
- fatal error: highgui.h: No such file or directory
- Nginx 安装和使用 +keepalived高可用
- 第三十八讲项目一 大奖赛计分(续一)