2017.9.22
这个快排的思想真的是很有用啊
public class Solution {
/*
* @param chars: The letter array you should sort by Case
* @return: nothing
*/
public void sortLetters(char[] chars) {
// write your code here
int low = 0;
int height = chars.length - 1 ;
if(height <= 0){
return ;
}
char tmp = chars[height];
while(low < height){
while(low < height && Character.isLowerCase(chars[low])){
low ++;
}
chars[height] = chars[low];
while(low < height && !Character.isLowerCase(chars[height])){
height--;
}
chars[low] = chars[height];
}
chars[height] = tmp;
}
}