-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathMultiplyLLImp.java
66 lines (48 loc) · 1.45 KB
/
MultiplyLLImp.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
public static ListNode multiply(ListNode l1, int n) {
ListNode dummy = new ListNode(-1);
ListNode temp = dummy;
int carry = 0;
while(l1 != null || carry != 0) {
int sum = carry + (l1 != null ? (l1.val * n) : 0) ;
temp.next = new ListNode(sum%10);
temp = temp.next;
carry = sum/10;
if(l1 != null) l1 = l1.next;
}
return dummy.next;
}
public static ListNode reverse(ListNode head) {
ListNode prev = null, cur = head, next = null;
while(cur != null) {
next = cur.next;
cur.next = prev;
prev = cur;
cur = next;
}
return prev;
}
public static void addlinkedlist(ListNode cur1, ListNode cur2) {
int carry = 0;
while(cur1 != null || carry != 0) {
int sum = carry + (cur1 != null ? cur1.val : 0) + (cur2.next != null ? cur2.next.val : 0);
carry = sum/10;
if(cur2.next != null) cur2.next.val = sum%10;
else cur2.next = new ListNode(sum%10);
if(cur1 != null) cur1 = cur1.next;
cur2 = cur2.next;
}
}
public static ListNode multiplyTwoLL(ListNode l1, ListNode l2) {
l1 = reverse(l1);
l2 = reverse(l2);
ListNode dummy = new ListNode(-1);
ListNode temp = l2;
ListNode temp1 = dummy;
while(temp != null) {
ListNode prod = multiply(l1, temp.val);
temp = temp.next;
addlinkedlist(prod, temp1);
temp1 = temp1.next;
}
return reverse(dummy.next);
}