摘要:
class Solution { public int binary_search(int[]nums,int left,int right,int target){ int mid=0; while(left<=right){ mid = (left+right)/2; if(nums[mid]> 阅读全文
摘要:
class Solution { public int maxProfit(int[] prices) { int res=0; int MinPrice = Integer.MAX_VALUE; int len = prices.length-1; for(int i=0;i<=len;i++){ 阅读全文