aboutsummaryrefslogtreecommitdiff
path: root/break_palindrom.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'break_palindrom.cpp')
-rw-r--r--break_palindrom.cpp33
1 files changed, 0 insertions, 33 deletions
diff --git a/break_palindrom.cpp b/break_palindrom.cpp
deleted file mode 100644
index d10c0e6..0000000
--- a/break_palindrom.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-// 1328. Break a Palindrome
-#include "leetcode.h"
-
-/*
- * given a palindrome string of lowercase english letters 'palindrome' replace
- * exactly one character with any lowercase english letter so that the resulting
- * string is not a palindrome and that it is the lexicographically smallest one
- * possible. return the resulting string. if there is no way to replace a
- * character to make it not a palindrome, return an empty string.
- */
-
-class Solution {
-public:
- string breakPalindrome(string palindrome) {
- int n = palindrome.size();
- if (n == 1)
- return "";
- for (int i = 0; i < n / 2; i++) {
- if (palindrome[i] != 'a') {
- palindrome[i] = 'a';
- return palindrome;
- }
- }
- palindrome[n - 1] = 'b';
- return palindrome;
- }
-};
-
-int main() {
- Solution obj;
- cout << obj.breakPalindrome("abccba") << endl; // expect: aaccba
- cout << obj.breakPalindrome("a") << endl; // expect: null
-}