Binary Search[Java] - 0ms - 100%Beats
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int findMin(int[] nums) {\n        int start = 0, end = nums.length - 1;\n        while(start < end)\n        {\n          int mid = start + (end -start) / 2;\n          if(nums[mid] > nums[end])\n          start = mid + 1 ;\n          \n          if(nums[mid] < nums[end])\n          end = mid ;\n        }\n        return nums[start];\n    }\n}\n```
['Java']