hermito的专栏

题目地址： https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/ 描述： Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K. If there is no non-empty s...

题目地址：https://leetcode.com/problems/combination-sum-ii/描述： Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candid...

题目来源： http://acm.hdu.edu.cn/showproblem.php?pid=3068 https://leetcode.com/problems/longest-palindromic-substring/ 问题描述： 给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度. 回文就是正反读都是一样的字符串,如aba, abba

ID 问题 难度 面试频率 数据结构 算法                                 1 Two Sum 2 5 array sort

题目地址： https://leetcode.com/problems/regular-expression-matching/ 描述： '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire inpu

题目地址： https://leetcode.com/problems/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 suc

题目地址： https://leetcode.com/problems/generate-parentheses/ 描述： Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. 分析 首先想到卡特兰数，根据递推公式h(n)= h(0)*

题目地址： https://leetcode.com/problems/divide-two-integers/ 描述： Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 分析 http://www.tuicool

题目地址： https://leetcode.com/problems/next-permutation/ 描述： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement i

题目地址： https://leetcode.com/problems/longest-valid-parentheses/ 描述： Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substrin