valid_anagram

hitzzc · hitzzc · commit e59bc065beff · 2016-10-20T17:45:40.000+08:00
diff --git a/README.md b/README.md
@@ -197,6 +197,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [239. Sliding Window Maximum](https://github.com/hitzzc/go-leetcode/tree/master/sliding_window_maximum)
 #### [240. Search a 2D Matrix II](https://github.com/hitzzc/go-leetcode/tree/master/search_a_2D_matrix_II)
 #### [241. Different Ways to Add Parentheses](https://github.com/hitzzc/go-leetcode/tree/master/different_ways_to_add_parentheses)
+#### [242. Valid Anagram](https://github.com/hitzzc/go-leetcode/tree/master/valid_anagram)
 
 
 
diff --git a/valid_anagram/valid_anagram.go b/valid_anagram/valid_anagram.go
@@ -0,0 +1,22 @@
+package valid_anagram
+
+import (
+	"sort"
+)
+
+func isAnagram(s string, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+	m := [26]int{}
+	for i := range s {
+		m[int(s[i]-'a')]++
+		m[int(t[i]-'a')]--
+	}
+	for i := range m {
+		if m[i] != 0 {
+			return false
+		}
+	}
+	return true
+}
