Yuwen's Hero

问题： 给你两个排序的数组，求两个数组的并集。比如： A = 1 3 4 5 7， B = 2 3 5 8 9， 那么并集就是 1 2 3 4 5 7 8 9.代码：public class Union { public static void main(String[] args) { char[] ch1 = "abcde".toCharArray(); c

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] ha

Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:

Suppose we have an array a1, a2, ..., an, b1, b2, ..., bn. Implement an algorithm to change this array to a1, b1, a2, b2, ..., an, bn.public void shuffle(char[] arr) { if (arr == null || arr.length

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i,

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,

问题：How would you define a data structure that stores a set ofvalues (i.e., a value cannot appear more than one time), and implements the following functions:add(p)--adds the value p to the setde

Question:Say you have an array for which the i-th element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you li

问题：Given array of integers representing historic stock prices. Find the buying and selling points to maximize the profit. 给你一个整数数组，数组的值代表股票的历史价格。找到买点和卖点，使得利润最大。假设数组为array = {3, 8, 1, 2, 19, 22, 2,

Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You ma

问题：一个int数组, 比如 array[]，里面数据无任何限制，要求求出所有这样的数array[i]，其左边的数都小于等于它，右边的数都大于等于它。能否只用一个额外数组和少量其它空间实现。分析：最原始的方法是检查每一个数 array[i] ，看是否左边的数都小于等于它，右边的数都大于等于它。这样做的话，要找出所有这样的数，时间复杂度为O(N^2)。其实可以有更简单的方法，我们

最简单的办法，就是先排序，然后把第K个值找出来，这样算法的复杂度为 O(nlgn).其实还有一种更简单的方法，其平均复杂度 为 O(lgn)，当然，最坏是 O(n^2). 这种算法就是利用了 quicksort 和二分查找 的做法。先把数组分成两个部分，左边一个部分比pivot小，另一边比pivot大。然后再观察pivot的位置，如果pivot的位置比 K大，那么那个第K个值就一定在pivot

There are two sorted arrays A and B 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)).O(m + n) solution: public stat

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 to search. If found in the array ret

Given a number represented as an array of digits, plus one to the number.public class Solution { public int[] plusOne(int[] digits) { if (digits == null || digits.length == 0) return nul

问题： 给你两个排序的数组，求两个数组的交集。 比如： A = 1 3 4 5 7， B = 2 3 5 8 9， 那么交集就是 3 5.分析：因为数组A B均排过序，所以，我们可以用两个“指针”分别指向两个数组的头部，如果其中一个比另一个小，移动小的那个数组的指针；如果相等，那么那个值是在交集里，保存该值，这时，同时移动两个数组的指针。一直这样操作下去，直到有一个指针已经超过

问题：给定一个 int 数组，找出里面出现次数超过一半的数字。分析：首先，我们假定该数组中存在超过一半的数字，要把那个数字找出来，我们有以下方法：1. 排序。出现次数最大的那个数字一定是排序后第 n/2 + 1 那个值(假定是从1 开始数)。复杂度为O(nlgn).2. 遍历一遍数组，找出数组里的最大值max和最小值min，然后创建一个大小为 max - min + 1的数组，

Question:Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space to hold additional elements from B. The number of elements init

Question:Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the n

Question: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 thi

Question:Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array A = [1,1,1,2,2,3],Your function should return length = 5, and

Question:Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respect

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.

Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found in

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the integers 0

A long array A[] is given to you. There is a sliding window of size w which is moving from the very left of the array to the very right. You can only see the w numbers in the window. Each time the sli

Question: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

There are N gas stations along a circular route, where the amount of gas at station i is gas[i].  You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to