Commit b5a542b

authored

fix: resolve memory leak issue in No.0002 (doocs#4434)

1 parent b2a6267 commit b5a542bCopy full SHA for b5a542b

File tree

-9

lines changed

-9

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -147,9 +147,9 @@ class Solution {`
`147`	`147`	`class Solution {`
`148`	`148`	`public:`
`149`	`149`	`ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {`
`150`		`- ListNode* dummy = new ListNode();`
	`150`	`+ ListNode dummy;`
`151`	`151`	`int carry = 0;`
`152`		`- ListNode* cur = dummy;`
	`152`	`+ ListNode* cur = &dummy;`
`153`	`153`	`while (l1 \|\| l2 \|\| carry) {`
`154`	`154`	`int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;`
`155`	`155`	`carry = s / 10;`
`@@ -158,7 +158,7 @@ public:`
`158`	`158`	`l1 = l1 ? l1->next : nullptr;`
`159`	`159`	`l2 = l2 ? l2->next : nullptr;`
`160`	`160`	`}`
`161`		`- return dummy->next;`
	`161`	`+ return dummy.next;`
`162`	`162`	`}`
`163`	`163`	`};`
`164`	`164`	```

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -143,9 +143,9 @@ class Solution {`
`143`	`143`	`class Solution {`
`144`	`144`	`public:`
`145`	`145`	`ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {`
`146`		`- ListNode* dummy = new ListNode();`
	`146`	`+ ListNode dummy;`
`147`	`147`	`int carry = 0;`
`148`		`- ListNode* cur = dummy;`
	`148`	`+ ListNode* cur = &dummy;`
`149`	`149`	`while (l1 \|\| l2 \|\| carry) {`
`150`	`150`	`int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;`
`151`	`151`	`carry = s / 10;`
`@@ -154,7 +154,7 @@ public:`
`154`	`154`	`l1 = l1 ? l1->next : nullptr;`
`155`	`155`	`l2 = l2 ? l2->next : nullptr;`
`156`	`156`	`}`
`157`		`- return dummy->next;`
	`157`	`+ return dummy.next;`
`158`	`158`	`}`
`159`	`159`	`};`
`160`	`160`	```

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,9 +11,9 @@`
`11`	`11`	`class Solution {`
`12`	`12`	`public:`
`13`	`13`	`ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {`
`14`		`- ListNode* dummy = newListNode();`
	`14`	`+ ListNode dummy;`
`15`	`15`	`int carry = 0;`
`16`		`- ListNode* cur = dummy;`
	`16`	`+ ListNode* cur = &dummy;`
`17`	`17`	`while (l1 \|\| l2 \|\| carry) {`
`18`	`18`	`int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;`
`19`	`19`	`carry = s / 10;`
`@@ -22,6 +22,6 @@ class Solution {`
`22`	`22`	`l1 = l1 ? l1->next : nullptr;`
`23`	`23`	`l2 = l2 ? l2->next : nullptr;`
`24`	`24`	`}`
`25`		`- return dummy->next;`
	`25`	`+ return dummy.next;`
`26`	`26`	`}`
`27`	`27`	`};`

Comments

(0)