JasonChang

摘要： recursion 1 public class Solution { 2 public ArrayList> combine(int n, int k) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 ArrayList> result = new ArrayList>(); 6 if(n list = ... 阅读全文

摘要： 判断左右哪一半sorted对那一边进行binary search 1 public class Solution { 2 public boolean search(int[] A, int target) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 if(A == null) 6 return ... 阅读全文

摘要： 1 public class Solution { 2 public int search(int[] A, int target) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 if(A == null) 6 return -1; 7 int left = 0; 8 ... 阅读全文

摘要： 1 public class Solution { 2 public ArrayList grayCode(int n) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 ArrayList result = new ArrayList(); 6 if(n >1));11 return res... 阅读全文