Voidsky

我现在在做一个叫《leetbook》的开源书项目，把解题思路都同步更新到github上了，需要的同学可以去看看 地址：https://github.com/hk029/leetcode 这个是书的地址： https://hk029.gitbooks.io/leetbook/ 20. Valid Parentheses 问题Given a string containi

19. Remove Nth Node From End of List 问题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

018. 4Sum 问题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: Eleme

017. Letter Combinations of a Phone Number[M]问题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 bu

16. 3Sum Closest [M]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

015. 3Sum问题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 triplet (a,b,c

我现在在做一个叫《leetbook》的开源书项目，把解题思路都同步更新到github上了，需要的同学可以去看看 地址：https://github.com/hk029/leetcode 这个是书的地址：https://hk029.gitbooks.io/leetbook/ 014.Longest Common Prefix[E]问题Write a function to find

013. Roman to Integer问题Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Subscribe to see which companies asked this question思路首先要知道罗马数字的规律：

012. Integer to Roman[M]012. Integer to Roman[M]问题Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.

问题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 two l

010. Regular Expression Matching这里面最复杂的操作是"*"，这是个很可恶的操作，因为你永远不知道它多长。但是有一点，"*"不会单独出现，它一定是和前面一个字母或"."配成一对。看成一对后"X*"，它的性质就是：要不匹配0个，要不匹配连续的“X”题目的关键就是如何把这一对放到适合的位置。

009. Palindrome Number[E]Palindrome NumberE问题思路思路1思路2问题：Determine whether an integer is a palindrome. Do this without extra space.思路这里说不用额外的空间意思是不用O(n)的空间，O(1)的还是可以用的，不然循环都不好写。。思路1简单的思路 就是把数字逆转，然

008. String to Integer (atoi) [E]String to Integer atoi E题目思路代码题目Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please d

007. Reverse Integer[E]——处理溢出的技巧Reverse IntegerE处理溢出的技巧题目思路思路1用long思路2变化前后对比思路3提前停止操作题目Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321思路这题完全没丝毫的难度，任何人

006.ZigZag Conversion[E]ZigZag ConversionE题目思路1用字符串数组思路2观察规律题目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

005.Longest Palindromic [M]Longest Palindromic M题目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 long

004. Median of Two Sorted Arrays[H]Median of Two Sorted ArraysH题目分析思路1思路2预备知识先解释下割双数组找第k个元素我们看如何从双数组里取出第k个元素假设k3双数组的奇偶让数组恒为奇数映射关系在虚拟数组里表示割分治的思路怎么分怎么治越界问题代码题目There are two sorted array

003. Longest Substring Without Repeating Characters[M]题目：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating lett

leetcode 详细笔记2.Add Two Numbers [M]1.题目：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain

leetcode笔记1.Two Sum[E]Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have e