09 2016 档案

摘要:buy and sell stocks 在leetcode现在总共有5 道题。 Best Time to Buy and Sell Stock 这道题是基础,只能transaction一次,所以我们用 Best Time to Buy and Sell Stock II 这道题表示可以一直trans 阅读全文
posted @ 2016-09-27 12:56 咖啡中不塌缩的方糖 阅读(169) 评论(0) 推荐(0) 编辑
摘要:Find the sum of all left leaves in a given binary tree. Example: Iteration: 阅读全文
posted @ 2016-09-27 03:26 咖啡中不塌缩的方糖 阅读(164) 评论(0) 推荐(0) 编辑
摘要:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S = "ADOBECOD 阅读全文
posted @ 2016-09-27 03:02 咖啡中不塌缩的方糖 阅读(172) 评论(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) in s that is a conca 阅读全文
posted @ 2016-09-26 23:27 咖啡中不塌缩的方糖 阅读(127) 评论(0) 推荐(0) 编辑
摘要:Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the conditionnums[i] + 阅读全文
posted @ 2016-09-26 07:55 咖啡中不塌缩的方糖 阅读(110) 评论(0) 推荐(0) 编辑
摘要:Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the 阅读全文
posted @ 2016-09-26 01:22 咖啡中不塌缩的方糖 阅读(110) 评论(0) 推荐(0) 编辑
摘要:Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 阅读全文
posted @ 2016-09-26 01:21 咖啡中不塌缩的方糖 阅读(126) 评论(0) 推荐(0) 编辑
摘要: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 endpo 阅读全文
posted @ 2016-09-26 00:12 咖啡中不塌缩的方糖 阅读(107) 评论(0) 推荐(0) 编辑
摘要:Given a sorted array of integers nums and integer values a, b and c. Apply a function of the form f(x) = ax2 + bx + c to each element x in the array. 阅读全文
posted @ 2016-09-25 06:28 咖啡中不塌缩的方糖 阅读(168) 评论(0) 推荐(0) 编辑
摘要: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. 阅读全文
posted @ 2016-09-25 05:55 咖啡中不塌缩的方糖 阅读(114) 评论(0) 推荐(0) 编辑
摘要:Write a function that takes a string as input and reverse only the vowels of a string. Example 1:Given s = "hello", return "holle". Example 2:Given s 阅读全文
posted @ 2016-09-25 03:38 咖啡中不塌缩的方糖 阅读(120) 评论(0) 推荐(0) 编辑
摘要:Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. Note: Each elemen 阅读全文
posted @ 2016-09-25 03:13 咖啡中不塌缩的方糖 阅读(104) 评论(0) 推荐(0) 编辑
摘要: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 阅读全文
posted @ 2016-09-25 03:05 咖啡中不塌缩的方糖 阅读(86) 评论(0) 推荐(0) 编辑
摘要:Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, giv 阅读全文
posted @ 2016-09-25 02:41 咖啡中不塌缩的方糖 阅读(133) 评论(0) 推荐(0) 编辑
摘要:Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element i 阅读全文
posted @ 2016-09-25 02:35 咖啡中不塌缩的方糖 阅读(219) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it up 阅读全文
posted @ 2016-09-24 22:19 咖啡中不塌缩的方糖 阅读(120) 评论(0) 推荐(0) 编辑
摘要:Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assum 阅读全文
posted @ 2016-09-24 11:22 咖啡中不塌缩的方糖 阅读(107) 评论(0) 推荐(0) 编辑
摘要:There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every 阅读全文
posted @ 2016-09-24 09:31 咖啡中不塌缩的方糖 阅读(108) 评论(0) 推荐(0) 编辑
摘要:Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list -- w 阅读全文
posted @ 2016-09-24 05:49 咖啡中不塌缩的方糖 阅读(125) 评论(0) 推荐(0) 编辑
摘要:Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list -- w 阅读全文
posted @ 2016-09-24 05:02 咖啡中不塌缩的方糖 阅读(99) 评论(0) 推荐(0) 编辑
摘要:Given an unsorted integer array, find the first missing positive integer. For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2. Your algorithm s 阅读全文
posted @ 2016-09-23 11:09 咖啡中不塌缩的方糖 阅读(136) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example:Given bi 阅读全文
posted @ 2016-09-23 05:16 咖啡中不塌缩的方糖 阅读(516) 评论(0) 推荐(0) 编辑
摘要:Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. 阅读全文
posted @ 2016-09-23 03:41 咖啡中不塌缩的方糖 阅读(159) 评论(0) 推荐(0) 编辑
摘要:Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in 阅读全文
posted @ 2016-09-23 02:32 咖啡中不塌缩的方糖 阅读(120) 评论(0) 推荐(0) 编辑
摘要:278 First Bad Version23.7%Easy 278. First Bad Version 349 Intersection of Two Arrays44.5%Easy 374 Guess Number Higher or Lower32.2%Easy 350 Intersecti 阅读全文
posted @ 2016-09-22 05:09 咖啡中不塌缩的方糖 阅读(100) 评论(0) 推荐(0) 编辑
摘要:Implement pow(x, n). 阅读全文
posted @ 2016-09-22 05:08 咖啡中不塌缩的方糖 阅读(104) 评论(0) 推荐(0) 编辑
摘要:You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c 阅读全文
posted @ 2016-09-22 04:42 咖啡中不塌缩的方糖 阅读(95) 评论(0) 推荐(0) 编辑
摘要:Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e.words[i] + 阅读全文
posted @ 2016-09-22 04:18 咖啡中不塌缩的方糖 阅读(97) 评论(0) 推荐(0) 编辑
摘要:Implement Trie (Prefix Tree) 208. Implement Trie (Prefix Tree) Add and Search Word - Data structure design 211. Add and Search Word - Data structure design Word Search II 212. Word Search ... 阅读全文
posted @ 2016-09-22 03:07 咖啡中不塌缩的方糖 阅读(102) 评论(0) 推荐(0) 编辑
摘要:Given a 2D board and a list of words from the dictionary, find all words in the board. Each word must be constructed from letters of sequentially adja 阅读全文
posted @ 2016-09-22 01:25 咖啡中不塌缩的方糖 阅读(151) 评论(0) 推荐(0) 编辑
摘要:Design a data structure that supports the following two operations: search(word) can search a literal word or a regular expression string containing o 阅读全文
posted @ 2016-09-21 23:49 咖啡中不塌缩的方糖 阅读(488) 评论(0) 推荐(0) 编辑
摘要:Implement a trie with insert, search, and startsWith methods. Note:You may assume that all inputs are consist of lowercase letters a-z. 阅读全文
posted @ 2016-09-21 23:19 咖啡中不塌缩的方糖 阅读(198) 评论(0) 推荐(0) 编辑
摘要:Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example,Given:s1 = "aabcc",s2 = "dbbca", When s3 = "aadbbcbcac", ret 阅读全文
posted @ 2016-09-21 02:34 咖啡中不塌缩的方糖 阅读(131) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the sam 阅读全文
posted @ 2016-09-20 15:40 咖啡中不塌缩的方糖 阅读(127) 评论(0) 推荐(0) 编辑
摘要:There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach 阅读全文
posted @ 2016-09-20 14:58 咖啡中不塌缩的方糖 阅读(197) 评论(0) 推荐(0) 编辑
摘要:A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59). Each LED represents 阅读全文
posted @ 2016-09-19 06:02 咖啡中不塌缩的方糖 阅读(374) 评论(0) 推荐(0) 编辑
摘要:Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is: 阅读全文
posted @ 2016-09-17 06:18 咖啡中不塌缩的方糖 阅读(123) 评论(0) 推荐(0) 编辑
摘要:The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total num 阅读全文
posted @ 2016-09-17 05:46 咖啡中不塌缩的方糖 阅读(141) 评论(0) 推荐(0) 编辑
摘要:Write a function to generate the generalized abbreviations of a word. Example: Given word = "word", return the following list (order does not matter): 阅读全文
posted @ 2016-09-17 05:18 咖啡中不塌缩的方糖 阅读(161) 评论(0) 推荐(0) 编辑
摘要:Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example,If nums =  阅读全文
posted @ 2016-09-16 12:02 咖啡中不塌缩的方糖 阅读(128) 评论(0) 推荐(0) 编辑
摘要:Numbers can be regarded as product of its factors. For example, Write a function that takes an integer n and return all possible combinations of its f 阅读全文
posted @ 2016-09-16 11:49 咖啡中不塌缩的方糖 阅读(108) 评论(0) 推荐(0) 编辑
摘要:Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form 阅读全文
posted @ 2016-09-16 10:29 咖啡中不塌缩的方糖 阅读(191) 评论(0) 推荐(0) 编辑
摘要:Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For exampl 阅读全文
posted @ 2016-09-16 09:20 咖啡中不塌缩的方糖 阅读(98) 评论(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 telepho 阅读全文
posted @ 2016-09-16 09:07 咖啡中不塌缩的方糖 阅读(200) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文
posted @ 2016-09-15 23:42 咖啡中不塌缩的方糖 阅读(101) 评论(0) 推荐(0) 编辑
摘要:Implement an iterator to flatten a 2d vector. For example,Given 2d vector = By calling next repeatedly until hasNext returns false, the order of eleme 阅读全文
posted @ 2016-09-15 23:10 咖啡中不塌缩的方糖 阅读(133) 评论(0) 推荐(0) 编辑
摘要:Given an encoded string, return it's decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is b 阅读全文
posted @ 2016-09-15 12:53 咖啡中不塌缩的方糖 阅读(326) 评论(0) 推荐(0) 编辑
摘要:Given a non-empty array of integers, return the k most frequent elements. For example,Given [1,1,1,2,2,3] and k = 2, return [1,2]. Note: You may assum 阅读全文
posted @ 2016-09-15 05:42 咖啡中不塌缩的方糖 阅读(208) 评论(0) 推荐(0) 编辑
摘要:Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Remov 阅读全文
posted @ 2016-09-15 05:13 咖啡中不塌缩的方糖 阅读(170) 评论(0) 推荐(0) 编辑
摘要:Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For 阅读全文
posted @ 2016-09-15 04:26 咖啡中不塌缩的方糖 阅读(137) 评论(0) 推荐(0) 编辑
摘要:Given a positive integer num, write a function which returns True if num is a perfect square else False. Note: Do not use any built-in library functio 阅读全文
posted @ 2016-09-15 03:22 咖啡中不塌缩的方糖 阅读(459) 评论(0) 推荐(0) 编辑
摘要:Validate if a given string is numeric. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => true Note: It is intended for the 阅读全文
posted @ 2016-09-15 02:26 咖啡中不塌缩的方糖 阅读(136) 评论(0) 推荐(0) 编辑
摘要: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 阅读全文
posted @ 2016-09-14 23:32 咖啡中不塌缩的方糖 阅读(115) 评论(0) 推荐(0) 编辑
摘要:Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence frombeginWord to endWord, s 阅读全文
posted @ 2016-09-14 23:03 咖啡中不塌缩的方糖 阅读(169) 评论(0) 推荐(0) 编辑
摘要:Given an input string, reverse the string word by word. A word is defined as a sequence of non-space characters. The input string does not contain lea 阅读全文
posted @ 2016-09-14 13:22 咖啡中不塌缩的方糖 阅读(107) 评论(0) 推荐(0) 编辑
摘要:Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function 阅读全文
posted @ 2016-09-14 12:56 咖啡中不塌缩的方糖 阅读(114) 评论(0) 推荐(0) 编辑
摘要:Description: Count the number of prime numbers less than a non-negative number, n. 埃拉托斯特尼筛法 阅读全文
posted @ 2016-09-14 05:52 咖啡中不塌缩的方糖 阅读(102) 评论(0) 推荐(0) 编辑
摘要:Given an array of integers A and let n to be its length. Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a 阅读全文
posted @ 2016-09-14 05:45 咖啡中不塌缩的方糖 阅读(272) 评论(0) 推荐(0) 编辑
摘要:Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the 阅读全文
posted @ 2016-09-14 04:23 咖啡中不塌缩的方糖 阅读(93) 评论(0) 推荐(0) 编辑
摘要:Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. BST 阅读全文
posted @ 2016-09-14 03:58 咖啡中不塌缩的方糖 阅读(91) 评论(0) 推荐(0) 编辑
摘要:Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. For 阅读全文
posted @ 2016-09-14 03:12 咖啡中不塌缩的方糖 阅读(95) 评论(0) 推荐(0) 编辑
摘要: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 a 阅读全文
posted @ 2016-09-14 00:00 咖啡中不塌缩的方糖 阅读(152) 评论(0) 推荐(0) 编辑
摘要:Sort a linked list using insertion sort. public ListNode InsertionSortList(ListNode head) { if(head == null || head.next == null) return head; ListNod 阅读全文
posted @ 2016-09-13 12:57 咖啡中不塌缩的方糖 阅读(109) 评论(0) 推荐(0) 编辑
摘要:Given a singly linked list, determine if it is a palindrome. Follow up:Could you do it in O(n) time and O(1) space? 先用2 pointer查找到中间点,然后后半部分reverse, 最 阅读全文
posted @ 2016-09-13 11:52 咖啡中不塌缩的方糖 阅读(108) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up:Can you 阅读全文
posted @ 2016-09-13 11:43 咖啡中不塌缩的方糖 阅读(152) 评论(0) 推荐(0) 编辑
摘要:A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy 阅读全文
posted @ 2016-09-13 11:13 咖啡中不塌缩的方糖 阅读(150) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, remove the nth node from the end of list and return its head. For example, Note:Given n will always be valid.Try to do this in on 阅读全文
posted @ 2016-09-13 10:35 咖啡中不塌缩的方糖 阅读(129) 评论(0) 推荐(0) 编辑
摘要:Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: begin to in 阅读全文
posted @ 2016-09-13 09:49 咖啡中不塌缩的方糖 阅读(144) 评论(0) 推荐(0) 编辑
摘要:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 最简单的思路是利用之前Merge 2 sorted Lists, 逐个相加,但是这种的时间复杂度会更高 阅读全文
posted @ 2016-09-13 09:36 咖啡中不塌缩的方糖 阅读(119) 评论(0) 推荐(0) 编辑
摘要:Sort a linked list in O(n log n) time using constant space complexity. O(n lg n) constant space的常见sort方法有 merge sort, quick sort, heap sort。 quick sor 阅读全文
posted @ 2016-09-13 09:20 咖啡中不塌缩的方糖 阅读(109) 评论(0) 推荐(0) 编辑
摘要:Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 - 阅读全文
posted @ 2016-09-13 08:46 咖啡中不塌缩的方糖 阅读(80) 评论(0) 推荐(0) 编辑
摘要:Reverse a singly linked list. 解法: linked list 最典型的题型之一。 思路相同,也可以不用哨兵: 阅读全文
posted @ 2016-09-13 08:40 咖啡中不塌缩的方糖 阅读(104) 评论(0) 推荐(0) 编辑
摘要:Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in 阅读全文
posted @ 2016-09-12 07:19 咖啡中不塌缩的方糖 阅读(128) 评论(0) 推荐(0) 编辑
摘要:You are given a m x n 2D grid initialized with these three possible values. Fill each empty room with the distance to its nearest gate. If it is impos 阅读全文
posted @ 2016-09-12 01:06 咖啡中不塌缩的方糖 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen 阅读全文
posted @ 2016-09-12 00:29 咖啡中不塌缩的方糖 阅读(138) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: All root-to-leaf paths are: 阅读全文
posted @ 2016-09-11 23:55 咖啡中不塌缩的方糖 阅读(98) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum 阅读全文
posted @ 2016-09-11 23:39 咖啡中不塌缩的方糖 阅读(116) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F 阅读全文
posted @ 2016-09-11 23:18 咖啡中不塌缩的方糖 阅读(109) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept 阅读全文
posted @ 2016-09-11 23:08 咖啡中不塌缩的方糖 阅读(176) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2016-09-11 22:29 咖啡中不塌缩的方糖 阅读(98) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2016-09-11 22:28 咖啡中不塌缩的方糖 阅读(88) 评论(0) 推荐(0) 编辑
摘要:Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. 阅读全文
posted @ 2016-09-11 12:07 咖啡中不塌缩的方糖 阅读(199) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [3,2,1]. Note: Recursive sol 阅读全文
posted @ 2016-09-11 07:28 咖啡中不塌缩的方糖 阅读(110) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return the preorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [1,2,3]. Note: Recursive solu 阅读全文
posted @ 2016-09-11 06:34 咖啡中不塌缩的方糖 阅读(106) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. Note: Re 阅读全文
posted @ 2016-09-11 06:17 咖啡中不塌缩的方糖 阅读(135) 评论(0) 推荐(0) 编辑
摘要:Given an absolute path for a file (Unix-style), simplify it. For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c" path = "/a/./b/. 阅读全文
posted @ 2016-09-11 05:29 咖啡中不塌缩的方糖 阅读(125) 评论(0) 推荐(0) 编辑
摘要:Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another e 阅读全文
posted @ 2016-09-11 04:36 咖啡中不塌缩的方糖 阅读(131) 评论(0) 推荐(0) 编辑
摘要:Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the 阅读全文
posted @ 2016-09-09 11:55 咖啡中不塌缩的方糖 阅读(104) 评论(0) 推荐(0) 编辑
摘要: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 阅读全文
posted @ 2016-09-09 10:25 咖啡中不塌缩的方糖 阅读(104) 评论(0) 推荐(0) 编辑
摘要: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. Recursiv 阅读全文
posted @ 2016-09-08 23:37 咖啡中不塌缩的方糖 阅读(130) 评论(0) 推荐(0) 编辑
摘要:Given a singly linked list, determine if it is a palindrome. Follow up:Could you do it in O(n) time and O(1) space? if use space O(1), we need to use 阅读全文
posted @ 2016-09-08 22:38 咖啡中不塌缩的方糖 阅读(96) 评论(0) 推荐(0) 编辑
摘要:Remove all elements from a linked list of integers that have value val. ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 -- 阅读全文
posted @ 2016-09-08 12:25 咖啡中不塌缩的方糖 阅读(103) 评论(0) 推荐(0) 编辑
摘要:Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, 阅读全文
posted @ 2016-09-08 12:00 咖啡中不塌缩的方糖 阅读(97) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? 典型的2 pointer 问题,一个走的快,一个走到慢,如果是cycle就一定会 阅读全文
posted @ 2016-09-08 11:15 咖啡中不塌缩的方糖 阅读(99) 评论(0) 推荐(0) 编辑