felinewong的博客

问题： 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: "((()))", "(()())", "(())()", "()(()

题目： Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. 思路： 1.每个点与其他点进行比较 2.用Map来保存斜率，两个点之间有三种关系 （1）重复，用dup来保存重复数量 （2）垂直，用vcnt来保存垂直数量 （3）倾斜，用

题目一：best-time-to-buy-and-sell-stock Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy

题目： Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain

题目： Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. For example,  Given[0,1,0,2,1,0,1,3,2,

题目： 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 length is

题目： 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. 思路： 1.

题目： 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

题目一：word-break Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s ="leet