摘要:
Say I’m given a 2d array where all the numbers in the array are in increasing order from left to right and top to bottom.What is the best way ... 阅读全文
摘要:
/**Solution 1, using recursion. Construct a list of numbers by maintaining what you have now and what is left. Every level you take one elemen... 阅读全文
摘要:
/**O(n)的解法,从左到右遍历。**/public class Solution { public int[] searchRange(int[] A, int target) { if(A.length == 0) { return n... 阅读全文