无名路人甲

摘要： 算法描述： Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit 阅读全文

摘要： 算法描述： 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 tw 阅读全文

摘要： 算法描述： Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non 阅读全文

摘要： 算法描述： Given a linked list, remove the n-th node from the end of list and return its head. Example: Given linked list: 1->2->3->4->5, and n = 2. After 阅读全文

摘要： 算法描述： Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set 阅读全文

摘要： 算法描述： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Example 2: 解题思路： 阅读全文

摘要： 算法描述： Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The a 阅读全文