摘要:
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-07-25 18:35
Beserious
阅读(102)
推荐(0)
编辑
摘要:
Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 求n得阶层,末尾0的个数 老问题了,统计2,5的
阅读全文
posted @ 2017-07-25 15:21
Beserious
阅读(70)
推荐(0)
编辑
摘要:
Write a SQL query to get the second highest salary from the Employee table. For example, given the above Employee table, the query should return 200 a
阅读全文
posted @ 2017-07-25 12:28
Beserious
阅读(114)
推荐(0)
编辑
摘要:
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function
阅读全文
posted @ 2017-07-25 11:54
Beserious
阅读(116)
推荐(0)
编辑