mnhdd的博客

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array. Example: For num = 5

题目：Determine whether an integer is a palindrome. Do this without extra space. 解法1、需要额外空间：    存储各位数字，逆转，换回逆转值，与原值比较 class Solution { public: int reverse(int x) { long long sum=0; lo

题目：Given an integer n, return the number of trailing zeroes in n!.   Note: Your solution should be in logarithmic time complexity. 解法1:：    分析： 对n!做质因数分解n!=2x*3y*5z*... 显然0的个数等于min(