BinarySearch
konsy_dong
Java,C++,Python,linux
展开
-
LeetCode 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array.原创 2017-03-16 12:48:10 · 339 阅读 · 0 评论 -
LeetCode 278. First Bad Version
题目: You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on原创 2017-04-19 14:33:09 · 344 阅读 · 0 评论 -
LeetCode 69. Sqrt(x)
题目: Implement int sqrt(int x). Compute and return the square root of x.思路: 写一个自己的求平方根的函数。 初始化low为0,high为x,mid为(high-low)/2+low。如果mid的平方不为x,如果mid的平方大于x面mid-1的平方小于x,直接返回mid-1,其实是没有平方根,就返回小的数;如果mid的平方原创 2017-04-19 11:47:39 · 268 阅读 · 0 评论 -
LeetCode 374. Guess Number Higher or Lower
题目: We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I’ll tell you whether the number is highe原创 2017-04-19 11:19:01 · 325 阅读 · 0 评论 -
LeetCode 287. Find the Duplicate Number
题目: Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number原创 2017-04-19 10:23:32 · 260 阅读 · 0 评论 -
LeetCode 4. Median of Two Sorted Arrays
题目: There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1: nums1 = [1, 3]原创 2017-04-19 10:21:31 · 226 阅读 · 0 评论 -
LeetCode 350. Intersection of Two Arrays II
题目: Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note: Each element in the result should appear as many times a原创 2017-04-18 16:15:41 · 241 阅读 · 0 评论 -
LeetCode 349. Intersection of Two Arrays
题目: Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].思路: 找出nums2与nums1相交的元素,若重复,则只要一个。 具体思路见代码代码:class Solution { pub原创 2017-04-04 16:28:05 · 475 阅读 · 0 评论 -
LeetCode 167. Two Sum II - Input array is sorted
题目 : Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbe原创 2017-04-12 14:49:42 · 338 阅读 · 0 评论 -
LeetCode 367. Valid Perfect Square
题目: Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in library function such as sqrt.Example 1: Input: 16 Returns:原创 2017-04-08 14:59:51 · 366 阅读 · 0 评论 -
LeetCode 300. Longest Increasing Subsequence
题目: Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101], ther原创 2017-09-21 12:55:42 · 259 阅读 · 0 评论