sainnhe/leetcode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add Two Numbers

Browse Source
This commit is contained in:
Sainnhe Park
2022-03-10 20:25:55 +08:00
parent 63885a6fac
commit c8b542689c
3 changed files with 107 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
tests/s2_add_two_numbers.cpp Normal file
View File

@@ -0,0 +1,53 @@
#include "s2_add_two_numbers.hpp"
#include <gtest/gtest.h>
TEST(Problem2, Case1) {
ListNode *l1 =
new ListNode(2,
new ListNode(4,
new ListNode(3)));
ListNode *l2 =
new ListNode(5,
new ListNode(6,
new ListNode(4)));
Solution solution;
ListNode *l = solution.addTwoNumbers(l1, l2);
EXPECT_EQ(l->val, 7);
EXPECT_EQ(l->next->val, 0);
EXPECT_EQ(l->next->next->val, 8);
}
TEST(Problem2, Case2) {
ListNode *l1 = new ListNode(0);
ListNode *l2 = new ListNode(0);
Solution solution;
ListNode *l = solution.addTwoNumbers(l1, l2);
EXPECT_EQ(l->val, 0);
}
TEST(Problem2, Case3) {
ListNode *l1 =
new ListNode(9,
new ListNode(9,
new ListNode(9,
new ListNode(9,
new ListNode(9,
new ListNode(9,
new ListNode(9)))))));
ListNode *l2 =
new ListNode(9,
new ListNode(9,
new ListNode(9,
new ListNode(9))));
Solution solution;
ListNode *l = solution.addTwoNumbers(l1, l2);
EXPECT_EQ(l->val, 8);
EXPECT_EQ(l->next->val, 9);
EXPECT_EQ(l->next->next->val, 9);
EXPECT_EQ(l->next->next->next->val, 9);
EXPECT_EQ(l->next->next->next->next->val, 0);
EXPECT_EQ(l->next->next->next->next->next->val, 0);
EXPECT_EQ(l->next->next->next->next->next->next->val, 0);
EXPECT_EQ(l->next->next->next->next->next->next->next->val, 1);
}