随笔分类 -  leedcode

上一页 1 ··· 6 7 8 9 10 11 12 下一页
摘要:Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.For"(()", the longest... 阅读全文
posted @ 2015-07-09 16:59 ~每天进步一点点~ 阅读(102) 评论(0) 推荐(0)
摘要:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possibl... 阅读全文
posted @ 2015-07-09 15:59 ~每天进步一点点~ 阅读(136) 评论(0) 推荐(0)
摘要:You are given a string,s, and a list of words,words, that are all of the same length. Find all starting indices of substring(s) insthat is a concatena... 阅读全文
posted @ 2015-07-09 14:13 ~每天进步一点点~ 阅读(169) 评论(0) 推荐(0)
摘要:Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INTpublic class Solution { //本题很多细节需要考虑: ... 阅读全文
posted @ 2015-07-08 22:57 ~每天进步一点点~ 阅读(179) 评论(0) 推荐(0)
摘要:Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.public class Solution { ... 阅读全文
posted @ 2015-07-08 21:58 ~每天进步一点点~ 阅读(129) 评论(0) 推荐(0)
摘要: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 mat... 阅读全文
posted @ 2015-07-08 21:24 ~每天进步一点点~ 阅读(144) 评论(0) 推荐(0)
摘要:Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not allocate extra space for a... 阅读全文
posted @ 2015-07-08 21:06 ~每天进步一点点~ 阅读(95) 评论(0) 推荐(0)
摘要:Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o... 阅读全文
posted @ 2015-07-08 18:11 ~每天进步一点点~ 阅读(200) 评论(0) 推荐(0)
摘要:Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
posted @ 2015-07-08 13:55 ~每天进步一点点~ 阅读(132) 评论(0) 推荐(0)
摘要:public class Solution { //卡特兰数,一共有C2n^n-C2n^n-1种组合数 //本题的递归非常经典,需要多看牢记 List res; StringBuilder seq; public List generateParenthesis(int... 阅读全文
posted @ 2015-07-07 22:52 ~每天进步一点点~ 阅读(117) 评论(0) 推荐(0)
摘要:/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public... 阅读全文
posted @ 2015-07-07 22:19 ~每天进步一点点~ 阅读(190) 评论(0) 推荐(0)
摘要:/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public... 阅读全文
posted @ 2015-07-07 18:25 ~每天进步一点点~ 阅读(144) 评论(0) 推荐(0)
摘要:Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must close in the correct ... 阅读全文
posted @ 2015-07-07 17:51 ~每天进步一点点~ 阅读(107) 评论(0) 推荐(0)
摘要:Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re... 阅读全文
posted @ 2015-07-07 15:39 ~每天进步一点点~ 阅读(85) 评论(0) 推荐(0)
摘要:Given an arraySofnintegers, are there elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in the array which gives the sum of ... 阅读全文
posted @ 2015-07-07 15:14 ~每天进步一点点~ 阅读(129) 评论(0) 推荐(0)
摘要:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon... 阅读全文
posted @ 2015-07-07 13:36 ~每天进步一点点~ 阅读(136) 评论(0) 推荐(0)
摘要:Given an arraySofnintegers, find three integers inSsuch that the sum is closest to a given number, target. Return the sum of the three integers. You m... 阅读全文
posted @ 2015-07-07 11:27 ~每天进步一点点~ 阅读(165) 评论(0) 推荐(0)
摘要:public class Solution { public List> threeSum(int[] nums) { //本题需要对重复数字进行考虑,主要涉及以下几处: //1.外层循环时,需要与前一个数进行比较,如果重复,使用 if 和continue ... 阅读全文
posted @ 2015-07-06 22:56 ~每天进步一点点~ 阅读(190) 评论(0) 推荐(0)
摘要:public class Solution { public String longestCommonPrefix(String[] strs) { //求公共子序列,公共子序列必须是str[0]的子串,因此本题是将每一个字符串按位和第一个字符串的每一位进行比较 /... 阅读全文
posted @ 2015-07-06 22:03 ~每天进步一点点~ 阅读(116) 评论(0) 推荐(0)
摘要:public class Solution { public int maxArea(int[] height) { /* 题意:二维坐标系里有 n 个点 (i, ai), ai >= 0,从 (i, ai)到(i, 0)划竖线,共有 n 条竖线。 找出两条竖线,使得... 阅读全文
posted @ 2015-07-06 21:15 ~每天进步一点点~ 阅读(114) 评论(0) 推荐(0)

上一页 1 ··· 6 7 8 9 10 11 12 下一页