-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1332-RemovePalindromicSubsequences.go
More file actions
75 lines (64 loc) · 2.03 KB
/
1332-RemovePalindromicSubsequences.go
File metadata and controls
75 lines (64 loc) · 2.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
package main
// 1332. Remove Palindromic Subsequences
// You are given a string s consisting only of letters 'a' and 'b'.
// In a single step you can remove one palindromic subsequence from s.
// Return the minimum number of steps to make the given string empty.
// A string is a subsequence of a given string if it is generated by deleting some characters of a given string without changing its order.
// Note that a subsequence does not necessarily need to be contiguous.
// A string is called palindrome if is one that reads the same backward as well as forward.
// Example 1:
// Input: s = "ababa"
// Output: 1
// Explanation: s is already a palindrome, so its entirety can be removed in a single step.
// Example 2:
// Input: s = "abb"
// Output: 2
// Explanation: "abb" -> "bb" -> "".
// Remove palindromic subsequence "a" then "bb".
// Example 3:
// Input: s = "baabb"
// Output: 2
// Explanation: "baabb" -> "b" -> "".
// Remove palindromic subsequence "baab" then "b".
// Constraints:
// 1 <= s.length <= 1000
// s[i] is either 'a' or 'b'.
import "fmt"
// 双指针
func removePalindromeSub(s string) int {
if len(s) == 0 {
return 0
}
l, r := 0, len(s) - 1
for l < r {
if s[l] == s[r] {
l++
r--
} else {
break
}
}
if l == r || l > r { // 需要删一个
return 1
}
return 2 // worst case is 2
}
func main() {
// Example 1:
// Input: s = "ababa"
// Output: 1
// Explanation: s is already a palindrome, so its entirety can be removed in a single step.
fmt.Println(removePalindromeSub("ababa")) // 1
// Example 2:
// Input: s = "abb"
// Output: 2
// Explanation: "abb" -> "bb" -> "".
// Remove palindromic subsequence "a" then "bb".
fmt.Println(removePalindromeSub("abb")) // 2
// Example 3:
// Input: s = "baabb"
// Output: 2
// Explanation: "baabb" -> "b" -> "".
// Remove palindromic subsequence "baab" then "b".
fmt.Println(removePalindromeSub("baabb")) // 2
}