zoukankan      html  css  js  c++  java
  • LeetCode_35. Search Insert Position

    35. Search Insert Position

    Easy

    Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

    You may assume no duplicates in the array.

    Example 1:

    Input: [1,3,5,6], 5
    Output: 2
    

    Example 2:

    Input: [1,3,5,6], 2
    Output: 1
    

    Example 3:

    Input: [1,3,5,6], 7
    Output: 4
    

    Example 4:

    Input: [1,3,5,6], 0
    Output: 0
    package leetcode.easy;
    
    public class SearchInsertPosition {
    	@org.junit.Test
    	public void test() {
    		int[] nums1 = { 1, 3, 5, 6 };
    		int target1 = 5;
    		int[] nums2 = { 1, 3, 5, 6 };
    		int target2 = 2;
    		int[] nums3 = { 1, 3, 5, 6 };
    		int target3 = 7;
    		int[] nums4 = { 1, 3, 5, 6 };
    		int target4 = 0;
    		System.out.println(searchInsert(nums1, target1));
    		System.out.println(searchInsert(nums2, target2));
    		System.out.println(searchInsert(nums3, target3));
    		System.out.println(searchInsert(nums4, target4));
    	}
    
    	public int searchInsert(int[] nums, int target) {
    		int low = 0;
    		int high = nums.length - 1;
    		while (low <= high) {
    			int mid = (low + high) / 2;
    			if (nums[mid] == target) {
    				return mid;
    			}
    			if (nums[mid] > target) {
    				high = mid - 1;
    			} else {
    				low = mid + 1;
    			}
    		}
    		return low;
    	}
    }
    
  • 相关阅读:
    iOS layoutSubviews 什么时候会被调用
    view
    NSDictionaryOfVariableBindings
    获取相册中得图片
    相机
    给定文字测量它的大小
    git
    单例的创建
    物理引擎简介——Cocos2d-x学习历程(十三)
    场景切换特效Transition——Cocos2d-x学习历程(十二)
  • 原文地址:https://www.cnblogs.com/denggelin/p/11566787.html
Copyright © 2011-2022 走看看