ARTS5

1.Algorithm：
罗马数字转整数
class Solution {
public int romanToInt(String s) {
char[] strs = s.toCharArray();
int len = strs.length;
int sum = 0;
for (int i = 0; i < len; i++) {
String a = strs[i] + “”;
if (i + 1 < len) {
String b = strs[i + 1] + “”;
if (“I”.equals(a)) {
if (“V”.equals(b)) {
sum += 4;
i++;
continue;
}
if (“X”.equals(b)) {
sum += 9;
i++;
continue;
}
} else if (“X”.equals(a)) {
if (“L”.equals(b)) {
sum += 40;
i++;
continue;
}
if (“C”.equals(b)) {
sum += 90;
i++;
continue;
}
} else if (“C”.equals(a)) {
if (“D”.equals(b)) {
sum += 400;
i++;
continue;
}
if (“M”.equals(b)) {
sum += 900;
i++;
continue;
}
}
}
switch (a) {
case “I”:
sum += 1;
break;
case “V”:
sum += 5;
break;
case “X”:
sum += 10;
break;
case “L”:
sum += 50;
break;
case “C”:
sum += 100;
break;
case “D”:
sum += 500;
break;
case “M”:
sum += 1000;
break;
}
}
return sum;
}
}
感觉垃圾代码比较多。。。优化了一下

这样就简洁很多，虽然两个解法用时和内存消耗差不多。
2.Review：《What every computer science major should know》没看完继续看…

3.Tip&Share：学习Linux知识

4.Share：Linux