2 . Add Two Numbers
Medium
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
49ms:
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int i = 0;
ListNode p1 = l1, p2 = l2;
while((p1!=null&&p2!=null)){
int val = p1.val+p2.val+i;
i = val / 10;
p1.val = val % 10;
p2.val = val % 10;
if(p1.next==null&&p2.next==null&&i!=0){
p1.next = new ListNode(1);
return l1;
}
p1 = p1.next;
p2 = p2.next;
}
ListNode notNullNode,res;
if(p1==null){
notNullNode = p2;
res = l2;
}else{
notNullNode = p1;
res = l1;
}
while(notNullNode!=null){
int val = notNullNode.val+i;
i = val / 10;
notNullNode.val = val % 10;
if(notNullNode.next==null&&i!=0){
notNullNode.next = new ListNode(1);
i = 0;
}
notNullNode = notNullNode.next;
}
return res;
}
67 . Add Binary
Easy
Given two binary strings, return their sum (also a binary string).
For example,
a = “11”
b = “1”
Return “100”.
2ms:
public String addBinary(String a, String b) {
char[] oper = a.length()>b.length()?a.toCharArray():b.toCharArray();
char[] add = a.length()>b.length()?b.toCharArray():a.toCharArray();
int p=0,i=0;
while(p<add.length){
int op = oper[oper.length-1-p] - '0';
int ad = add[add.length-1-p] - '0';
int val = op + ad + i;
oper[oper.length-1-p] = (char)((val&1)+'0');
i = val>>1;
p++;
}
while(i!=0&&p<oper.length){
int op = oper[oper.length-1-p] - '0';
int val = op + i;
oper[oper.length-1-p] = (char)((val&1)+'0');
i = val >>1;
p++;
}
if(i!=0)
return "1"+String.valueOf(oper);
else
return String.valueOf(oper);
}