LeetCode
来源:互联网 发布:你睡过几个男人 知乎 编辑:程序博客网 时间:2024/05/17 21:48
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.
Formally the function should:
Return true if there exists i, j, k
such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤ n-1 else return false.
Your algorithm should run in O(n) time complexity and O(1) space complexity.
Examples:
Given [1, 2, 3, 4, 5]
,
return true
.
Given [5, 4, 3, 2, 1]
,
return false
.
找到三个数使得满足a[i] < a[j] < a[k] && i < j < k
思维题吧?
设置一个small和big,如果小于small就替换small,如果大于small小于big,就替换big。否则,大于这两个数,说明条件成立,返回true。
class Solution {public: bool increasingTriplet(vector<int>& nums) { if (nums.size() < 3) return false; int a1 = INT_MAX, a2 = INT_MAX; for (auto x: nums) { if (x <= a1) a1 = x; else if (x <= a2) a2 = x; else return true; } return false; }};
阅读全文
0 0
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- leetcode
- Codeforces-723D- Lakes in Berland(DFS)
- 读取和使用Spring的配置文件
- 只要学不会,就往死里看————容器
- 10个JavaScript难点
- Tempter of the Bone
- LeetCode
- 防止内存泄漏--android-weak-handler
- SEO优化怎么设置描述语呢?
- HDU6063---RXD and math(2017多校联赛题目(???))
- CF835E The penguin's game(异或性质+二分查找)
- 什么是RxSwift?
- HDU-Binary Tree Traversals
- 全局变量
- Git基本操作_Anroid群英传之神兵利器笔记(一)