Skip to content

Commit cf29a78

Browse files
yanglbmeyanglbme
authored
style: format go code with gofmt (doocs#1037)
1 parent f8e49aa commit cf29a78

File tree

292 files changed

+3087
-3078
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

292 files changed

+3087
-3078
lines changed

‎lcci/01.03.String to URL/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -14,4 +14,4 @@ func replaceSpaces(S string, length int) string {
1414
}
1515
}
1616
return string(b[j:])
17-
}
17+
}

‎lcci/01.05.One Away/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -39,4 +39,4 @@ func min(x, y, z int) int {
3939
return y
4040
}
4141
return z
42-
}
42+
}

‎lcci/01.06.Compress String/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -21,4 +21,4 @@ func compressString(S string) string {
2121
return S
2222
}
2323
return builder.String()
24-
}
24+
}

‎lcci/01.07.Rotate Matrix/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -10,4 +10,4 @@ func rotate(matrix [][]int) {
1010
matrix[j][n-i-1] = temp
1111
}
1212
}
13-
}
13+
}

‎lcci/01.09.String Rotation/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
func isFlipedString(s1 string, s2 string) bool {
22
return len(s1) == len(s2) && strings.Contains(s1+s1, s2)
3-
}
3+
}

‎lcci/02.01.Remove Duplicate Node/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -13,4 +13,4 @@ func removeDuplicateNodes(head *ListNode) *ListNode {
1313
}
1414
}
1515
return head
16-
}
16+
}

‎lcci/02.02.Kth Node From End of List/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,4 +8,4 @@ func kthToLast(head *ListNode, k int) int {
88
fast = fast.Next
99
}
1010
return slow.Val
11-
}
11+
}

‎lcci/02.06.Palindrome Linked List/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -37,4 +37,4 @@ func reverse(head *ListNode) *ListNode {
3737
head = temp
3838
}
3939
return prev
40-
}
40+
}

‎lcci/02.07.Intersection of Two Linked Lists/README.md

+15-15
Original file line numberDiff line numberDiff line change
@@ -130,21 +130,21 @@ var getIntersectionNode = function (headA, headB) {
130130
* Next *ListNode
131131
* }
132132
*/
133-
func getIntersectionNode(headA, headB *ListNode) *ListNode {
134-
cur1, cur2 := headA, headB
135-
for cur1 != cur2 {
136-
if cur1 == nil {
137-
cur1 = headB
138-
} else {
139-
cur1 = cur1.Next
140-
}
141-
if cur2 == nil {
142-
cur2 = headA
143-
} else {
144-
cur2 = cur2.Next
145-
}
146-
}
147-
return cur1
133+
func getIntersectionNode(headA, headB *ListNode) *ListNode {
134+
cur1, cur2 := headA, headB
135+
for cur1 != cur2 {
136+
if cur1 == nil {
137+
cur1 = headB
138+
} else {
139+
cur1 = cur1.Next
140+
}
141+
if cur2 == nil {
142+
cur2 = headA
143+
} else {
144+
cur2 = cur2.Next
145+
}
146+
}
147+
return cur1
148148
}
149149
```
150150

‎lcci/02.07.Intersection of Two Linked Lists/README_EN.md

+15-15
Original file line numberDiff line numberDiff line change
@@ -156,21 +156,21 @@ var getIntersectionNode = function (headA, headB) {
156156
* Next *ListNode
157157
* }
158158
*/
159-
func getIntersectionNode(headA, headB *ListNode) *ListNode {
160-
cur1, cur2 := headA, headB
161-
for cur1 != cur2 {
162-
if cur1 == nil {
163-
cur1 = headB
164-
} else {
165-
cur1 = cur1.Next
166-
}
167-
if cur2 == nil {
168-
cur2 = headA
169-
} else {
170-
cur2 = cur2.Next
171-
}
172-
}
173-
return cur1
159+
func getIntersectionNode(headA, headB *ListNode) *ListNode {
160+
cur1, cur2 := headA, headB
161+
for cur1 != cur2 {
162+
if cur1 == nil {
163+
cur1 = headB
164+
} else {
165+
cur1 = cur1.Next
166+
}
167+
if cur2 == nil {
168+
cur2 = headA
169+
} else {
170+
cur2 = cur2.Next
171+
}
172+
}
173+
return cur1
174174
}
175175
```
176176

‎lcci/02.07.Intersection of Two Linked Lists/Solution.go

+15-15
Original file line numberDiff line numberDiff line change
@@ -5,19 +5,19 @@
55
* Next *ListNode
66
* }
77
*/
8-
func getIntersectionNode(headA, headB *ListNode) *ListNode {
9-
cur1, cur2 := headA, headB
10-
for cur1 != cur2 {
11-
if cur1 == nil {
12-
cur1 = headB
13-
} else {
14-
cur1 = cur1.Next
15-
}
16-
if cur2 == nil {
17-
cur2 = headA
18-
} else {
19-
cur2 = cur2.Next
20-
}
21-
}
22-
return cur1
8+
func getIntersectionNode(headA, headB *ListNode) *ListNode {
9+
cur1, cur2 := headA, headB
10+
for cur1 != cur2 {
11+
if cur1 == nil {
12+
cur1 = headB
13+
} else {
14+
cur1 = cur1.Next
15+
}
16+
if cur2 == nil {
17+
cur2 = headA
18+
} else {
19+
cur2 = cur2.Next
20+
}
21+
}
22+
return cur1
2323
}

‎lcci/03.01.Three in One/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -54,4 +54,4 @@ func (this *TripleInOne) IsEmpty(stackNum int) bool {
5454
* param_2 := obj.Pop(stackNum);
5555
* param_3 := obj.Peek(stackNum);
5656
* param_4 := obj.IsEmpty(stackNum);
57-
*/
57+
*/

‎lcci/03.04.Implement Queue using Stacks/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -52,4 +52,4 @@ func (this *MyQueue) transfer() {
5252
* param_2 := obj.Pop();
5353
* param_3 := obj.Peek();
5454
* param_4 := obj.Empty();
55-
*/
55+
*/

‎lcci/03.05.Sort of Stacks/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -34,4 +34,4 @@ func (s *SortedStack) Peek() int {
3434

3535
func (s *SortedStack) IsEmpty() bool {
3636
return len(s.data) == 0
37-
}
37+
}

‎lcci/04.03.List of Depth/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -37,4 +37,4 @@ func listOfDepth(tree *TreeNode) []*ListNode {
3737
ans = append(ans, head.Next)
3838
}
3939
return ans
40-
}
40+
}

‎lcci/04.04.Check Balance/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -26,4 +26,4 @@ func abs(x int) int {
2626
return -x
2727
}
2828
return x
29-
}
29+
}

‎lcci/04.05.Legal Binary Search Tree/Solution.go

+1-1
Original file line numberDiff line numberDiff line change
@@ -31,4 +31,4 @@ func check(node *TreeNode, lower, upper int) bool {
3131
// node = node.Right
3232
// }
3333
// return true
34-
// }
34+
// }

‎lcci/05.07.Exchange/Solution.go

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
1-
func exchangeBits(num int) int {
2-
return ((num & 0x55555555) << 1) | (num&0xaaaaaaaa)>>1
1+
func exchangeBits(num int) int {
2+
return ((num & 0x55555555) << 1) | (num&0xaaaaaaaa)>>1
33
}

‎lcci/08.04.Power Set/Solution.go

+16-16
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,17 @@
1-
func subsets(nums []int) [][]int {
2-
var ans [][]int
3-
var dfs func(u int, t []int)
4-
dfs = func(u int, t []int) {
5-
if u == len(nums) {
6-
ans = append(ans, append([]int(nil), t...))
7-
return
8-
}
9-
dfs(u+1, t)
10-
t = append(t, nums[u])
11-
dfs(u+1, t)
12-
t = t[:len(t)-1]
13-
}
14-
var t []int
15-
dfs(0, t)
16-
return ans
1+
func subsets(nums []int) [][]int {
2+
var ans [][]int
3+
var dfs func(u int, t []int)
4+
dfs = func(u int, t []int) {
5+
if u == len(nums) {
6+
ans = append(ans, append([]int(nil), t...))
7+
return
8+
}
9+
dfs(u+1, t)
10+
t = append(t, nums[u])
11+
dfs(u+1, t)
12+
t = t[:len(t)-1]
13+
}
14+
var t []int
15+
dfs(0, t)
16+
return ans
1717
}

‎lcci/08.07.Permutation I/Solution.go

+23-23
Original file line numberDiff line numberDiff line change
@@ -1,24 +1,24 @@
1-
func permutation(S string) []string {
2-
vis := make(map[byte]bool)
3-
var ans []string
4-
var t []byte
5-
var dfs func(u int, t []byte)
6-
dfs = func(u int, t []byte) {
7-
if u == len(S) {
8-
ans = append(ans, string(t))
9-
return
10-
}
11-
for i := range S {
12-
if vis[S[i]] {
13-
continue
14-
}
15-
vis[S[i]] = true
16-
t = append(t, S[i])
17-
dfs(u+1, t)
18-
vis[S[i]] = false
19-
t = t[:len(t)-1]
20-
}
21-
}
22-
dfs(0, t)
23-
return ans
1+
func permutation(S string) []string {
2+
vis := make(map[byte]bool)
3+
var ans []string
4+
var t []byte
5+
var dfs func(u int, t []byte)
6+
dfs = func(u int, t []byte) {
7+
if u == len(S) {
8+
ans = append(ans, string(t))
9+
return
10+
}
11+
for i := range S {
12+
if vis[S[i]] {
13+
continue
14+
}
15+
vis[S[i]] = true
16+
t = append(t, S[i])
17+
dfs(u+1, t)
18+
vis[S[i]] = false
19+
t = t[:len(t)-1]
20+
}
21+
}
22+
dfs(0, t)
23+
return ans
2424
}

‎lcci/17.11.Find Closest/Solution.go

+25-25
Original file line numberDiff line numberDiff line change
@@ -1,26 +1,26 @@
1-
func findClosest(words []string, word1 string, word2 string) int {
2-
i, j, ans := 100000, -100000, 100000
3-
for k, word := range words {
4-
if word == word1 {
5-
i = k
6-
} else if word == word2 {
7-
j = k
8-
}
9-
ans = min(ans, abs(i-j))
10-
}
11-
return ans
12-
}
13-
14-
func min(a, b int) int {
15-
if a < b {
16-
return a
17-
}
18-
return b
19-
}
20-
21-
func abs(x int) int {
22-
if x < 0 {
23-
return -x
24-
}
25-
return x
1+
func findClosest(words []string, word1 string, word2 string) int {
2+
i, j, ans := 100000, -100000, 100000
3+
for k, word := range words {
4+
if word == word1 {
5+
i = k
6+
} else if word == word2 {
7+
j = k
8+
}
9+
ans = min(ans, abs(i-j))
10+
}
11+
return ans
12+
}
13+
14+
func min(a, b int) int {
15+
if a < b {
16+
return a
17+
}
18+
return b
19+
}
20+
21+
func abs(x int) int {
22+
if x < 0 {
23+
return -x
24+
}
25+
return x
2626
}

0 commit comments

Comments
 (0)