2017年11月13日
Leetcode 81: Search in Rotated Sorted Array II
摘要： 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 arra 阅读全文
posted @ 2017-11-13 05:28 逸朵 阅读(107) 评论(0) 推荐(0)
Leetcode 80: Remove Duplicates from Sorted Array II
摘要： Follow up for "Remove Duplicates":What if duplicates are allowed at most twice? For example,Given sorted array nums = [1,1,1,2,2,3], Your function sho 阅读全文
posted @ 2017-11-13 05:11 逸朵 阅读(121) 评论(0) 推荐(0)
Leetcode 79: Word Search
摘要： Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjac 阅读全文
posted @ 2017-11-13 03:21 逸朵 阅读(149) 评论(0) 推荐(0)
2017年11月11日
Leetcode 78: Subsets
摘要： Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. For ex 阅读全文
posted @ 2017-11-11 07:42 逸朵 阅读(99) 评论(0) 推荐(0)
Leetcode 77: Combinations
摘要： Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is: [ [2,4], [3,4 阅读全文
posted @ 2017-11-11 07:21 逸朵 阅读(135) 评论(0) 推荐(0)
Leetcode 76: Minimum Window Substring
摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S = "ADOBECOD 阅读全文
posted @ 2017-11-11 07:03 逸朵 阅读(122) 评论(0) 推荐(0)
Leetcode 75: Sort Colors
摘要： 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, 阅读全文
posted @ 2017-11-11 06:26 逸朵 阅读(114) 评论(0) 推荐(0)
Leetcode 74: 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 f 阅读全文
posted @ 2017-11-11 06:13 逸朵 阅读(559) 评论(0) 推荐(0)
Leetcode 73: Set Matrix Zeroes
摘要： Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Note: it's a pretty tricky problem, hard to be bug free. 阅读全文
posted @ 2017-11-11 05:50 逸朵 阅读(124) 评论(0) 推荐(0)
2017年11月10日
Leetcode 72: Edit Distance
摘要： Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have 阅读全文
posted @ 2017-11-10 11:55 逸朵 阅读(107) 评论(0) 推荐(0)