- Notifications
You must be signed in to change notification settings - Fork 55
/
Copy pathLeadersInArray.java
79 lines (67 loc) Β· 1.45 KB
/
LeadersInArray.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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
packagegfg.Arrays;
importjava.util.Arrays;
publicclassLeadersInArray {
publicstaticvoidmain(String[] args) {
int[] arr = { 7, 10, 4, 3, 10, 5, 2 };
int[] arr2 = { 10, 20, 30 };
int[] arr3 = { 30, 20, 10 };
int[] arr4 = { 7, 10, 4, 5, 1, 2 };
System.out.println(Arrays.toString(arr));
// leaderArray(arr);
leader(arr);
System.out.println();
System.out.println(Arrays.toString(arr2));
// leaderArray(arr2);
leader(arr2);
System.out.println();
System.out.println(Arrays.toString(arr3));
// leaderArray(arr3);
leader(arr3);
System.out.println();
System.out.println(Arrays.toString(arr4));
// leaderArray(arr4);
leader(arr4);
}
// O(n^2) Time | O(1) Space
publicstaticvoidleaderArray(int[] arr) {
for (inti = 0; i < arr.length; i++) {
booleanflag = true;
for (intj = i; j < arr.length; j++) {
if (arr[i] < arr[j] || (j > i && arr[i] == arr[j])) {
flag = false;
break;
}
}
if (flag) {
System.out.print(arr[i] + " ");
}
}
}
/*
* making above code clean - O(n^2) Time | O(1) Space
*/
publicstaticvoidleader(int[] arr) {
for (inti = 0; i < arr.length; i++) {
booleanflag = true;
for (intj = i + 1; j < arr.length; j++) {
if (arr[j] >= arr[i]) {
flag = false;
break;
}
}
if (flag) {
System.out.print(arr[i] + " ");
}
}
}
}
/* output:
[7, 10, 4, 3, 10, 5, 2]
10 5 2
[10, 20, 30]
30
[30, 20, 10]
30 20 10
[7, 10, 4, 5, 1, 2]
10 5 2
*/