shenlan282的笔记

转载自：LeetCode Question Difficulty Distribution               1 Two Sum 2 5 array sort         set Two Pointe

//Given an array of integers, find two numbers such that they add up to a specific target number. // // The function twoSum should return indices of the two numbers such that they add up to the target

//Given a sorted array, remove the duplicates in place such that each element appear only // once and return the new length. // Do not allocate extra space for another array, you must do this in place

//Given a sorted array, remove the duplicates in place such that each element appear only // once and return the new length. // Do not allocate extra space for another array, you must do this in place

//Sear in Rotated Sorted Array //Suppose a sorted array is rotated at some pivot unknown to you beforehand. // // (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). // // You are given a target value