5-最长回文子串

Author: jiayouxujin

Diff for: 200-number-of-islands.go

@@ -1,7 +1,5 @@
 package main
 
-import "fmt"
-
 func numIslands(grid [][]byte) int {
 	if grid == nil || len(grid) == 0 || len(grid[0]) == 0 {
 		return 0
@@ -33,12 +31,12 @@ func dfs(grid [][]byte, i, j int) {
 	dfs(grid, i, j-1)
 }
 
-func main() {
-	grid := [][]byte{
-		{'1', '1', '1', '1', '0'},
-		{'1', '1', '0', '1', '0'},
-		{'1', '1', '0', '0', '0'},
-		{'0', '0', '0', '0', '0'},
-	}
-	fmt.Printf("%v \n", numIslands(grid))
-}
+//func main() {
+//	grid := [][]byte{
+//		{'1', '1', '1', '1', '0'},
+//		{'1', '1', '0', '1', '0'},
+//		{'1', '1', '0', '0', '0'},
+//		{'0', '0', '0', '0', '0'},
+//	}
+//	fmt.Printf("%v \n", numIslands(grid))
+//}

Diff for: 5-longest-palindromic-substring.go

@@ -0,0 +1,28 @@
+package main
+
+func longestPalindrome(s string) string {
+	res := ""
+	for i := 0; i < len(s); i++ {
+		res = maxPalindrome(s, i, i, res)
+		res = maxPalindrome(s, i, i+1, res)
+	}
+	return res
+}
+
+func maxPalindrome(s string, i, j int, res string) string {
+	sub := ""
+	for i >= 0 && j < len(s) && s[i] == s[j] {
+		sub = s[i : j+1]
+		i--
+		j++
+	}
+	if len(res) < len(sub) {
+		return sub
+	}
+	return res
+}
+
+//func main() {
+//	s := "babad"
+//	fmt.Printf("%v \n", longestPalindrome(s))
+//}