{"push_id":559120549,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8c3e9557b2ee171cfb0d49382c0c695fff719196","before":"67b7dffdcdc45e1b2c6b2d55d721e7be8d397c32","commits":[{"sha":"8c3e9557b2ee171cfb0d49382c0c695fff719196","author":{"email":"b4bac99744027c7bd9920b09cd6df360843b58c6@foxmail.com","name":"wesleyzh"},"message":"isanagrampalindrome\n\nA string is a palindrome if it has exactly the same sequence of\ncharacters when read left-to-right as it has when read right-to-left.\nFor example, the following strings are palindromes:\n    \"kayak\",\n    \"Rats live on no evil star\",\n    \"Able was I ere I saw Elba\".\n    A string A is an anagram of a string B if A can be obtained from B\nby rearranging the characters. For example, in each of the following\npairs one string is an anagram of the other:\n    \"mary\" and \"army\",\n    \"rocketboys\" and \"octobersky\",\n\nWrite a function:\n    class Solution { public int isAnagramOfPalindrome(String S); }\n    that, given a non-empty string S consisting of N characters,\nreturns 1 if S is an anagram of some palindrome and returns 0 otherwise.\nAssume that:\nN is an integer within the range [1..100,000];\nstring S consists only of English lower-case letters (a-z).\n\nFor example, given S = \"dooernedeevrvn\", the function should return 1,\nbecause \"dooernedeevrvn\" is an anagram of the palindrome\n\"neveroddoreven\". Given S = \"aabcba\", the function should return 0.\n\nComplexity:\n    expected worst-case time complexity is O(N);\n    expected worst-case space complexity is O(1) (not counting the\nstorage required for input arguments).","distinct":true,"url":"https://api.github.com/repos/wesleyzh/Algorithm/commits/8c3e9557b2ee171cfb0d49382c0c695fff719196"}]}