leetcode
_海阔天空
这个作者很懒,什么都没留下…
展开
-
CODE 135: Copy List with Random Pointer
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 of the list. public RandomListNode copyRan原创 2013-11-23 18:11:06 · 638 阅读 · 0 评论 -
CODE 133: Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using ext原创 2013-11-23 16:52:37 · 564 阅读 · 0 评论 -
CODE 136: Word Break
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 example, givens = "leetcode",dict = ["leet"原创 2013-11-23 21:22:58 · 893 阅读 · 0 评论 -
CODE 137: Word Break II
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For example, givens = "原创 2013-11-24 15:50:21 · 637 阅读 · 0 评论 -
CODE 116: 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)原创 2013-11-08 21:23:19 · 457 阅读 · 0 评论 -
CODE 117: Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. public String longestCommonPrefix(String[] strs) { // Start typing your Java solution below // DO NOT wri原创 2013-11-09 22:28:32 · 654 阅读 · 0 评论 -
CODE 114: 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:Elements原创 2013-11-09 21:15:05 · 696 阅读 · 0 评论 -
CODE 118: Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999. static Map r2a = new HashMap(); static { r2a.put('I', 1); r2a.put('V', 5);原创 2013-11-10 12:19:02 · 729 阅读 · 0 评论 -
CODE 119: Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999. static List r2a = new ArrayList(); static { r2a.add(new R2A(1000, 'M')); r2a.原创 2013-11-10 14:19:44 · 526 阅读 · 0 评论 -
CODE 139: Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?点击打开链接 public ListNode detectCycle(ListNod转载 2013-11-24 22:01:49 · 600 阅读 · 0 评论 -
CODE 138: Linked List Cycle
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space? public boolean hasCycle(ListNode head) { // IMPORTANT: Please reset any原创 2013-11-24 16:07:29 · 495 阅读 · 0 评论 -
CODE 120: Container With Most Water
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). Fin原创 2013-11-10 15:54:04 · 479 阅读 · 0 评论 -
CODE 141: Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti原创 2013-11-25 22:15:33 · 469 阅读 · 0 评论 -
CODE 140: Reorder List
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 example,Given {1,2,3,4}, reorder it to {1,4原创 2013-11-25 20:37:24 · 440 阅读 · 0 评论 -
CODE 142: Binary Tree Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1]. public ArrayList pos原创 2013-11-25 22:37:26 · 463 阅读 · 0 评论 -
CODE 145: Sort List
Sort a linked list in O(n log n) time using constant space complexity. public ListNode sortList(ListNode head) { // IMPORTANT: Please reset any member data you declared, as // the same Solutio原创 2013-11-26 22:35:50 · 594 阅读 · 0 评论 -
CODE 143:LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if转载 2013-11-26 21:38:45 · 426 阅读 · 0 评论 -
CODE 123: Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before coding.原创 2013-11-12 21:24:02 · 705 阅读 · 0 评论 -
CODE 121: Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of convertin原创 2013-11-12 20:46:15 · 682 阅读 · 0 评论 -
CODE 122: String to Integer (atoi)
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 input ca原创 2013-11-12 21:04:14 · 666 阅读 · 0 评论 -
CODE 124: ZigZag Conversion
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 L S I原创 2013-11-13 22:45:29 · 561 阅读 · 0 评论 -
CODE 144: Insertion Sort List
Sort a linked list using insertion sort. public ListNode insertionSortList(ListNode head) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reus原创 2013-11-27 19:56:56 · 421 阅读 · 0 评论 -
CODE 125: Longest Palindromic Substring
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. public String lon原创 2013-11-14 20:13:23 · 662 阅读 · 0 评论 -
CODE 126: Add Two Numbers
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 link原创 2013-11-14 20:39:12 · 627 阅读 · 0 评论 -
CODE 127: Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo原创 2013-11-14 20:50:35 · 629 阅读 · 0 评论 -
CODE 146: Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. public int maxPoints(Point[] points) { // IMPORTANT: Please reset any member data you declared原创 2013-11-28 22:16:20 · 655 阅读 · 0 评论 -
CODE 147: Evaluate Reverse Polish Notation
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1", "+",原创 2013-11-28 22:23:01 · 600 阅读 · 0 评论 -
LeetCode 179. Largest Number
LeetCode 179. Largest Number给出一个非负整型列表,对列表里的整型进行排序,使得排序后将这些数字连在一起的数字最大。原创 2016-11-08 11:42:18 · 377 阅读 · 0 评论 -
LeetCode 452. Minimum Number of Arrows to Burst Balloons
LeetCode 452. Minimum Number of Arrows to Burst Balloons原创 2016-11-11 16:09:17 · 1881 阅读 · 0 评论 -
LeetCode 173. Binary Search Tree Iterator
LeetCode 173. Binary Search Tree Iterator原创 2016-11-01 14:26:41 · 341 阅读 · 0 评论 -
LeetCode 174. Dungeon Game
LeetCode 174. Dungeon Game原创 2016-11-01 14:28:04 · 452 阅读 · 0 评论 -
LeetCode 446. Arithmetic Slices II - Subsequence
LeetCode 446. Arithmetic Slices II - Subsequence原创 2016-11-17 10:13:14 · 1261 阅读 · 0 评论 -
LeetCode 456. 132 Pattern
LeetCode 456. 132 Pattern原创 2016-11-21 20:29:58 · 1411 阅读 · 1 评论 -
LeetCode 477. Total Hamming Distance
LeetCode 477. Total Hamming Distance原创 2016-12-24 14:37:11 · 714 阅读 · 0 评论