목록회문 (1)
이야기박스
![](http://i1.daumcdn.net/thumb/C150x150.fwebp.q85/?fname=https://blog.kakaocdn.net/dn/bYU4ob/btrwVtiNtGh/KZhxBdbAyxcCHWrxbcrzb1/img.png)
Problem Given a number, find the next smallest palindrome larger than this number. For example, if the input number is “2 3 5 4 5”, the output should be “2 3 6 3 2”. And if the input number is “9 9 9”, the output should be “1 0 0 1”. The input is assumed to be an array. Every entry in array represents a digit in input number. Let the array be ‘num[]’ and size of array be ‘n’ Example There can be..
Computer & Data/Algorithm
2022. 3. 28. 20:18