-
Notifications
You must be signed in to change notification settings - Fork 3
/
1332-remove-palindromic-subsequences.js
84 lines (64 loc) · 2.51 KB
/
1332-remove-palindromic-subsequences.js
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
76
77
78
79
80
81
82
83
84
// 1332. Remove Palindromic Subsequences
// https://leetcode.com/problems/remove-palindromic-subsequences/
/*
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.
A string is called palindrome if is one that reads the same backward as well as
forward.
Constraints:
- 0 <= s.length <= 1000
- s only consists of letters 'a' and 'b'
*/
import { strictEqual } from 'assert';
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// Runtime: 52 ms, faster than 84.19% of JavaScript online submissions
// Memory Usage: 35 MB, less than 100.00% of JavaScript online submissions
// /**
// * @param {string} s
// * @return {number}
// */
// const removePalindromeSub = s => {
// if (!s.length) return 0;
// const rev = [...s].reverse().join('');
// if (s === rev) return 1;
// return 2;
// // console.log(s.replace(/a/g, '+1').replace(/b/g, -1));
// // console.log(s.split('a'));
// // console.log(s.split('b'));
// // console.log(s.split(/a+/));
// // console.log(s.split(/b+/));
// // return Math.abs(s.split(/a+/).length - s.split(/b+/).length);
// // console.log(rev.split('a'));
// // console.log(rev.split('b'));
// // return Math.max(
// // ...s.split('a').map(sub => sub.length),
// // ...s.split('b').map(sub => sub.length),
// // );
// };
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// Runtime: 60 ms, faster than 44.02% of JavaScript online submissions
// Memory Usage: 34.8 MB, less than 100.00% of JavaScript online submissions
/**
* @param {string} s
* @return {number}
*/
const removePalindromeSub = s =>
!s.length ? 0 : s === [...s].reverse().join('') ? 1 : 2;
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
// Example 1:
// strictEqual(removePalindromeSub('ababa'), 1);
// Explanation: String is already palindrome
// // Example 2:
// strictEqual(removePalindromeSub('abb'), 2);
// Explanation: "abb" -> "bb" -> "".
// Remove palindromic subsequence "a" then "bb".
// Example 3:
// strictEqual(removePalindromeSub('baabb'), 2);
// Explanation: "baabb" -> "b" -> "".
// Remove palindromic subsequence "baab" then "b".
// Example 4:
// strictEqual(removePalindromeSub(''), 0);
strictEqual(removePalindromeSub('aabaa'), 1);