Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

sort(nums.begin(),nums.end()); return nums[0];

no algorithm used...............question solved.

Sorting takes O(n log n), while you can do this in O(log n) using binary search approach.

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.