大三狗现在才努力还不算晚吧？！

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

题目：Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the

题目：Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:

题目：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.翻译：把2个有序链表连接，返回一个新链表思路：很简单，就是遍历每个节点，小的话添加在

题目：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 a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are

题目:Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant s

题目：Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.翻译：把K个有序的链表合成一个，返回。思路：这道题和昨天的Merge 2 Lists有些类似。但是k不确定，如果用每个都去遍历的话，肯定是不会通过的。So、可以想到的是归

题目：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 a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in p

题目：Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new len

题目：Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would hav

题目：Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input

题目：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.翻译：把罗马转为数字思路：如果是单纯的一个罗马字母比较好处理，但是对于4，9这样的，应该看它下一个字符代表的数字是不是比他大，要是大的话减去当前的字符

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

题目：Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.翻译：给一个整数，把他转换为罗马数字输出。这道题是简单的字符转换的问题。只要了解罗马数字代表的含义即可。罗马数字里面只有 1，5，10

题目：Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a tripl

题目：Determine whether an integer is a palindrome. Do this without extra space.翻译：判断一个数字是否是回文数，不要额外空间。解题思路：因为数字既然传过去了，就不会有越界的问题。每次只需要取最前面和最后面的那一位数字进行比较，相同则继续，不同则返回、首先要获取数字的位数，假设数字是12344321，一共有8位。

题目：Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible i

题目：Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321翻译就是把一个数字反过来输出。解题思路：这道题目看起来比较简单。无非就是一个数字取个位，作为另一个高位。无非是在10的运算。代码1： public static int rever

忽然找到一位关于此题详细介绍的大牛文章。转载之，以后常回顾一下。http://www.cnblogs.com/tenosdoit/p/3675788.html表示没学过动态规划，闲下来时候研究研究。算法4挺别出心裁，值得学习！题目链接Given a string S, find the longest palindromic substring in

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

题目：Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.翻译：找到字符串的子串位置，并返回。如果没有则返回-1思路：通过最简单的BF遍历，如果不符合则指向下一个字符，