commit solution 2

Author: lxlxw

index-tags.md

@@ -33,8 +33,9 @@
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
-|  [9](https://leetcode-cn.com/problems/palindrome-number)  |  [回文数](/solution/1-99/0009.palindrome-number/)  |  `数学`  |  <font color=green>简单</font>  |✅ |
+|  [2](https://leetcode-cn.com/problems/add-two-numbers)  |  [两数相加](/solution/1-99/0002.add-two-numbers/)  |  `链表`,`数学`  |  <font color=blue>中等</font>  |✅ |
 |  [7](https://leetcode-cn.com/problems/reverse-integer)  |  [整数反转](/solution/1-99/0007.reverse-integer/)  |  `数学`  |  <font color=green>简单</font>  |✅ |
+|  [9](https://leetcode-cn.com/problems/palindrome-number)  |  [回文数](/solution/1-99/0009.palindrome-number/)  |  `数学`  |  <font color=green>简单</font>  |✅ |
 |  [13](https://leetcode-cn.com/problems/roman-to-integer)  |  [罗马数字转整数](/solution/1-99/0013.roman-to-integer/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |✅ |
 
 #### **哈希表**
@@ -70,6 +71,7 @@
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
+|  [2](https://leetcode-cn.com/problems/add-two-numbers)  |  [两数相加](/solution/1-99/0002.add-two-numbers/)  |  `链表`,`数学`  |  <font color=blue>中等</font>  |✅ |
 |  [21](https://leetcode-cn.com/problems/merge-two-sorted-lists)  |  [合并两个有序链表](/solution/1-99/0021.merge-two-sorted-lists/)  |  `链表`  |  <font color=green>简单</font>  |✅ |
 |  [83](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list)  |  [删除排序链表中的重复元素](/solution/1-99/0083.remove-duplicates-from-sorted-list/)  |  `链表`  |  <font color=green>简单</font>  |✅ |
 

index-type.md

@@ -405,7 +405,7 @@
 
 |  题号  |  题解  |  标签  | 难度  | 是否解题 |
 | --- | --- | --- | --- | --- |
-|  [2](https://leetcode-cn.com/problems/add-two-numbers)  |  [两数相加](/solution/1-99/0002.add-two-numbers/)  |  `链表`,`数学`  |  <font color=blue>中等</font>  |
+|  [2](https://leetcode-cn.com/problems/add-two-numbers)  |  [两数相加](/solution/1-99/0002.add-two-numbers/)  |  `链表`,`数学`  |  <font color=blue>中等</font>  |✅ |
 |  [3](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters)  |  [无重复字符的最长子串](/solution/1-99/0003.longest-substring-without-repeating-characters/)  |  `哈希表`,`双指针`,`字符串`  |  <font color=blue>中等</font>  |
 |  [5](https://leetcode-cn.com/problems/longest-palindromic-substring)  |  [最长回文子串](/solution/1-99/0005.longest-palindromic-substring/)  |  `字符串`,`动态规划`  |  <font color=blue>中等</font>  |
 |  [6](https://leetcode-cn.com/problems/zigzag-conversion)  |  [z 字形变换](/solution/1-99/0006.zigzag-conversion/)  |  `字符串`  |  <font color=blue>中等</font>  |

solution/1-99/0002.add-two-numbers/README.md

@@ -19,14 +19,38 @@
 
 ### 解题思路
 
+
 ### 具体解法
 
 <!-- tabs:start -->
 
 #### **Golang**
 ```go
-func sk() error {
-	return nil
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
+	dummy := new(ListNode)
+	curr := dummy
+	carry := 0
+
+	for l1 != nil || l2 != nil || carry > 0 {
+		curr.Next = new(ListNode)
+		curr = curr.Next
+		if l1 != nil {
+			carry += l1.Val
+			l1 = l1.Next
+		}
+		if l2 != nil {
+			carry += l2.Val
+			l2 = l2.Next
+		}
+		curr.Val = carry % 10
+		carry /= 10
+	}
+	return dummy.Next
 }
 ```
 

solution/1-99/0002.add-two-numbers/solution.go

@@ -0,0 +1,44 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=2 lang=golang
+ *
+ * [2] 两数相加
+ */
+
+// @lc code=start
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
+	dummy := new(ListNode)
+	curr := dummy
+	carry := 0
+
+	for l1 != nil || l2 != nil || carry > 0 {
+		curr.Next = new(ListNode)
+		curr = curr.Next
+		if l1 != nil {
+			carry += l1.Val
+			l1 = l1.Next
+		}
+		if l2 != nil {
+			carry += l2.Val
+			l2 = l2.Next
+		}
+		curr.Val = carry % 10
+		carry /= 10
+	}
+	return dummy.Next
+}
+
+// @lc code=end

solution/1-99/0002.add-two-numbers/solution_test.go

@@ -0,0 +1,33 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestAddTwoNumbers(t *testing.T) {
+
+	listNode1 := &ListNode{
+		Val: 2,
+		Next: &ListNode{
+			Val: 4,
+			Next: &ListNode{
+				Val:  3,
+				Next: nil,
+			},
+		},
+	}
+	listNode2 := &ListNode{
+		Val: 5,
+		Next: &ListNode{
+			Val: 6,
+			Next: &ListNode{
+				Val:  4,
+				Next: nil,
+			},
+		},
+	}
+	ret := addTwoNumbers(listNode1, listNode2)
+	if ret.Val != 7 || ret.Next.Val != 0 || ret.Next.Next.Val != 8 {
+		t.Fatalf("case fails %v\n", ret)
+	}
+}