35 - Search Insert Position

 JAVA

• class Solution {
      public int searchInsert(int[] nums, int target) {
          int left = 0, right = nums.length;
          while (left < right) {
              int mid = (left + right) >>> 1;
              if (nums[mid] >= target) {
                  right = mid;
              } else {
                  left = mid + 1;
              }
          }
          return left;
      }
  }

C++

• class Solution {
  public:
      int searchInsert(vector<int>& nums, int target) {
          int left = 0, right = nums.size();
          while (left < right) {
              int mid = left + right >> 1;
              if (nums[mid] >= target)
                  right = mid;
              else
                  left = mid + 1;
          }
          return left;
      }
  };