Add Solution.go for 0005.Longest Palindromic Substring

Author: Yeqi Tao

solution/0005.Longest Palindromic Substring/Solution.go

@@ -0,0 +1,28 @@
+func longestPalindrome(s string) string {
+	length := len(s)
+	if length == 0 {
+		return ""
+	}
+	res := make([][]bool, length)
+	for i := 0; i < length; i++ {
+		res[i] = make([]bool, length)
+	}
+	max := 1
+	start := 0
+	for i := 0; i < length; i++ {
+		for j := 0; j <= i; j++ {
+			if i - j < 2  {
+				res[j][i] = s[j] == s[i]
+			} else {
+				res[j][i] = s[j] == s[i] && res[j+1][i-1]
+			}
+
+			if res[j][i] && max < i - j + 1 {
+				max = i - j + 1
+				start = j
+			}
+		}
+	}
+
+	return s[start:start + max]
+}

solution/README.md

@@ -35,6 +35,7 @@
 ├── 0005.Longest Palindromic Substring
 │   ├── README.md
 │   ├── Solution.java
+│   ├── Solution.go
 │   └── Solution.js
 ├── 0006.ZigZag Conversion
 │   ├── README.md