随笔分类 -  Binary Search

154. Find Minimum in Rotated Sorted Array II
摘要：class Solution { public int findMin(int[] nums) { int lo=0; int hi=nums.length-1; while(lonums[hi]) lo=mid+1; else hi--; ... 阅读全文
posted @ 2017-10-24 01:05 Weiyu Wang 阅读(131) 评论(0) 推荐(0)
153. Find Minimum in Rotated Sorted Array
摘要：class Solution { public int findMin(int[] nums) { int lo=0; int hi=nums.length-1; while(lo<hi) { int mid=(lo+hi)/2; if(nums[mid]<nums[hi]) ... 阅读全文
posted @ 2017-10-24 01:02 Weiyu Wang 阅读(169) 评论(0) 推荐(0)
81. Search in Rotated Sorted Array II
摘要：class Solution { public boolean search(int[] nums, int target) { if(nums.length==0) return false; int lo=0; int hi=nums.length-1; while(lonums[hi]) ... 阅读全文
posted @ 2017-09-27 11:10 Weiyu Wang 阅读(125) 评论(0) 推荐(0)
74. Search a 2D Matrix
摘要：public class Solution { public boolean searchMatrix(int[][] matrix, int target) { if(matrix.length==0||matrix[0].length==0) return false; int m=matrix.length; ... 阅读全文
posted @ 2017-09-26 11:43 Weiyu Wang 阅读(102) 评论(0) 推荐(0)
34. Search for a Range
摘要：public class Solution { public int[] searchRange(int[] nums, int target) { return new int[]{binarySearch(nums,target,true),binarySearch(nums,target,false)}; } private int binarySe... 阅读全文
posted @ 2017-09-23 13:23 Weiyu Wang 阅读(131) 评论(0) 推荐(0)
33. Search in Rotated Sorted Array
摘要：public class Solution { public int search(int[] nums, int target) { int l=0; int r=nums.length-1; while(l<r) { int m=l+(r-l)/2; if(nums[m]=... 阅读全文
posted @ 2017-09-23 13:08 Weiyu Wang 阅读(127) 评论(0) 推荐(0)
4. Median of Two Sorted Arrays
摘要：public class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int l=(nums1.length+nums2.length+1)>>1; int r=(nums1.length+nums2.length+2)>>1; re... 阅读全文
posted @ 2017-09-21 12:34 Weiyu Wang 阅读(153) 评论(0) 推荐(0)