-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1842-NextPalindromeUsingSameDigits.go
More file actions
75 lines (65 loc) · 2.1 KB
/
1842-NextPalindromeUsingSameDigits.go
File metadata and controls
75 lines (65 loc) · 2.1 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
// 1842. Next Palindrome Using Same Digits
// You are given a numeric string num, representing a very large palindrome.
// Return the smallest palindrome larger than num that can be created by rearranging its digits.
// If no such palindrome exists, return an empty string "".
// A palindrome is a number that reads the same backward as forward.
// Example 1:
// Input: num = "1221"
// Output: "2112"
// Explanation: The next palindrome larger than "1221" is "2112".
// Example 2:
// Input: num = "32123"
// Output: ""
// Explanation: No palindromes larger than "32123" can be made by rearranging the digits.
// Example 3:
// Input: num = "45544554"
// Output: "54455445"
// Explanation: The next palindrome larger than "45544554" is "54455445".
// Constraints:
// 1 <= num.length <= 10^5
// num is a palindrome.
import "fmt"
func nextPalindrome(num string) string {
s := []byte(num)
nextPermutation := func(arr []byte) bool {
n := len(arr)
i := n - 2
for i >= 0 && arr[i] >= arr[i+1] {
i--
}
if i < 0 { return false }
j := n - 1
for j >= 0 && arr[i] >= arr[j] {
j--
}
arr[i], arr[j] = arr[j], arr[i]
b := arr[i+1:]
for i, m := 0, len(b); i < m/2; i++ {
b[i], b[m-1-i] = b[m-1-i], b[i]
}
return true
}
if !nextPermutation(s[:len(s)/2]) { return "" }
for i, n := 0, len(s); i < n/2; i++ {
s[n-1-i] = s[i]
}
return string(s)
}
func main() {
// Example 1:
// Input: num = "1221"
// Output: "2112"
// Explanation: The next palindrome larger than "1221" is "2112".
fmt.Println(nextPalindrome("1221")) // "2112"
// Example 2:
// Input: num = "32123"
// Output: ""
// Explanation: No palindromes larger than "32123" can be made by rearranging the digits.
fmt.Println(nextPalindrome("32123")) // ""
// Example 3:
// Input: num = "45544554"
// Output: "54455445"
// Explanation: The next palindrome larger than "45544554" is "54455445".
fmt.Println(nextPalindrome("45544554")) // "54455445"
}