1309.解码字母到整数映射
分析
- 将映射关系存储在数组中,对应索引的值为相应的字符
- 对字符串进行遍历,如果当前字符的下下个字符为‘#’,则表示#前面的两位数字是一个二位数
- 再将对应的字符进行拼接
class Solution {
public String freqAlphabets(String s) {
char[] ch = new char[27];
for(int i = 1; i <= 26; i++) {
ch[i] = (char)(96 + i);
}
StringBuilder sb = new StringBuilder();
char[] str = s.toCharArray();
for(int i = 0; i < str.length;) {
if(i + 2 < str.length && str[i + 2] == '#') {
sb.append(ch[(str[i] - '0') * 10 + str[i + 1] - '0']);
i += 3;
}else {
sb.append(ch[str[i] - '0']);
i++;
}
}
return sb.toString();
}
}
剑指Offer 25.合并两个有序的链表
分析
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode temp = new ListNode(-1);
ListNode res = temp;
while(l1 != null && l2 != null) {
if(l1.val <= l2.val) {
temp.next = l1;
l1 = l1.next;
}else {
temp.next = l2;
l2 = l2.next;
}
temp = temp.next;
}
temp.next = (l1 == null ? l2 : l1);
return res.next;
}
}