131 palindrome partitioning golang

go/131-Palindrome-Partitioning.go

@@ -0,0 +1,34 @@
+package main
+
+func partition(s string) [][]string {
+ ans := make([][]string, 0)
+ curr := make([]string, 0)
+ var backtrack func(idx int)
+ backtrack = func(idx int) {
+ if idx == len(s) {
+ ans = append(ans, append([]string{}, curr...))
+ }
+ for i := idx; i < len(s); i++ {
+ if isPalindrome(s[idx : i+1]) {
+ curr = append(curr, s[idx:i+1])
+ backtrack(i + 1)
+ curr = curr[:len(curr)-1]
+ }
+ }
+ }
+ backtrack(0)
+ return ans
+}
+
+func isPalindrome(s string) bool {
+ l := 0
+ r := len(s) - 1
+ for l < r {
+ if s[l] != s[r] {
+ return false
+ }
+ l++
+ r--
+ }
+ return true
+}