Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit1bfd15f

Browse files
refactor 2
1 parent88fc6a8 commit1bfd15f

File tree

1 file changed

+12
-7
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+12
-7
lines changed

‎src/main/java/com/fishercoder/solutions/_2.java

Lines changed: 12 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -4,12 +4,15 @@
44

55
publicclass_2 {
66
publicstaticclassSolution1 {
7+
/**
8+
* My completely original solution on 10/24/2021.
9+
*/
710
publicListNodeaddTwoNumbers(ListNodel1,ListNodel2) {
8-
ListNoderesult =newListNode(0);
9-
ListNodetmp =result;
10-
intsum =0;
11+
intcarry =0;
12+
ListNodepre =newListNode(-1);
13+
ListNodetmp =pre;
1114
while (l1 !=null ||l2 !=null) {
12-
sum/=10;
15+
intsum=0;
1316
if (l1 !=null) {
1417
sum +=l1.val;
1518
l1 =l1.next;
@@ -18,13 +21,15 @@ public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
1821
sum +=l2.val;
1922
l2 =l2.next;
2023
}
24+
sum +=carry;
2125
tmp.next =newListNode(sum %10);
2226
tmp =tmp.next;
27+
carry =sum /10;
2328
}
24-
if (sum /10 ==1) {
25-
tmp.next =newListNode(1);//this means there's a carry, so we add additional 1, e.g. [5] + [5] = [0, 1]
29+
if (carry !=0) {
30+
tmp.next =newListNode(carry);
2631
}
27-
returnresult.val ==0 ?result.next :result;
32+
returnpre.next;
2833
}
2934
}
3035

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp