随笔分类 -  LeetCode

上一页 1 ··· 36 37 38 39 40 41 42 43 44 ··· 61 下一页
摘要:Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point o 阅读全文
posted @ 2016-11-01 10:46 Grandyang 阅读(7411) 评论(0) 推荐(1)
摘要: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: You 阅读全文
posted @ 2016-10-31 21:56 Grandyang 阅读(15796) 评论(3) 推荐(1)
摘要:Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the 阅读全文
posted @ 2016-10-30 23:17 Grandyang 阅读(23100) 评论(13) 推荐(1)
摘要:Implement a data structure supporting the following operations: Challenge: Perform all these in O(1) time complexity. 这道题让我们实现一个全是O(1)复杂度的数据结构,包括了增加ke 阅读全文
posted @ 2016-10-29 23:51 Grandyang 阅读(12213) 评论(5) 推荐(0)
摘要:Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum. The 阅读全文
posted @ 2016-10-28 12:32 Grandyang 阅读(25263) 评论(19) 推荐(1)
摘要:Given a set of words (without duplicates), find all word squares you can build from them. A sequence of words forms a valid word square if the kth row 阅读全文
posted @ 2016-10-27 22:57 Grandyang 阅读(13641) 评论(0) 推荐(1)
摘要:Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the 阅读全文
posted @ 2016-10-26 09:06 Grandyang 阅读(16337) 评论(5) 推荐(1)
摘要:Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order. Note: Example 1: Examp 阅读全文
posted @ 2016-10-25 12:16 Grandyang 阅读(5828) 评论(0) 推荐(0)
摘要:Given a sequence of words, check whether it forms a valid word square. A sequence of words forms a valid word square if the kth row and column read th 阅读全文
posted @ 2016-10-24 06:26 Grandyang 阅读(8169) 评论(0) 推荐(0)
摘要:Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231. Find the maximum result of ai XOR aj, where 0 ≤ i, j < n. Could you do t 阅读全文
posted @ 2016-10-23 23:57 Grandyang 阅读(17335) 评论(5) 推荐(0)
摘要:A password is considered strong if below conditions are all met: Write a function strongPasswordChecker(s), that takes a string s as input, and return 阅读全文
posted @ 2016-10-22 23:54 Grandyang 阅读(10319) 评论(5) 推荐(0)
摘要:Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number. E 阅读全文
posted @ 2016-10-20 23:47 Grandyang 阅读(13751) 评论(6) 推荐(0)
摘要:Given an 2D board, count how many battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may ass 阅读全文
posted @ 2016-10-19 23:39 Grandyang 阅读(11165) 评论(6) 推荐(0)
摘要:Given a rows x cols screen and a sentence represented by a list of words, find how many times the given sentence can be fitted on the screen. Note: Ex 阅读全文
posted @ 2016-10-18 22:53 Grandyang 阅读(15932) 评论(3) 推荐(0)
摘要:A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the 阅读全文
posted @ 2016-10-17 01:27 Grandyang 阅读(10187) 评论(2) 推荐(0)
摘要:Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should output “Fizz” instead of the numbe 阅读全文
posted @ 2016-10-16 13:25 Grandyang 阅读(5893) 评论(3) 推荐(0)
摘要:Given an m x n matrix of non-negative integers representing the height of each unit cell in a continent, the "Pacific ocean" touches the left and top 阅读全文
posted @ 2016-10-14 23:33 Grandyang 阅读(16243) 评论(8) 推荐(1)
摘要:Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both 阅读全文
posted @ 2016-10-12 07:42 Grandyang 阅读(31479) 评论(31) 推荐(3)
摘要:Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and num2. Note: The length of both num1 and num2 is < 5100. 阅读全文
posted @ 2016-10-09 23:59 Grandyang 阅读(11865) 评论(3) 推荐(1)
摘要:A string such as "word" contains the following abbreviations: ["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1 阅读全文
posted @ 2016-10-07 13:27 Grandyang 阅读(10010) 评论(0) 推荐(0)

上一页 1 ··· 36 37 38 39 40 41 42 43 44 ··· 61 下一页
Fork me on GitHub