Skip to content

Commit

Permalink
Clean up content
Browse files Browse the repository at this point in the history
  • Loading branch information
sunsingh authored and sunsingh committed Aug 26, 2019
1 parent d6f65eb commit 42528f0
Showing 1 changed file with 24 additions and 24 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -10,8 +10,8 @@ public static void main(String[] args) {
int[] arr = {3, -4, 2, -3, -1, 7, -5}; //[m x n]
System.out.println("Min " + minSum(arr));

int[] index = minSumBracket(arr);
System.out.println("startIndex " + index[0] + " endIndex " + index[1]);
// int[] index = minSumBracket(arr);
// System.out.println("startIndex " + index[0] + " endIndex " + index[1]);
}

public static int minSum(int[] arr) {
Expand All @@ -30,27 +30,27 @@ public static int minSum(int[] arr) {

}

public static int[] minSumBracket(int[] arr) {
int min = Integer.MAX_VALUE;
int minSoFar = Integer.MAX_VALUE;
int startIndex = 0;
int endIndex = 0;
for (int i = 0; i < arr.length; i++) {
if (min > 0) {
min = arr[i];
if (min < minSoFar) {
startIndex = i;
}
} else {
min += arr[i];
if (min < minSoFar) {
endIndex = i;
}
}
minSoFar = Math.min(min, minSoFar);
}

return new int[]{startIndex, endIndex};
}
// public static int[] minSumBracket(int[] arr) {
// int min = Integer.MAX_VALUE;
// int minSoFar = Integer.MAX_VALUE;
// int startIndex = 0;
// int endIndex = 0;
// for (int i = 0; i < arr.length; i++) {
// if (min > 0) {
// min = arr[i];
// if (min < minSoFar) {
// startIndex = i;
// }
// } else {
// min += arr[i];
// if (min < minSoFar) {
// endIndex = i;
// }
// }
// minSoFar = Math.min(min, minSoFar);
// }
//
// return new int[]{startIndex, endIndex};
// }

}

0 comments on commit 42528f0

Please sign in to comment.