This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Solution { | |
/** | |
* @param arr | |
* @return | |
*/ | |
public int maxChunksToSorted(int[] arr) { | |
// filter abnormal cases | |
if (arr == null || arr.length == 0) { | |
return 1; | |
} | |
// core logic | |
int[] map = new int[arr.length]; | |
for (int i = 0; i < arr.length; i++) { | |
map[arr[i]] = i; | |
} | |
int minCut = 0; | |
int cutCounter = 1; | |
for (int i = 0; i < arr.length - 1; i++) { | |
int tmpRquire = Math.max(map[arr[i]], arr[i]); | |
minCut = Math.max(minCut, tmpRquire); | |
if (minCut <= i) { | |
// System.out.println("Got a cut!! minCut = " + minCut); | |
// System.out.println("cutCounter = " + cutCounter); | |
// System.out.println("tmpRquire = " + tmpRquire); | |
// System.out.println("i = " + i); | |
minCut = i + 1; | |
cutCounter++; | |
} | |
} | |
// return the final result | |
return cutCounter; | |
} | |
} |
No comments:
Post a Comment