Question

IN JAVA please

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.

Your code will be tested for runtime. Code which does not output a result in logarithmic time (making roughly log(2) N comparisons) will fail the tests.

A sample main function is provided so that you may test your code on sample inputs. For testing purposes, the input must be in sorted order, and a value to insert must be assigned to the target variable in the main function. Inputs can be provided in the box below your code, please format your input as follows:

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

Example 5:

Input: [], 3

Output: 0

PLEASE US THIS TEMPLATE

import java.util.Scanner;
import java.util.ArrayList;

public class Solution {
public int getIndex(int [] nums, int target) {
//Add code below
  
}
//Sample main to run tests
public static void main(String args[]) {
//Custom set variable
/*
* You can set this value to an item within the array
* Set to 0 by default
*/
int target = 0;
/*
*
*/
//Variables
Scanner scnr = new Scanner(System.in);
ArrayList<Integer> arrList = new ArrayList<Integer>();
int [] arr;
Solution test = new Solution();
//Remaining values will be added to the array
while(scnr.hasNext()){
arrList.add(scnr.nextInt());
}
//Instance primitive array to size of ArrayList
arr = new int[arrList.size()];
//Copy elements from ArrayList to primitive array
for(int i = 0; i < arr.length; i++)
arr[i] = arrList.get(i);
//Test values
int out = test.getIndex(arr,target);
System.out.println(out);
}
}

Answer 1

If you have any doubts, please give me comment...

import java.util.Scanner;

import java.util.ArrayList;

public class Solution {

    public int getIndex(int[] nums, int target) {

        // Add code below

        int l = 0, r = nums.length-1;

        int m = l + (r - l) / 2;

        while (l <= r) {

            if (nums[m] == target)

                return m;

            else if (nums[m] < target)

                l = m + 1;

            else

                r = m - 1;

            m = l + (r - l) / 2;

        }

        return m;

    }

    // Sample main to run tests

    public static void main(String args[]) {

        // Custom set variable

        /*

         * You can set this value to an item within the array Set to 0 by default

         */

        int target = 3;

        /*

        *

        */

        // Variables

        Scanner scnr = new Scanner(System.in);

        ArrayList<Integer> arrList = new ArrayList<Integer>();

        int[] arr;

        Solution test = new Solution();

        // Remaining values will be added to the array

        while (scnr.hasNext()) {

            arrList.add(scnr.nextInt());

        }

        // Instance primitive array to size of ArrayList

        arr = new int[arrList.size()];

        // Copy elements from ArrayList to primitive array

        for (int i = 0; i < arr.length; i++)

            arr[i] = arrList.get(i);

        // Test values

        int out = test.getIndex(arr, target);

        System.out.println(out);

    }

}