很久没写东东了,懒了。在大学的时候就一直想支持做 北大ACM 题库里的题,但开始入手就被难倒了。现在还是下决心回归算法,一个个攻破吧。
POJ 1002 487-3279 这道题是之前的遗留,今天灭了。多次卡在时间上,奖 Collections.sort() 去了,换成 TreeMap 的自然排序。将 string.replaceAll("-","").replaceAll("[ABC]", "2").replace(...) 换成 if-else 才让程序勉强通过。但时间还是不理想(卡线了)。
实现代码如下:
import java.util.Map;
import java.util.TreeMap;
import java.util.Set;
import java.util.Collections;
import java.util.Comparator;
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
private Map<String, Integer> duplicateNums = new TreeMap<String, Integer>();
/**
* Parse the memorable number to real phone number.
*
* @param memorableNum the memorable phone number.
* @return real phone number.
*/
public String parsePhoneNum(String memorableNum) {
StringBuffer sb = new StringBuffer();
char[] chars = memorableNum.toCharArray();
for (char c : chars) {
if (c >= '0' && c <= '9') {
sb.append(c);
} else if (c >= 'A' && c <= 'C') {
sb.append('2');
} else if (c >= 'D' && c <= 'F') {
sb.append('3');
} else if (c >= 'G' && c <= 'I') {
sb.append('4');
} else if (c >= 'J' && c <= 'L') {
sb.append('5');
} else if (c >= 'M' && c <= 'O') {
sb.append('6');
} else if (c == 'P' || c == 'R' || c == 'S') {
// special operation for 'Q'
sb.append('7');
} else if (c >= 'T' && c <= 'V') {
sb.append('8');
} else if (c >= 'W' && c <= 'Y') {
sb.append('9');
}
}
sb.insert(3, "-");
return sb.toString();
}
public void printResult() {
boolean isPrint = false;
Set<Map.Entry<String, Integer>> s = duplicateNums.entrySet();
for (Map.Entry<String, Integer> entry : s) {
if (entry.getValue() > 1) {
System.out.println(entry.getKey() + " " + entry.getValue());
isPrint = true;
}
}
if (!isPrint) {
System.out.println("No duplicates.");
}
}
public void run() throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
String lineStr = r.readLine();
int n = Integer.parseInt(lineStr);
while (n-- > 0) {
String memorableNum = r.readLine();
String realNum = parsePhoneNum(memorableNum);
if (duplicateNums.containsKey(realNum)) {
int i = duplicateNums.get(realNum);
duplicateNums.put(realNum, i + 1);
} else {
duplicateNums.put(realNum, 1);
}
}
printResult();
}
public static void main(String[] args) {
Main m = new Main();
try {
m.run();
} catch (Exception e) {
e.printStackTrace();
}
}
}