jimmywang052114
BAN USERpublic static String reverse(String str){
StringBuilder sb = new StringBuilder();
for(int i=str.length()-1; i>=0; i--)
sb.append(str.charAt(i));
return sb.toString();
}
public static void main(String[] args) {
String[] arr = {"zzzC", "yyyB", "xxxA"};
HashMap<String, String> hm = new HashMap<String, String>();
for(int i=0; i< arr.length; i++){
hm.put(reverse(arr[i]),arr[i]);
}
ArrayList<String> tmp = new ArrayList<String>(hm.keySet());
Collections.sort(tmp);
ArrayList<String> result = new ArrayList<String>();
for(String str: tmp){
result.add(hm.get(str));
}
Object[] resultArr = result.toArray();
for (int i = 0; i < resultArr.length; i++)
System.out.println((String) resultArr[i]);
}
public static String reverse(String str){
StringBuilder sb = new StringBuilder();
for(int i=str.length()-1; i>=0; i--)
sb.append(str.charAt(i));
return sb.toString();
}
public static void main(String[] args) {
String[] arr = {"zzzC", "yyyB", "xxxA"};
HashMap<String, String> hm = new HashMap<String, String>();
for(int i=0; i< arr.length; i++){
hm.put(reverse(arr[i]),arr[i]);
}
ArrayList<String> tmp = new ArrayList<String>(hm.keySet());
Collections.sort(tmp);
ArrayList<String> result = new ArrayList<String>();
for(String str: tmp){
result.add(hm.get(str));
}
Object[] resultArr = result.toArray();
for (int i = 0; i < resultArr.length; i++)
System.out.println((String) resultArr[i]);
}
// time complexity: O(MN)
public static int[] Rotate(int[] arr, numRows, int numCols){
int[] result = new int[numRows*numCols];
for(int i=0; i<N; j++)
for(int j=0; j<M; j++)
result[i*M+j] = arr[j*N+i];
return result;
}
Find the longest non-negative subarray
- jimmywang052114 January 27, 2011