无他,唯手熟尔!

Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically

一,题目Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant m

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

一,题目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:[ "((()))", "(()())", "(())()",

一,题目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.二,代码public ListNode mergeTwoLists(ListNode

一,题目Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" ar

一,题目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 th

一,题目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 ha

一,题目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: The solution set must n

1，题目： 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 exactly one solution.Example: Given nums = [

一,题目Write a function to find the longest common prefix string amongst an array of strings.二,思路使用StringBuffer存储相同的前缀.使用暴力枚举的办法,每次取出一个字符串,然后都与第一个字符串的相同位置字符比较.相同则继续,否则返回StringBuffer存储的内容三,代

一,题目Determine whether an integer is a palindrome. Do this without extra space.二,思路和整数翻转一样注意:负数都不是回文三,代码public boolean isPalindrome(int x) { if (x < 0) { return false;

一,题目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 inpu

一，题目You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a l

一,题目Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321二,思路用一个变量记录转换的值每次模10取得最低位,记录的变量值乘以10然后加上这个最低位这个数字再除以10三,代码public int reverse(

一，题目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.二，思路

一，题目Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the a

一,题目Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring i