(貪心) 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