hanay-CSDN博客

原创 Leetcode Generate Parentheses

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: "((()))", "(()())", "(())()", "()(())", "()()()"

2015-10-28 01:45:14 225

原创 Leetcode Container With Most Water

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find

2015-10-27 05:35:10 278

原创 Leetcode 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

2015-10-27 02:28:12 252

原创 LeetCode ZigZag Conversion

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I

2015-10-26 06:32:09 186

原创 Leetcode Longest Palindromic Substring

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 字符串长度为N，一共有N^2种子字符

2015-10-26 05:35:08 176

原创 Leetcode Median of Two Sorted Arrays

Problemn There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 思路很不好想的一道题！首先

2015-10-25 03:51:04 166

原创 LeetCode Longest Substring Without Repeating Characters

Problem： Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the lengt

2015-10-24 14:54:09 188

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人