JAVA_Binary Search_LeetCode 704

JAVA_Binary Search_LeetCode 704 풀이 class Solution { public int search(int[] nums, int target) { int num = 0; int end = nums.length-1; while(num <= end){ int mid = num + (end-num) / 2; if(nums[mid]==target){ return mid; }else if(nums[mid] > target){ end = mid - 1; }else{ num = mid + 1; } } return -1; } } * 출처 Binary Search - LeetCode Binary Search - Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exist...

원문링크 : JAVA_Binary Search_LeetCode 704