-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
56 lines (52 loc) · 1.51 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
package increasingtripletsubsequence.first;
/**
* Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.
* <p>
* <p>
* <p>
* Example 1:
* <p>
* Input: nums = [1,2,3,4,5]
* Output: true
* Explanation: Any triplet where i < j < k is valid.
* Example 2:
* <p>
* Input: nums = [5,4,3,2,1]
* Output: false
* Explanation: No triplet exists.
* Example 3:
* <p>
* Input: nums = [2,1,5,0,4,6]
* Output: true
* Explanation: The triplet (3, 4, 5) is valid because nums[3] == 0 < nums[4] == 4 < nums[5] == 6.
* <p>
* <p>
* Constraints:
* <p>
* 1 <= nums.length <= 105
* -231 <= nums[i] <= 231 - 1
* <p>
* <p>
* Follow up: Could you implement a solution that runs in O(n) time complexity and O(1) space complexity?
*/
class Solution {
/**
* Runtime: 0 ms, faster than 100.00% of Java online submissions for Increasing Triplet Subsequence.
* Memory Usage: 38.4 MB, less than 95.93% of Java online submissions for Increasing Triplet Subsequence.
*
* @param nums
* @return
*/
boolean increasingTriplet(int[] nums) {
int first = Integer.MAX_VALUE, second = Integer.MAX_VALUE;
for (int n : nums) {
if (n < first) {
first = n;
} else if (first < n && n < second) {
second = n;
} else if (first < second && second < n)
return true;
}
return false;
}
}