125 added

Author: aQua

Algorithms/0125.valid-palindrome/README.md

@@ -0,0 +1,19 @@
+# [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)
+
+## 题目
+Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
+
+For example,
+```
+"A man, a plan, a canal: Panama" is a palindrome.
+"race a car" is not a palindrome.
+```
+Note:
+Have you consider that the string might be empty? This is a good question to ask during an interview.
+
+For the purpose of this problem, we define empty string as valid palindrome.
+
+## 解题思路
+palindrome:	回文（指顺读和倒读都一样的词语）
+
+见程序注释

Algorithms/0125.valid-palindrome/valid-palindrome.go

@@ -0,0 +1,6 @@
+package Problem0125
+
+func isPalindrome(s string) bool {
+
+	return true
+}

Algorithms/0125.valid-palindrome/valid-palindrome_test.go

@@ -0,0 +1,37 @@
+package Problem0125
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+func Test_Problem0125(t *testing.T) {
+	ast := assert.New(t)
+
+	// tcs is testcase slice
+	tcs := []struct {
+		s   string
+		ans bool
+	}{
+
+		{
+			"race a car",
+			false,
+		},
+
+		{
+			"A man, a plan, a canal: Panama",
+			true,
+		},
+
+		// 可以多个 testcase
+	}
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+
+		ast.Equal(tc.ans, isPalindrome(tc.s), "输入:%v", tc)
+	}
+}