漫漫学习路

问题描述：Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every ele

问题描述：Given an array of integers and an integer k, find out whether there are two distinct indicesi andj in the array such that nums[i] = nums[j] and the absolute difference betweeni andj is at m

问题描述：Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array),some elements appear twice and others appear once.Find all the elements that appear twice in this array.Could you do it withou

问

问题描述：Given a sorted array（注意题目给的是已经排好序的数组）, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate extra space for another array, you must

问题描述：Say you have an array for which the ith element is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete as many transactions as you like(ie, b

问题描述：Say you have an array for which the ith element is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the s

问题描述：Say you have an array for which the ith element is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete at mosttwo transactions.(发现这些问题变化了啥没？)

问题描述：Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose an array sorted in ascending order is

问题描述：A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks

问题描述：Given an array nums containing n + 1 integers where each integer isbetween 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate nu

问题描述：Suppose an array sorted in ascending(升序) order 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).Find the minimum element

问题描述：Given an unsorted integer array, find the first missing positive integer. For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and uses con

问题描述：Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations inC where the candidate numbers sums toT.The same repeated number may be chos

问题描述：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inC where the candidate numbers sums toT.Each number in C may only be used once in the comb

问题描述：Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.(就是要求你从1~9之间找到K个数

问题描述：According to the Wikipedia's article(问题详细介绍): "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970." Given abo

问题描述：Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree. 啰嗦一句，可能学过数据结构的人看到题目就知道啥意思了，给的问题介绍和描述几乎没啥意思。示例:

问题描述：Given preorder and inorder traversal of a tree, construct the binary tree.(意思很简单，给出先序和中序遍历的序列，构造出这棵二叉树)Note:You may assume that duplicates do not exist in the tree. 示例：其实这个图我在上一篇文章就给出了，

问题描述：Design a data structure that supports all following operations in average O(1) time.insert(val): Inserts an item val to the set if not already present.remove(val):Removes an item val fr

问题描述：Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start time

问题描述：Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memo

问题描述：You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note:You have to rotate the image in-place, which means you have to modify the input 2D

问题描述：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

问题描述：Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first in

问题描述：Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(logn).I

问题描述：Rotate an array of n elements to the right by k steps.Note:Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.示例：For example, with

问题描述：Suppose an array sorted in ascending order 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 to search. If f

问题描述：Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose an array sorted in ascending order is rotate

问题描述：Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Follow up: Did you use extra space?A straight forward solution using O(mn) space is probably

问题描述：Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.You ne

问题描述：Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with thecolors in the order red, white and blue. Here, we will use the in

问题描述：Given an array of integers and an integer k, you need to find the total number ofcontinuous subarrays whose sum equals to k.Note:The length of the array is in range [1, 20,000].The ra

问题描述：Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.示例：For example,If nums = [1,2,3], a solution is: [  [3]

问题描述：Given a collection of integers that might contain duplicates,nums, return all possible subsets.Note: The solution set must not contain duplicate subsets. 示例：For example,If nums = [1,2

问题描述：Given a sorted integer array without duplicates, return the summary of its ranges.示例一：Input: [0,1,2,4,5,7]Output: ["0->2","4->5","7"]示例二：Input: [0,2,3,4,6,8,9]Output: ["0","2->4","6

问题描述：Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could be done without original order. Each tas

问题描述：In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attackingascending time series towards Ashe and the poiso

问题描述：Given a non-empty array of integers, return the third maximum number in this array.If it does not exist, return the maximum number. The time complexity must be in O(n).示例一:Input: [3, 2, 1]

问题描述：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.Note:Bonus point if you are able to do this using only O(n) extra