Implement lowerBound utility
Java
Medium
5 views
Problem Description
Task: write a reusable method lowerBound for sorted array. Return first index with value >= target.
Output Format
Return value
Constraints
Same as binary search variant.
Official Solution
static int lowerBound(int[] a,int target){int l=0,r=a.length;while(l<r){int m=l+(r-l)/2; if(a[m]>=target) r=m; else l=m+1;}return l;}
Solutions (0)
No solutions submitted yet. Be the first!
No comments yet. Start the discussion!