300. Longest Increasing Subsequence
2016-05-01 14:49
537 查看
//124ms class Solution { public: int lengthOfLIS(vector<int>& n) { if(n.empty()) return 0; vector<int> v(n.size(),1); int m=1; for(int i=1;i<n.size();i++) { for(int j=0;j<i;j++) { if(n[j]<n[i]) v[i]=max(v[i],v[j]+1); } m=max(m,v[i]); } return m; } };
//4ms class Solution { public: int lengthOfLIS(vector<int>& n) { if(n.empty()) return 0; int len=1; for(int i=1;i<n.size();i++) { if(n[i]<n[len-1]) { auto it=lower_bound(n.begin(),n.begin()+len,n[i]); *it=n[i]; } else if(n[i]>n[len-1]) { n[len]=n[i]; len++; } } return len; } };
class Solution { public: int lengthOfLIS(vector<int>& n) { if(n.empty()) return 0; vector<int>::iterator m=n.begin(); for(int i=0;i<n.size();i++) { auto it=lower_bound(n.begin(),m,n[i]); *it=n[i]; if(it==m) m++; } return m-n.begin(); } };
相关文章推荐
- 2016 UESTC Training for Data Structures R - Japan CDOJ 383 树状数组 逆序对
- 2016 UESTC Training for Data Structures Q - 昊昊爱运动 II CDOJ 1259 线段树+bitset
- 2016 UESTC Training for Data Structures P - 浑身难受 CDOJ 1276 树状数组
- 2016 UESTC Training for Data Structures O - 卿学姐种美丽的花 CDOJ 1344 线段树/树状数组
- 2016 UESTC Training for Data Structures N - 秋实大哥搞算数 CDOJ 1074 栈 表达式求值
- 2016 UESTC Training for Data Structures M - 卿学姐失恋了Ⅱ CDOJ 1350 汉诺塔 模拟
- 2016 UESTC Training for Data Structures L - 郭大侠与苦恼 CDOJ 1284 map+启发式合并
- link quiz
- UIImageVIew
- 2016 UESTC Training for Data Structures K - 郭大侠与甲铁城 CDOJ 1342 离线树状数组
- Analog linked list quiz
- 2016 UESTC Training for Data Structures J - 郭大侠与Rabi-Ribi CDOJ 1334 优先队列
- 2016 UESTC Training for Data Structures I - 郭大侠与线上游戏 CDOJ 1339 pb_ds黑科技
- Vawio Sequence
- Android开发:Handler异步通信机制全面解析(包含Looper、Message Queue
- tractor quiz
- 2016 UESTC Training for Data Structures H - 郭大侠与英雄学院 CDOJ 1338 并查集
- Palindrome-detection quiz
- 2016 UESTC Training for Data Structures G - 郭大侠与阴阳家 CDOJ 1337 强行map
- Quick-sort quiz