题解 | #二分查找-I#
链表中的节点每k个一组翻转
http://www.nowcoder.com/practice/b49c3dc907814e9bbfa8437c251b028e
class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param nums int整型vector * @param target int整型 * @return int整型 */ int search(vector& nums, int target) { // write code here int l= -1 ,r=nums.size(); int mid; int result = -1; while((r-l)>1) { mid = (l+r)/2; if(nums[mid]>target) { r = mid; } else if(nums[mid]<target) { l = mid; } else { result = mid; break; } } return result;
}
};