摘要: Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. Credits:Special thanks t 阅读全文
posted @ 2017-10-22 05:32 apanda009 阅读(92) 评论(0) 推荐(0) 编辑
摘要: Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form 阅读全文
posted @ 2017-10-22 05:14 apanda009 阅读(125) 评论(0) 推荐(0) 编辑