CodesKiller - 博客园

2017年3月7日

摘要： Given a picture consisting of black and white pixels, and a positive integer N, find the number of black pixels located at some specific row Rand colu 阅读全文

posted @ 2017-03-07 13:57 CodesKiller 阅读(229) 评论(0) 推荐(0)

531. Lonely Pixel I

摘要： Given a picture consisting of black and white pixels, find the number of black lonely pixels. The picture is represented by a 2D char array consisting 阅读全文

posted @ 2017-03-07 04:02 CodesKiller 阅读(311) 评论(0) 推荐(0)

495. Teemo Attacking

摘要： In LLP world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascend 阅读全文

posted @ 2017-03-07 03:01 CodesKiller 阅读(225) 评论(0) 推荐(0)

370. Range Addition

摘要： Assume you have an array of length n initialized with all 0's and are given k update operations. Each operation is represented as a triplet: [startInd 阅读全文

posted @ 2017-03-07 02:46 CodesKiller 阅读(148) 评论(0) 推荐(0)

487. Max Consecutive Ones II

摘要： Given a binary array, find the maximum number of consecutive 1s in this array if you can flip at most one 0. Example 1: Note: The input array will onl 阅读全文

posted @ 2017-03-07 01:54 CodesKiller 阅读(278) 评论(0) 推荐(0)

2017年3月6日

485. Max Consecutive Ones

摘要： Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Note: The input array will only contain 0 and 1. The length 阅读全文

posted @ 2017-03-06 13:26 CodesKiller 阅读(137) 评论(0) 推荐(0)

414. Third Maximum Number

摘要： 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 complexi 阅读全文

posted @ 2017-03-06 13:19 CodesKiller 阅读(152) 评论(0) 推荐(0)

90. Subsets II

摘要： Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: The solution set must not contain duplicate sub 阅读全文

posted @ 2017-03-06 12:32 CodesKiller 阅读(111) 评论(0) 推荐(0)

381. Insert Delete GetRandom O(1) - Duplicates allowed

摘要： Design a data structure that supports all following operations in average O(1) time. Note: Duplicate elements are allowed. Example: 阅读全文

posted @ 2017-03-06 11:56 CodesKiller 阅读(185) 评论(0) 推荐(0)

380. Insert Delete GetRandom O(1)

摘要： Design a data structure that supports all following operations in average O(1) time. Example: 阅读全文

posted @ 2017-03-06 09:46 CodesKiller 阅读(198) 评论(0) 推荐(0)

公告