把所有的 package name 修改成小写开头

Author: aQua

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

@@ -1,4 +1,4 @@
-package Problem0001
+package problem0001
 
 func twoSum(nums []int, target int) []int {
 	// m 负责保存map[整数]整数的序列号

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

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

Algorithms/0002.add-two-numbers/add-two-numbers.go

@@ -1,4 +1,4 @@
-package Problem0002
+package problem0002
 
 /**
  * Definition for singly-linked list.

Algorithms/0002.add-two-numbers/add-two-numbers_test.go

@@ -1,4 +1,4 @@
-package Problem0002
+package problem0002
 
 import (
 	"testing"

Algorithms/0003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.go

@@ -1,4 +1,4 @@
-package Problem0003
+package problem0003
 
 func lengthOfLongestSubstring(s string) int {
 	// location[s[i]] == j 表示：

Algorithms/0003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters_test.go

@@ -1,4 +1,4 @@
-package Problem0003
+package problem0003
 
 import (
 	"testing"

Algorithms/0004.median-of-two-sorted-arrays/median-of-two-sorted-arrays.go

@@ -1,4 +1,4 @@
-package Problem0004
+package problem0004
 
 func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
 	nums := combine(nums1, nums2)

Algorithms/0004.median-of-two-sorted-arrays/median-of-two-sorted-arrays_test.go

@@ -1,4 +1,4 @@
-package Problem0004
+package problem0004
 
 import (
 	"testing"

Algorithms/0005.longest-palindromic-substring/longest-palindromic-substring.go

@@ -1,4 +1,4 @@
-package Problem0005
+package problem0005
 
 func longestPalindrome(s string) string {
 	if len(s) < 2 { // 肯定是回文，直接返回

Algorithms/0005.longest-palindromic-substring/longest-palindromic-substring_test.go

@@ -1,4 +1,4 @@
-package Problem0005
+package problem0005
 
 import (
 	"testing"

Algorithms/0006.zigzag-conversion/zigzag-conversion.go

@@ -1,4 +1,4 @@
-package Problem0006
+package problem0006
 
 import (
 	"bytes"

Algorithms/0006.zigzag-conversion/zigzag-conversion_test.go

@@ -1,4 +1,4 @@
-package Problem0006
+package problem0006
 
 import (
 	"testing"

Algorithms/0007.reverse-integer/reverse-integer.go

@@ -1,4 +1,4 @@
-package Problem0007
+package problem0007
 
 import (
 	"math"

Algorithms/0007.reverse-integer/reverse-integer_test.go

@@ -1,4 +1,4 @@
-package Problem0007
+package problem0007
 
 import (
 	"testing"

Algorithms/0008.string-to-integer-atoi/string-to-integer-atoi.go

@@ -1,4 +1,4 @@
-package Problem0008
+package problem0008
 
 import "strings"
 import "math"

Algorithms/0008.string-to-integer-atoi/string-to-integer-atoi_test.go

@@ -1,4 +1,4 @@
-package Problem0008
+package problem0008
 
 import (
 	"testing"

Algorithms/0009.palindrome-number/palindrome-number.go

@@ -1,4 +1,4 @@
-package Problem0009
+package problem0009
 
 import "strconv"
 

Algorithms/0009.palindrome-number/palindrome-number_test.go

@@ -1,4 +1,4 @@
-package Problem0009
+package problem0009
 
 import (
 	"testing"

Algorithms/0010.regular-expression-matching/regular-expression-matching.go

@@ -1,4 +1,4 @@
-package Problem0010
+package problem0010
 
 // 程序中存在以下假设
 // "*" 不会出现在p的首位

Algorithms/0010.regular-expression-matching/regular-expression-matching_test.go

@@ -1,4 +1,4 @@
-package Problem0010
+package problem0010
 
 import (
 	"testing"

Algorithms/0011.container-with-most-water/container-with-most-water.go

@@ -1,4 +1,4 @@
-package Problem0011
+package problem0011
 
 func maxArea(height []int) int {
 	// 从两端开始寻找，至少保证了宽度是最大值

Algorithms/0011.container-with-most-water/container-with-most-water_test.go

@@ -1,4 +1,4 @@
-package Problem0011
+package problem0011
 
 import (
 	"testing"

Algorithms/0012.integer-to-roman/integer-to-roman.go

@@ -1,4 +1,4 @@
-package Problem0012
+package problem0012
 
 func intToRoman(num int) string {
 

Algorithms/0012.integer-to-roman/integer-to-roman_test.go

@@ -1,4 +1,4 @@
-package Problem0012
+package problem0012
 
 import (
 	"testing"

Algorithms/0013.roman-to-integer/roman-to-integer.go

@@ -1,4 +1,4 @@
-package Problem0013
+package problem0013
 
 func romanToInt(s string) int {
 	res := 0

Algorithms/0013.roman-to-integer/roman-to-integer_test.go

@@ -1,4 +1,4 @@
-package Problem0013
+package problem0013
 
 import (
 	"testing"

Algorithms/0014.longest-common-prefix/longest-common-prefix.go

@@ -1,4 +1,4 @@
-package Problem0014
+package problem0014
 
 func longestCommonPrefix(strs []string) string {
 	short := shortest(strs)

Algorithms/0014.longest-common-prefix/longest-common-prefix_test.go

@@ -1,4 +1,4 @@
-package Problem0014
+package problem0014
 
 import (
 	"testing"

Algorithms/0015.3sum/3sum.go

@@ -1,4 +1,4 @@
-package Problem0015
+package problem0015
 
 import "sort"
 

Algorithms/0015.3sum/3sum_test.go

@@ -1,4 +1,4 @@
-package Problem0015
+package problem0015
 
 import (
 	"fmt"

Algorithms/0016.3sum-closest/3sum-closest.go

@@ -1,4 +1,4 @@
-package Problem0016
+package problem0016
 
 import (
 	"math"

Algorithms/0016.3sum-closest/3sum-closest_test.go

@@ -1,4 +1,4 @@
-package Problem0016
+package problem0016
 
 import (
 	"fmt"

Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.go

@@ -1,4 +1,4 @@
-package Problem0017
+package problem0017
 
 var m = map[byte][]string{
 	'2': []string{"a", "b", "c"},

Algorithms/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number_test.go

@@ -1,4 +1,4 @@
-package Problem0017
+package problem0017
 
 import (
 	"fmt"

Algorithms/0018.4sum/4sum.go

@@ -1,4 +1,4 @@
-package Problem0018
+package problem0018
 
 import (
 	"sort"

Algorithms/0018.4sum/4sum_test.go

@@ -1,4 +1,4 @@
-package Problem0018
+package problem0018
 
 import (
 	"fmt"

Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.go

@@ -1,4 +1,4 @@
-package Problem0019
+package problem0019
 
 /*
  * Definition for singly-linked list.

Algorithms/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list_test.go

@@ -1,4 +1,4 @@
-package Problem0019
+package problem0019
 
 import (
 	"fmt"

Algorithms/0020.valid-parentheses/valid-parentheses.go

@@ -1,4 +1,4 @@
-package Problem0020
+package problem0020
 
 func isValid(str string) bool {
 	s := new(stack)

Algorithms/0020.valid-parentheses/valid-parentheses_test.go

@@ -1,4 +1,4 @@
-package Problem0020
+package problem0020
 
 import (
 	"fmt"

Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists.go

@@ -1,4 +1,4 @@
-package Problem0021
+package problem0021
 
 /**
  * Definition for singly-linked list.

Algorithms/0021.merge-two-sorted-lists/merge-two-sorted-lists_test.go

@@ -1,4 +1,4 @@
-package Problem0021
+package problem0021
 
 import (
 	"fmt"

Algorithms/0022.generate-parentheses/generate-parentheses.go

@@ -1,4 +1,4 @@
-package Problem0022
+package problem0022
 
 func generateParenthesis(n int) []string {
 	res := []string{}

Algorithms/0022.generate-parentheses/generate-parentheses_test.go

@@ -1,4 +1,4 @@
-package Problem0022
+package problem0022
 
 import (
 	"fmt"

Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists.go

@@ -1,4 +1,4 @@
-package Problem0023
+package problem0023
 
 // ListNode 是链接节点
 type ListNode struct {

Algorithms/0023.merge-k-sorted-lists/merge-k-sorted-lists_test.go

@@ -1,4 +1,4 @@
-package Problem0023
+package problem0023
 
 import (
 	"fmt"

Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs.go

@@ -1,4 +1,4 @@
-package Problem0024
+package problem0024
 
 // ListNode ListNode
 type ListNode struct {

Algorithms/0024.swap-nodes-in-pairs/swap-nodes-in-pairs_test.go

@@ -1,4 +1,4 @@
-package Problem0024
+package problem0024
 
 import (
 	"fmt"

Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group.go

@@ -1,4 +1,4 @@
-package Problem0025
+package problem0025
 
 /**
  * Definition for singly-linked list.

Algorithms/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group_test.go

@@ -1,4 +1,4 @@
-package Problem0025
+package problem0025
 
 import (
 	"fmt"

Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.go

@@ -1,4 +1,4 @@
-package Problem0026
+package problem0026
 
 func removeDuplicates(nums []int) int {
 	if len(nums) <= 1 {

Algorithms/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array_test.go

@@ -1,4 +1,4 @@
-package Problem0026
+package problem0026
 
 import (
 	"fmt"

Algorithms/0027.remove-element/remove-element.go

@@ -1,4 +1,4 @@
-package Problem0027
+package problem0027
 
 func removeElement(nums []int, val int) int {
 	// j指向最后一个不为val的位置

Algorithms/0027.remove-element/remove-element_test.go

@@ -1,4 +1,4 @@
-package Problem0027
+package problem0027
 
 import (
 	"fmt"

Algorithms/0028.implement-strstr/implement-strstr.go

@@ -1,4 +1,4 @@
-package Problem0028
+package problem0028
 
 func strStr(haystack string, needle string) int {
 	hlen, nlen := len(haystack), len(needle)

Algorithms/0028.implement-strstr/implement-strstr_test.go

@@ -1,4 +1,4 @@
-package Problem0028
+package problem0028
 
 import (
 	"fmt"

Algorithms/0029.divide-two-integers/divide-two-integers.go

@@ -1,4 +1,4 @@
-package Problem0029
+package problem0029
 
 import (
 	"math"

Algorithms/0029.divide-two-integers/divide-two-integers_test.go

@@ -1,4 +1,4 @@
-package Problem0029
+package problem0029
 
 import (
 	"fmt"

Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words.go

@@ -1,4 +1,4 @@
-package Problem0030
+package problem0030
 
 func findSubstring(s string, words []string) []int {
 	res := []int{}

Algorithms/0030.substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words_test.go

@@ -1,4 +1,4 @@
-package Problem0030
+package problem0030
 
 import (
 	"fmt"

Algorithms/0031.next-permutation/next-permutation.go

@@ -1,4 +1,4 @@
-package Problem0031
+package problem0031
 
 import "sort"
 

Algorithms/0031.next-permutation/next-permutation_test.go

@@ -1,4 +1,4 @@
-package Problem0031
+package problem0031
 
 import (
 	"fmt"

Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses.go

@@ -1,4 +1,4 @@
-package Problem0032
+package problem0032
 
 func longestValidParentheses(s string) int {
 	var left, max, temp int

Algorithms/0032.longest-valid-parentheses/longest-valid-parentheses_test.go

@@ -1,4 +1,4 @@
-package Problem0032
+package problem0032
 
 import (
 	"fmt"

Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array.go

@@ -1,4 +1,4 @@
-package Problem0033
+package problem0033
 
 func search(nums []int, target int) int {
 	var index, indexOfMax int

Algorithms/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array_test.go

@@ -1,4 +1,4 @@
-package Problem0033
+package problem0033
 
 import (
 	"fmt"