- 博客(9)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode 68 Text Justification
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. You should pack your words in a greedy approach; that i
2016-11-22 23:50:12
215
原创 LeetCode 44 Wildcard Matching
Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*' Matches any sequence of characters (including the empty sequence). The matching should cover t
2016-11-14 15:04:04
208
原创 LeetCode 30 Substring with Concatenation of All Words
You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and
2016-11-12 11:29:14
216
原创 LeetCode 393 UTF-8 Validation
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules: For 1-byte character, the first bit is a 0, followed by its unicode code.For n-bytes character, the first n-bits
2016-11-10 09:56:07
497
原创 LeetCode 32 Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the longest valid parentheses substring is "()",
2016-11-08 10:33:12
190
原创 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 = "ADOBECODEBANC" T = "ABC" Minimum window is "BAN
2016-11-04 18:24:33
201
原创 LeetCode 10 Regular Expression Matching
Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire input st
2016-11-03 14:59:30
308
原创 LeetCode 41 First Missing Positive
Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and uses constant
2016-11-01 21:20:29
144
原创 LeetCode 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 initially sorted according to their start times. E
2016-11-01 15:59:36
218
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人