Skip to content

Commit b5a542b

Browse files
authored
fix: resolve memory leak issue in No.0002 (#4434)
1 parent b2a6267 commit b5a542b

File tree

3 files changed

+9
-9
lines changed

3 files changed

+9
-9
lines changed

solution/0000-0099/0002.Add Two Numbers/README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -147,9 +147,9 @@ class Solution {
147147
class Solution {
148148
public:
149149
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
150-
ListNode* dummy = new ListNode();
150+
ListNode dummy;
151151
int carry = 0;
152-
ListNode* cur = dummy;
152+
ListNode* cur = &dummy;
153153
while (l1 || l2 || carry) {
154154
int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
155155
carry = s / 10;
@@ -158,7 +158,7 @@ public:
158158
l1 = l1 ? l1->next : nullptr;
159159
l2 = l2 ? l2->next : nullptr;
160160
}
161-
return dummy->next;
161+
return dummy.next;
162162
}
163163
};
164164
```

solution/0000-0099/0002.Add Two Numbers/README_EN.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -143,9 +143,9 @@ class Solution {
143143
class Solution {
144144
public:
145145
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
146-
ListNode* dummy = new ListNode();
146+
ListNode dummy;
147147
int carry = 0;
148-
ListNode* cur = dummy;
148+
ListNode* cur = &dummy;
149149
while (l1 || l2 || carry) {
150150
int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
151151
carry = s / 10;
@@ -154,7 +154,7 @@ public:
154154
l1 = l1 ? l1->next : nullptr;
155155
l2 = l2 ? l2->next : nullptr;
156156
}
157-
return dummy->next;
157+
return dummy.next;
158158
}
159159
};
160160
```

solution/0000-0099/0002.Add Two Numbers/Solution.cpp

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,9 @@
1111
class Solution {
1212
public:
1313
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
14-
ListNode* dummy = new ListNode();
14+
ListNode dummy;
1515
int carry = 0;
16-
ListNode* cur = dummy;
16+
ListNode* cur = &dummy;
1717
while (l1 || l2 || carry) {
1818
int s = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
1919
carry = s / 10;
@@ -22,6 +22,6 @@ class Solution {
2222
l1 = l1 ? l1->next : nullptr;
2323
l2 = l2 ? l2->next : nullptr;
2424
}
25-
return dummy->next;
25+
return dummy.next;
2626
}
2727
};

0 commit comments

Comments
 (0)