style: format code and documents (doocs#1317)

Author: yanglbme

basic/sorting/CountingSort/CountingSort.go

@@ -51,4 +51,4 @@ func main() {
 	nums = []int{3, 7, 9, 5, 5, 8, 11}
 	CountingSort(nums, 3, 11)
 	fmt.Println(nums)
-}
+}

lcci/08.11.Coin/Solution.go

@@ -1,12 +1,12 @@
-func waysToChange(n int) int {
-	const mod int = 1e9 + 7
-	coins := []int{25, 10, 5, 1}
-	f := make([]int, n+1)
-	f[0] = 1
-	for _, c := range coins {
-		for j := c; j <= n; j++ {
-			f[j] = (f[j] + f[j-c]) % mod
-		}
-	}
-	return f[n]
+func waysToChange(n int) int {
+	const mod int = 1e9 + 7
+	coins := []int{25, 10, 5, 1}
+	f := make([]int, n+1)
+	f[0] = 1
+	for _, c := range coins {
+		for j := c; j <= n; j++ {
+			f[j] = (f[j] + f[j-c]) % mod
+		}
+	}
+	return f[n]
 }

lcci/10.11.Peaks and Valleys/Solution.go

@@ -1,6 +1,6 @@
-func wiggleSort(nums []int) {
-	sort.Ints(nums)
-	for i := 0; i < len(nums)-1; i += 2 {
-		nums[i], nums[i+1] = nums[i+1], nums[i]
-	}
+func wiggleSort(nums []int) {
+	sort.Ints(nums)
+	for i := 0; i < len(nums)-1; i += 2 {
+		nums[i], nums[i+1] = nums[i+1], nums[i]
+	}
 }

lcci/17.18.Shortest Supersequence/Solution.go

@@ -1,30 +1,30 @@
-func shortestSeq(big []int, small []int) []int {
-	cnt := len(small)
-	need := map[int]int{}
-	window := map[int]int{}
-	for _, x := range small {
-		need[x] = 1
-	}
-	j, k, mi := 0, -1, 1<<30
-	for i, x := range big {
-		window[x]++
-		if need[x] >= window[x] {
-			cnt--
-		}
-		for cnt == 0 {
-			if t := i - j + 1; t < mi {
-				mi = t
-				k = j
-			}
-			if need[big[j]] >= window[big[j]] {
-				cnt++
-			}
-			window[big[j]]--
-			j++
-		}
-	}
-	if k < 0 {
-		return []int{}
-	}
-	return []int{k, k + mi - 1}
+func shortestSeq(big []int, small []int) []int {
+	cnt := len(small)
+	need := map[int]int{}
+	window := map[int]int{}
+	for _, x := range small {
+		need[x] = 1
+	}
+	j, k, mi := 0, -1, 1<<30
+	for i, x := range big {
+		window[x]++
+		if need[x] >= window[x] {
+			cnt--
+		}
+		for cnt == 0 {
+			if t := i - j + 1; t < mi {
+				mi = t
+				k = j
+			}
+			if need[big[j]] >= window[big[j]] {
+				cnt++
+			}
+			window[big[j]]--
+			j++
+		}
+	}
+	if k < 0 {
+		return []int{}
+	}
+	return []int{k, k + mi - 1}
 }

lcof2/剑指 Offer II 012. 左右两边子数组的和相等/Solution.php

@@ -17,4 +17,4 @@ function pivotIndex($nums) {
         }
         return -1;
     }
-}
+}

lcp/LCP 06. 拿硬币/Solution.php

@@ -10,4 +10,4 @@ function minCount($coins) {
         }
         return $cnt;
     }
-}
+}

lcp/LCP 41. 黑白翻转棋/Solution.go

@@ -1,63 +1,63 @@
-func flipChess(chessboard []string) (ans int) {
-	m, n := len(chessboard), len(chessboard[0])
-	bfs := func(i, j int) int {
-		q := [][2]int{{i, j}}
-		g := make([][]byte, m)
-		for i := range g {
-			g[i] = make([]byte, n)
-			copy(g[i], []byte(chessboard[i]))
-		}
-		g[i][j] = 'X'
-		cnt := 0
-		for len(q) > 0 {
-			p := q[0]
-			q = q[1:]
-			i, j = p[0], p[1]
-			for a := -1; a <= 1; a++ {
-				for b := -1; b <= 1; b++ {
-					if a == 0 && b == 0 {
-						continue
-					}
-					x, y := i+a, j+b
-					for x >= 0 && x < m && y >= 0 && y < n && g[x][y] == 'O' {
-						x, y = x+a, y+b
-					}
-					if x >= 0 && x < m && y >= 0 && y < n && g[x][y] == 'X' {
-						x -= a
-						y -= b
-						cnt += max(abs(x-i), abs(y-j))
-						for x != i || y != j {
-							g[x][y] = 'X'
-							q = append(q, [2]int{x, y})
-							x -= a
-							y -= b
-						}
-					}
-				}
-			}
-		}
-		return cnt
-	}
-	for i, row := range chessboard {
-		for j, c := range row {
-			if c == '.' {
-				ans = max(ans, bfs(i, j))
-			}
-		}
-	}
-	return
-}
-
-func abs(x int) int {
-	if x < 0 {
-		return -x
-	}
-	return x
-}
-
-func max(a, b int) int {
-	if a > b {
-		return a
-	}
-	return b
+func flipChess(chessboard []string) (ans int) {
+	m, n := len(chessboard), len(chessboard[0])
+	bfs := func(i, j int) int {
+		q := [][2]int{{i, j}}
+		g := make([][]byte, m)
+		for i := range g {
+			g[i] = make([]byte, n)
+			copy(g[i], []byte(chessboard[i]))
+		}
+		g[i][j] = 'X'
+		cnt := 0
+		for len(q) > 0 {
+			p := q[0]
+			q = q[1:]
+			i, j = p[0], p[1]
+			for a := -1; a <= 1; a++ {
+				for b := -1; b <= 1; b++ {
+					if a == 0 && b == 0 {
+						continue
+					}
+					x, y := i+a, j+b
+					for x >= 0 && x < m && y >= 0 && y < n && g[x][y] == 'O' {
+						x, y = x+a, y+b
+					}
+					if x >= 0 && x < m && y >= 0 && y < n && g[x][y] == 'X' {
+						x -= a
+						y -= b
+						cnt += max(abs(x-i), abs(y-j))
+						for x != i || y != j {
+							g[x][y] = 'X'
+							q = append(q, [2]int{x, y})
+							x -= a
+							y -= b
+						}
+					}
+				}
+			}
+		}
+		return cnt
+	}
+	for i, row := range chessboard {
+		for j, c := range row {
+			if c == '.' {
+				ans = max(ans, bfs(i, j))
+			}
+		}
+	}
+	return
+}
+
+func abs(x int) int {
+	if x < 0 {
+		return -x
+	}
+	return x
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
 }

lcp/LCP 55. 采集果实/Solution.go

@@ -1,7 +1,7 @@
-func getMinimumTime(time []int, fruits [][]int, limit int) (ans int) {
-	for _, f := range fruits {
-		i, num := f[0], f[1]
-		ans += (num + limit - 1) / limit * time[i]
-	}
-	return
+func getMinimumTime(time []int, fruits [][]int, limit int) (ans int) {
+	for _, f := range fruits {
+		i, num := f[0], f[1]
+		ans += (num + limit - 1) / limit * time[i]
+	}
+	return
 }

lcp/LCP 56. 信物传送/Solution.go

@@ -1,42 +1,42 @@
-func conveyorBelt(matrix []string, start []int, end []int) int {
-	dirs := [5]int{-1, 0, 1, 0, -1}
-	d := map[byte]int{
-		'^': 0,
-		'>': 1,
-		'v': 2,
-		'<': 3,
-	}
-	q := [][2]int{[2]int{start[0], start[1]}}
-	m, n := len(matrix), len(matrix[0])
-	dist := make([][]int, m)
-	for i := range dist {
-		dist[i] = make([]int, n)
-		for j := range dist[i] {
-			dist[i][j] = 1 << 30
-		}
-	}
-	dist[start[0]][start[1]] = 0
-	for {
-		p := q[0]
-		i, j := p[0], p[1]
-		if i == end[0] && j == end[1] {
-			return dist[i][j]
-		}
-		q = q[1:]
-		for k := 0; k < 4; k++ {
-			x, y := i+dirs[k], j+dirs[k+1]
-			t := dist[i][j]
-			if k != d[matrix[i][j]] {
-				t++
-			}
-			if x >= 0 && x < m && y >= 0 && y < n && t < dist[x][y] {
-				dist[x][y] = t
-				if dist[x][y] == dist[i][j] {
-					q = append([][2]int{[2]int{x, y}}, q...)
-				} else {
-					q = append(q, [2]int{x, y})
-				}
-			}
-		}
-	}
+func conveyorBelt(matrix []string, start []int, end []int) int {
+	dirs := [5]int{-1, 0, 1, 0, -1}
+	d := map[byte]int{
+		'^': 0,
+		'>': 1,
+		'v': 2,
+		'<': 3,
+	}
+	q := [][2]int{[2]int{start[0], start[1]}}
+	m, n := len(matrix), len(matrix[0])
+	dist := make([][]int, m)
+	for i := range dist {
+		dist[i] = make([]int, n)
+		for j := range dist[i] {
+			dist[i][j] = 1 << 30
+		}
+	}
+	dist[start[0]][start[1]] = 0
+	for {
+		p := q[0]
+		i, j := p[0], p[1]
+		if i == end[0] && j == end[1] {
+			return dist[i][j]
+		}
+		q = q[1:]
+		for k := 0; k < 4; k++ {
+			x, y := i+dirs[k], j+dirs[k+1]
+			t := dist[i][j]
+			if k != d[matrix[i][j]] {
+				t++
+			}
+			if x >= 0 && x < m && y >= 0 && y < n && t < dist[x][y] {
+				dist[x][y] = t
+				if dist[x][y] == dist[i][j] {
+					q = append([][2]int{[2]int{x, y}}, q...)
+				} else {
+					q = append(q, [2]int{x, y})
+				}
+			}
+		}
+	}
 }

lcp/LCP 77. 符文储备/Solution.go

@@ -1,12 +1,12 @@
-func runeReserve(runes []int) (ans int) {
-	sort.Ints(runes)
-	i := 0
-	for j, x := range runes {
-		if j > 0 && x-runes[j-1] > 1 {
-			i = j
-		} else if t := j - i + 1; ans < t {
-			ans = t
-		}
-	}
-	return
+func runeReserve(runes []int) (ans int) {
+	sort.Ints(runes)
+	i := 0
+	for j, x := range runes {
+		if j > 0 && x-runes[j-1] > 1 {
+			i = j
+		} else if t := j - i + 1; ans < t {
+			ans = t
+		}
+	}
+	return
 }