(贪心) leetcode 334. Increasing Trtipllet Subsequence
思路：贪心，用min1来记录当前最小的数，min2来记录当前第二小的数。它们的初始值都是最大的数。 class Solution {
public:
bool increasingTriplet(vector<int>& nums) {
if(nums.size()<3)
return false;
int min1=INT_MA
相关文章
- 1. Leetcode 334. Increasing Triplet Subsequence
- 2. LeetCode 334. Increasing Triplet Subsequence
- 3. LeetCode OJ 334. Increasing Triplet Subsequence
- 4. leetcode 334 Increasing Triplet Subsequence 详细解答
- 5. [LeetCode] Longest Increasing Subsequence
- 6. LeetCode 300. Longest Increasing Subsequence
- 7. Leetcode 300. Longest Increasing Subsequence
- 8. LeetCode-674. Longest Continuous Increasing Subsequence
- 9. LeetCode 673. Number of Longest Increasing Subsequence
- 10. leetcode 674[easy]--- Longest Continuous Increasing Subsequence
- 更多相关文章...
- • Hibernate的核心接口 - Hibernate教程
- • MyBatis的核心组件 - MyBatis教程
- • Spring Cloud 微服务实战(三) - 服务注册与发现
- • 算法总结-股票买卖
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. Leetcode 334. Increasing Triplet Subsequence
- 2. LeetCode 334. Increasing Triplet Subsequence
- 3. LeetCode OJ 334. Increasing Triplet Subsequence
- 4. leetcode 334 Increasing Triplet Subsequence 详细解答
- 5. [LeetCode] Longest Increasing Subsequence
- 6. LeetCode 300. Longest Increasing Subsequence
- 7. Leetcode 300. Longest Increasing Subsequence
- 8. LeetCode-674. Longest Continuous Increasing Subsequence
- 9. LeetCode 673. Number of Longest Increasing Subsequence
- 10. leetcode 674[easy]--- Longest Continuous Increasing Subsequence