update

.github/issue_template.md

@@ -0,0 +1,9 @@
+# 与题解有关的 issue 模板
+
+## 题号
+
+## 我的疑问
+
+-------
+
+有偿答疑，[点击后，扫码付费](https://github.com/aQuaYi/LeetCode-in-Go/blob/master/.github/pay.png)

.gitignore

@@ -13,6 +13,14 @@
 # Project-local glide cache, RE: https://github.com/Masterminds/glide/issues/736
 .glide/
 *.cookie
-.vscode/
 *.toml
-helper
+helper
+*.zip
+tasks.txt
+testDir/
+coverage.txt
+
+# 删除 Goland 设置
+.idea
+
+.orig

.travis.yml

@@ -1,21 +1,18 @@
 language: go
 
 go:
-  - 1.9.x
-  
+  - master
+
 # whitelist
 branches:
   only:
   - master
-  - stable 
+  - stable
 
-script: 
+script:
   - go get -t -v ./...
   - go vet ./...
   - bash ./test.sh
 
 after_success:
-  - bash <(curl -s https://codecov.io/bash)
-
-notifications:
-  webhooks: https://hooks.pubu.im/services/3wp9q4yqlzm8fxr
+  - bash <(curl -s https://codecov.io/bash)

.vscode/launch.json

@@ -0,0 +1,15 @@
+{
+    // Use IntelliSense to learn about possible attributes.
+    // Hover to view descriptions of existing attributes.
+    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "name": "debug",
+            "type": "go",
+            "request": "launch",
+            "mode": "test",
+            "program": "${fileDirname}"
+        }
+    ]
+}

.vscode/settings.json

@@ -0,0 +1,177 @@
+{
+    "todo-tree.flat": true,
+    "cSpell.words": [
+        "ASCI",
+        "GGLLGG",
+        "GLGLGGLGL",
+        "GLRLLGLL",
+        "Gawl",
+        "Gawlme",
+        "Gawlqt",
+        "Gawluvn",
+        "Gaxwul",
+        "Gcamwel",
+        "Gnaynwl",
+        "IDID",
+        "Icode",
+        "Inorder",
+        "Leet",
+        "Puerkito",
+        "Qedo",
+        "Satisfiability",
+        "Squareful",
+        "Subarrays",
+        "Subsequences",
+        "Superstring",
+        "a",
+        "aaleex",
+        "abcdefgb",
+        "abcdefgbabcdei",
+        "abcdefgh",
+        "abcdefghijklmnopqrstuvwxyz",
+        "alexlovesleetcode",
+        "alicez",
+        "append",
+        "arith",
+        "asdfdfs",
+        "assqjfwarvjcjedqtoz",
+        "at",
+        "atgcatc",
+        "b",
+        "bbazb",
+        "bcdei",
+        "bool",
+        "boustrophedonically",
+        "byte",
+        "cancel",
+        "cands",
+        "capitlization",
+        "catg",
+        "cedefifgstkyxfcuajfa",
+        "checked",
+        "chromedp",
+        "clean",
+        "codecov",
+        "count",
+        "ctaagt",
+        "ctxt",
+        "cut",
+        "czvh",
+        "deck",
+        "dfs",
+        "diff",
+        "domain",
+        "dot",
+        "dqtozctcdk",
+        "e",
+        "efghabcd",
+        "emails",
+        "enention",
+        "exection",
+        "exention",
+        "fassqjfwarvjcjedq",
+        "fcuajfassqjfwarvjc",
+        "fgbabcde",
+        "for",
+        "fumcfsngphjyfhhwkqa",
+        "func",
+        "fwarvjcjedqtozctcd",
+        "gcta",
+        "gctaagttcatgcatc",
+        "ghefcdab",
+        "gitignore",
+        "goconvey",
+        "gruj",
+        "grukj",
+        "grukkmj",
+        "grukmj",
+        "hgfedcba",
+        "i",
+        "if",
+        "increasing",
+        "index",
+        "indexs",
+        "inention",
+        "int",
+        "ints",
+        "is",
+        "j",
+        "keet",
+        "keti",
+        "keto",
+        "ksqsq",
+        "ksqvsq",
+        "ksqvsyq",
+        "kssq",
+        "kyxfcuajfassqjfwa",
+        "laiden",
+        "leelee",
+        "leetcode",
+        "len",
+        "length",
+        "lexicographicaly",
+        "lleeelee",
+        "longest",
+        "make",
+        "map",
+        "max",
+        "mozillazg",
+        "n",
+        "nbsp",
+        "next",
+        "ntse",
+        "num",
+        "nums",
+        "ooncedefifgstkyxfcua",
+        "ppedxfumcfsngphjyf",
+        "pwwkew",
+        "querys",
+        "rame",
+        "range",
+        "replace",
+        "res",
+        "return",
+        "revealed",
+        "rorse",
+        "saeed",
+        "seq",
+        "size",
+        "sort",
+        "split",
+        "ssaaedd",
+        "stretchr",
+        "string",
+        "strings",
+        "strs",
+        "subarray",
+        "subtrees",
+        "superpalindrome",
+        "superpalindromes",
+        "t",
+        "tail",
+        "tcode",
+        "testemail",
+        "tmps",
+        "true",
+        "ttca",
+        "unique",
+        "univalued",
+        "username",
+        "uvwxyz",
+        "var",
+        "wordlist",
+        "worldabcefghijkmnpqstuvxyz",
+        "yeellow",
+        "yllw",
+        "yollew",
+        "yollow",
+        "zcpzvh",
+        "zczpzfvdhx",
+        "zczpzvdhx",
+        "zczpzvh",
+        "zczpzvhx",
+        "zczvh",
+        "zppedxfumcfsngp"
+    ],
+    "cSpell.language": "en,en-US"
+}

.vscode/tags

@@ -0,0 +1,6 @@
+!_TAG_FILE_FORMAT	2	/extended format; --format=1 will not append ;" to lines/
+!_TAG_FILE_SORTED	1	/0=unsorted, 1=sorted, 2=foldcase/
+!_TAG_PROGRAM_AUTHOR	Darren Hiebert	/dhiebert@users.sourceforge.net/
+!_TAG_PROGRAM_NAME	Exuberant Ctags	//
+!_TAG_PROGRAM_URL	http://ctags.sourceforge.net	/official site/
+!_TAG_PROGRAM_VERSION	5.9~svn20110310	//

Algorithms/0001.two-sum/README.md

@@ -1,26 +1,30 @@
 # [1. Two Sum](https://leetcode.com/problems/two-sum/)
 
 ## 题目
+
 Given an array of integers, return indices of the two numbers such that they add up to a specific target.
 
 You may assume that each input would have exactly one solution, and you may not use the same element twice.
 
 Example:
-```
+
+```text
 Given nums = [2, 7, 11, 15], target = 9,
 
 Because nums[0] + nums[1] = 2 + 7 = 9,
 return [0, 1].
 ```
+
 ## 解题思路
-```
+
+```go
 a + b = target
 ```
+
 也可以看成是
-```
+
+```go
 a = target - b
 ```
 
-在`map[整数]整数的序号`中，可以查询到a的序号。这样就不用嵌套两个for循环了。
-
-
+在`map[整数]整数的序号`中，可以查询到a的序号。这样就不用嵌套两个for循环了。

Algorithms/0001.two-sum/two-sum.go

@@ -1,21 +1,21 @@
-package Problem0001
+package problem0001
 
 func twoSum(nums []int, target int) []int {
-	// m 负责保存map[整数]整数的序列号
-	m := make(map[int]int, len(nums))
+	// index 负责保存map[整数]整数的序列号
+	index := make(map[int]int, len(nums))
 
 	// 通过 for 循环，获取b的序列号
 	for i, b := range nums {
 		// 通过查询map，获取a = target - b的序列号
-		if j, ok := m[target-b]; ok {
+		if j, ok := index[target-b]; ok {
 			// ok 为 true
-			// 说明在i之前，存在nums[j] == a
+			// 说明在i之前，存在 nums[j] == a
 			return []int{j, i}
-			// 注意，顺序是j，i，因为j<i
+			// 注意，顺序是j，i
 		}
 
-		// 把i和i的值，存入map
-		m[nums[i]] = i
+		// 把b和i的值，存入map
+		index[b] = i
 	}
 
 	return nil

Algorithms/0001.two-sum/two-sum_test.go

@@ -1,4 +1,4 @@
-package Problem0001
+package problem0001
 
 import (
 	"testing"

Algorithms/0002.add-two-numbers/README.md

@@ -1,28 +1,36 @@
 # [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)
 
 ## 题目
+
 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
 
 You may assume the two numbers do not contain any leading zero, except the number 0 itself.
 
+```text
 Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 Output: 7 -> 0 -> 8
+```
 
 ## 解题思路
+
+```text
 (2 -> 4 -> 3)是 342
 
 (5 -> 6 -> 4)是 465
 
 (7 -> 0 -> 8)是 807
 
 342 + 465 = 807
+```
 
 所以，题目的本意是，把整数换了一种表达方式后，实现其加法。
 
 设计程序时候，需要处理的点有
+
 1. 位上的加法，需要处理进位问题
 1. 如何进入下一位运算
 1. 按位相加结束后，也还需要处理进位问题。
 
 ## 总结
+
 读懂题意后，按步骤实现题目要求。