-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindMinInRotateSortedArray.java
More file actions
85 lines (72 loc) · 1.76 KB
/
FindMinInRotateSortedArray.java
File metadata and controls
85 lines (72 loc) · 1.76 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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
package codingInterview;
public class FindMinInRotateSortedArray {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a = { 3, 3, 4, 1, 3, 3, 3 };
// int min = findMin(a);
// System.out.println(min);
int min = findMinWithDup(a);
System.out.println(min);
}
/**
* suppose to be non-decreasing with duplicates
*
* @param a
* @return
*/
private static int findMinWithDup(int[] a) {
// TODO Auto-generated method stub
return findMinWithDup(a, 0, a.length - 1);
}
private static int findMinWithDup(int[] a, int left, int right) {
// TODO Auto-generated method stub
if (a == null || a.length == 0) {
return -1;
}
if (left == right) {
return a[left];
}
if (a[left] < a[right]) {
return a[left];
}
if (right - left == 1) {
return Math.min(a[left], a[right]);
}
int mid = (left + right) / 2;
if (a[left] == a[right]) {
return findMinWithDup(a, left + 1, right);
} else if (a[left] < a[mid]) {
System.out.println(mid + ", " + a[mid]);
return findMinWithDup(a, mid, right);
} else {
System.out.println(mid + ", " + a[mid]);
return findMinWithDup(a, left, mid);
}
}
/**
* suppose to be non-decreasing without duplicates
*
* @param a
* @return
*/
private static int findMin(int[] a) {
// TODO Auto-generated method stub
return findMin(a, 0, a.length - 1);
}
private static int findMin(int[] a, int left, int right) {
// TODO Auto-generated method stub
if (a[left] < a[right]) {
return a[left];
}
if (right - left == 1) {
return Math.min(a[left], a[right]);
}
int mid = (right + left) / 2;
System.out.println(mid + ", " + a[mid]);
if (a[left] < a[mid]) {
return findMin(a, mid, right);
} else {
return findMin(a, left, mid);
}
}
}