数组
瓶子的罐子
这个作者很懒,什么都没留下…
展开
-
surrounded regions
题目描述 Given a 2D board containing’X’and’O’, capture all regions surrounded by’X’. A region is captured by flipping all’O’s into’X’s in that surrounded region . For example, X X X X X O O X原创 2017-04-25 10:03:40 · 238 阅读 · 0 评论 -
买卖股票 I II III
Best Time to Buy and Sell Stock IDescription: Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie,原创 2017-05-30 23:05:46 · 438 阅读 · 0 评论 -
数组中最长的连续序列(longest consecutive sequence)
题目:Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is[1, 2, 3, 4].原创 2017-05-30 20:37:55 · 938 阅读 · 0 评论 -
search-a-2d-matrix
题目描述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 integer of each row原创 2017-06-04 22:20:59 · 245 阅读 · 0 评论 -
merge-intervals
题目描述 Given a collection of intervals, merge all overlapping intervals. For example, Given[1,3],[2,6],[8,10],[15,18], return[1,6],[8,10],[15,18].java实现public ArrayList<Interval> merge(ArrayL原创 2017-06-05 12:23:33 · 282 阅读 · 0 评论 -
合并有序数组
题目: 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原创 2017-05-31 21:35:37 · 265 阅读 · 0 评论 -
(有序数组中移除重复元素)Remove Duplicates from Sorted Array
题目: 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 A is now[原创 2017-05-31 23:21:38 · 426 阅读 · 0 评论