Given a string, find out if its characters can be rearranged to form a palindrome.
Example
For inputString = "aabb"
, the output should bepalindromeRearranging(inputString) = true
.
We can rearrange "aabb"
to make "abba"
, which is a palindrome.
Code
function palindromeRearranging(inputString) {
}
'알고리즘(CF)' 카테고리의 다른 글
20. arrayMaximalAdjacentDifference (1) | 2017.06.18 |
---|---|
19. areEquallyStrong (1) | 2017.06.18 |
17. arrayChange (1) | 2017.06.17 |
16. areSimilar (1) | 2017.06.17 |
15. addBorder (1) | 2017.06.17 |