首页 > 代码库 > search-insert-position
search-insert-position
https://leetcode.com/problems/search-insert-position/
https://leetcode.com/mockinterview/session/result/xjw45dt/
这是一个典型的二分查找。注意一些坑。比如里面start end的设置,到了边界条件时+1 -1的处理等。
package com.company; import java.util.*; class Solution { public int searchInsert(int[] nums, int target) { int start = 0; int end = nums.length - 1; int mid; while (start <= end) { mid = start + (end - start) / 2; if (nums[mid] == target) { return mid; } else if (nums[mid] > target) { end = mid - 1; } else { start = mid + 1; } } return start; } } public class Main { public static void main(String[] args) throws InterruptedException { System.out.println("Hello!"); Solution solution = new Solution(); // Your Codec object will be instantiated and called as such: int[] nums = {1,3,5,6,7}; int target = 7; int ret = solution.searchInsert(nums, target); System.out.printf("ret:%d\n", ret); System.out.println(); } }
search-insert-position
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。