![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
Jason__Dong
这个作者很懒,什么都没留下…
展开
-
86. Partition List(分割链表)--M
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the原创 2016-03-22 14:13:57 · 364 阅读 · 0 评论 -
LeetCode 172. Factorial Trailing Zeroes(阶乘结果尾数0的个数)---E
题目描述:Given an integer n, return the number of trailing zeroes in n!.Note : Your solution should be in logarithmic time complexity. 首先想到用组合数学的方法来算,n!中0的个数主要看的是1-n 各数的因数中2和5的次数,有多少对(2, 5),结果中就有多少个0,而原创 2016-03-22 08:42:18 · 340 阅读 · 0 评论