-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram54.java
More file actions
57 lines (40 loc) · 1.4 KB
/
program54.java
File metadata and controls
57 lines (40 loc) · 1.4 KB
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
57
/*
334. Increasing Triplet Subsequence
Medium
6.4K
280
Companies
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.
Example 1:
Input: nums = [1,2,3,4,5]
Output: true
Explanation: Any triplet where i < j < k is valid.
Example 2:
Input: nums = [5,4,3,2,1]
Output: false
Explanation: No triplet exists.
Example 3:
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.
*/
package LeetCode;
public class program54 {
static boolean increasingTriplet(int[] nums) {
boolean flag = false;
for(int i=0;i<nums.length;i++){
for(int j=i+1;j<nums.length;j++){
for(int k=j+1;k<nums.length;k++){
if(nums[i]<nums[j] && nums[j]<nums[k]){
return true;
}
}
}
}
return flag;
}
public static void main(String[] args) {
int[] nums = {2,1,5,0,4,6};
System.out.println(increasingTriplet(nums));
}
}