leetcode 334. Increasing Triplet Subsequence
2016-07-05 20:07
453 查看
原题链接
原题链接解题思路
题目要求在n时间复杂度，一次遍历搞定。设定min，mid两个指示值。
搞定mid的取值。（用flag来找，第一个比min大的数就是mid）
只要有大于mid返回true，结束。
解题代码
public class Solution {
public boolean increasingTriplet(int[] nums) {
if(nums.length == 0) return false;
int mid = 0,min = nums[0];boolean flag = true;
for(;i<nums.length;i++){
if(nums[i]<=min){
min = nums[i];
}else if(nums[i]<=mid || flag){
mid = nums[i];
flag = false;
}else {
return true;
}
}
return false;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解