刷leetcode时遇到一道题,一种解法需要使用用户自定义的排序方式,于是顺便学习了Comparator接口的使用方法,记录一下
class Solution {
public boolean isAlienSorted(String[] words, String order) {
Map<Character,Integer> map = new HashMap<>();
for(int i = 0,l = order.length();i<l;i++)
map.put(order.charAt(i),i);
class StringComparator implements Comparator<String>{
@Override
public int compare(String o1, String o2) {
int len1 = o1.length();
int len2 = o2.length();
int lim = Math.min(len1,len2);
for(int i = 0;i<lim;i++){
char c1 = o1.charAt(i),c2 = o2.charAt(i);
if (map.get(c1) != map.get(c2))
return map.get(c1) - map.get(c2);
}
return len1 - len2;
}
}
String[] tmp = Arrays.copyOf(words,words.length);
Arrays.sort(tmp,new StringComparator());
for (int i = 0; i < words.length; i++)
if(words[i].compareTo(tmp[i]) != 0)
return false;
return true;
}
}
也可以使用匿名内部类
class Solution {
public boolean isAlienSorted(String[] words, String order) {
Map<Character,Integer> map = new HashMap<>();
for(int i = 0,l = order.length();i<l;i++)
map.put(order.charAt(i),i);
String[] tmp = Arrays.copyOf(words,words.length);
Arrays.sort(tmp, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
int len1 = o1.length();
int len2 = o2.length();
int lim = Math.min(len1,len2);
for(int i = 0;i<lim;i++){
char c1 = o1.charAt(i),c2 = o2.charAt(i);
if (map.get(c1) != map.get(c2))
return map.get(c1) - map.get(c2);
}
return len1 - len2;
}
});
for (int i = 0; i < words.length; i++)
if(words[i].compareTo(tmp[i]) != 0)
return false;
return true;
}
}
还可以使用lambda表达式
class Solution {
public boolean isAlienSorted(String[] words, String order) {
Map<Character,Integer> map = new HashMap<>();
for(int i = 0,l = order.length();i<l;i++)
map.put(order.charAt(i),i);
String[] tmp = Arrays.copyOf(words,words.length);
Arrays.sort(tmp, (String o1, String o2)->{
int len1 = o1.length();
int len2 = o2.length();
int lim = Math.min(len1,len2);
for(int i = 0;i<lim;i++){
char c1 = o1.charAt(i),c2 = o2.charAt(i);
if (map.get(c1) != map.get(c2))
return map.get(c1) - map.get(c2);
}
return len1 - len2;
});
for (int i = 0; i < words.length; i++)
if(words[i].compareTo(tmp[i]) != 0)
return false;
return true;
}
}