LeetCode Q266: Palindrome Permutation

Given a string, determine if a permutation of the string could form a palindrome.

For example,
"code" -> False, "aab" -> True, "carerac" -> True.

Solution:

	class Solution {
	public:
	bool canPermutePalindrome(string s) {
	int m[128];
	for(int i=0; i<128; i++) m[i]=0;
	for(int i=0; i<s.length(); i++) m[s[i]]++;
	int odd=0;
	for(int i=0; i<128; i++){
	if(m[i]%2!=0) odd++;
	}
	return odd==0? true:odd==1?true:false;
	}
	};

view raw Q266.cpp hosted with ❤ by GitHub