CodesKiller - 博客园

2017年2月4日

摘要： Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Not 阅读全文

posted @ 2017-02-04 02:46 CodesKiller 阅读(96) 评论(0) 推荐(0) 编辑

435. Non-overlapping Intervals

摘要： Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Note: Exam 阅读全文

posted @ 2017-02-04 02:05 CodesKiller 阅读(164) 评论(0) 推荐(0) 编辑

2017年2月3日

452. Minimum Number of Arrows to Burst Balloons

摘要： There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the hor 阅读全文

posted @ 2017-02-03 14:40 CodesKiller 阅读(140) 评论(0) 推荐(0) 编辑

253. Meeting Rooms II

摘要： Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of conference room 阅读全文

posted @ 2017-02-03 13:57 CodesKiller 阅读(316) 评论(0) 推荐(0) 编辑

252. Meeting Rooms

摘要： Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend all mee 阅读全文

posted @ 2017-02-03 12:58 CodesKiller 阅读(170) 评论(0) 推荐(0) 编辑

57. Insert Interval

摘要： Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initia 阅读全文

posted @ 2017-02-03 12:36 CodesKiller 阅读(181) 评论(0) 推荐(0) 编辑

56. 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]. 1 /** 2 * 阅读全文

posted @ 2017-02-03 11:02 CodesKiller 阅读(151) 评论(0) 推荐(0) 编辑

221. Maximal Square

摘要： Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. For example, given the following ma 阅读全文

posted @ 2017-02-03 08:37 CodesKiller 阅读(116) 评论(0) 推荐(0) 编辑

84. Largest Rectangle in Histogram

摘要： Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文

posted @ 2017-02-03 07:47 CodesKiller 阅读(94) 评论(0) 推荐(0) 编辑

85. Maximal Rectangle

摘要： Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. For example, given the following 阅读全文

posted @ 2017-02-03 07:34 CodesKiller 阅读(145) 评论(0) 推荐(0) 编辑

公告