摘要:
Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Not 阅读全文
posted @ 2017-01-22 11:20
璨璨要好好学习
阅读(108)
评论(0)
推荐(0)
摘要:
Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 这道题首先要读懂题目。。。一开始连factori 阅读全文
posted @ 2017-01-22 05:09
璨璨要好好学习
阅读(124)
评论(0)
推荐(0)

浙公网安备 33010602011771号