ayzmkk的专栏

Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.分析：这是一道求n！后面有几个0的问题，不要用算法的角度去考虑，因为考虑到测试用例肯定会有大数，因此int得到结果后在数0是

Compare two version numbers version1 and version1.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *ad