码迷,mamicode.com
首页 >  
搜索关键字:should be repaired    ( 4956个结果
LintCode-Minimum Subarray
Given an array of integers, find the subarray with smallest sum.Return the sum of the subarray.NoteThe subarray should contain at least one integer.Ex...
分类:其他好文   时间:2015-01-01 00:08:45    阅读次数:135
LintCode-Longest Common Substring
Given two strings, find the longest common substring.Return the length of it.NoteThe characters in substring should occur continiously in original str...
分类:其他好文   时间:2015-01-01 00:01:16    阅读次数:339
inspiration
Recently, I pick back my major knowledge, English because I found I almost forget it. Maybe I should go abroad for further study, or maybe I can ...
分类:其他好文   时间:2014-12-31 14:15:30    阅读次数:170
leetcode 170: Two Sum III - Data structure design
Two Sum III - Data structure design Total Accepted: 311 Total Submissions: 1345 Design and implement a TwoSum class. It should support the following operations: add and find. add - Add the n...
分类:其他好文   时间:2014-12-31 08:45:14    阅读次数:243
Factorial Trailing Zeroes
Given an integern, return the number of trailing zeroes inn!.Note:Your solution should be in logarithmic time complexity.类似于cc:http://www.cnblogs.com/...
分类:其他好文   时间:2014-12-31 08:40:38    阅读次数:193
[leetcode] Factorial Trailing Zeroes
题目:(Math)Given an integern, return the number of trailing zeroes inn!.Note:Your solution should be in logarithmic time complexity.题解:首先列几个例子找一找规律。然后发现...
分类:其他好文   时间:2014-12-30 23:26:41    阅读次数:170
HappyLeetcode39:Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 这个是我的代码,但是超时 class Solut...
分类:移动开发   时间:2014-12-30 22:06:15    阅读次数:169
LeetCode Factorial Trailing Zeroes
Given an integern, return the number of trailing zeroes inn!.Note:Your solution should be in logarithmic time complexity.Credits:Special thanks to@tsf...
分类:其他好文   时间:2014-12-30 22:01:42    阅读次数:107
[leetcode]Factorial Trailing Zeroes
问题描述: Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 基本思想 尾0的个数取决于5的个数。 代码: int trailingZeroes(int n) { //...
分类:其他好文   时间:2014-12-30 20:43:23    阅读次数:132
Factorial Trailing Zeroes
Given an integern, return the number of trailing zeroes inn!.Note:Your solution should be in logarithmic time complexity.只有2 * 5才会产生0只要计算出因子中2和5的个数取小的...
分类:其他好文   时间:2014-12-30 20:27:13    阅读次数:169
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!