search insert position

class Solution {
public int searchInsert(int[] nums, int target) {
int temp=0;

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

{
if(nums[i]==target)
{
temp=i;

    break;
   }
        temp=0;
    if(nums[i]>target)
       {
        temp=i;
           
           break;
       }  
        temp=0;
       if(nums[nums.length-1]<target)
       {
           temp=nums.length;
           break;
       }
   

}
return(temp);
}
}

Comments (0)