- 博客(1)
- 收藏
- 关注
原创 leetcode: Find Minimum in Rotated Sorted Array
public class Solution { public static int findMin(int[] num) { int low =0; int high = num.length-1; while(low if(num[(low+high)/2]>num[high]){ low = (
2014-10-23 16:44:56 415
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人