leetcode
文章平均质量分 69
hachyli
这个作者很懒,什么都没留下…
展开
-
First Missing Positive leetcode
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 should run in O(n) time and uses constant原创 2014-09-10 20:16:27 · 362 阅读 · 0 评论 -
Merge k Sorted Lists leetcode
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.原创 2014-09-22 21:54:29 · 464 阅读 · 0 评论 -
Best Time to Buy and Sell Stock III leetcode
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You ma原创 2014-09-11 15:24:45 · 396 阅读 · 0 评论 -
Palindrome Number leetcode
Determine whether an integer is a palindrome. Do this without extra space.题意判断数字是否是回文串,只能用常数空间,不能转换成字符串,不能反转数字。先计算数字的位数,分别通过除法和取余,提取出要对比的对应数字。原创 2014-08-15 16:34:07 · 320 阅读 · 0 评论 -
Edit Distance leetcode
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:原创 2014-08-27 20:50:45 · 432 阅读 · 0 评论 -
Trapping Rain Water leetcode
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.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]原创 2014-08-15 17:12:27 · 294 阅读 · 0 评论 -
Clone Graph leetcode
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.原创 2014-09-10 16:40:15 · 358 阅读 · 0 评论 -
Scramble String leetcode
https://oj.leetcode.com/problems/scramble-string/原创 2014-09-10 19:39:54 · 623 阅读 · 0 评论 -
Gas Station leetcode
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to原创 2014-08-27 08:48:17 · 414 阅读 · 0 评论 -
Sum Root to Leaf Numbers leetcode
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 which represents the number 123.Find the tota原创 2014-08-13 08:10:16 · 261 阅读 · 0 评论 -
Maximum Depth of Binary Tree leetcode
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 leaf node.Anwser 1 : DFSclass Solut原创 2014-08-13 09:06:32 · 367 阅读 · 0 评论 -
Combinations
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:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]原创 2014-08-12 20:42:44 · 282 阅读 · 0 评论 -
Palindrome Partitioning I and II leetcode
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ ["aa","原创 2014-08-26 19:38:15 · 354 阅读 · 0 评论 -
Permutation Sequence leetcode
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3原创 2014-09-12 10:51:44 · 367 阅读 · 0 评论 -
Flatten Binary Tree to Linked List leetcode
Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1原创 2014-08-16 19:21:18 · 322 阅读 · 0 评论 -
Longest Substring Without Repeating Characters leetcode
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原创 2014-09-11 16:13:08 · 363 阅读 · 0 评论 -
Implement strStr() leetcode
Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.原创 2014-09-17 23:56:04 · 322 阅读 · 0 评论 -
Rotate List leetcode
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.原创 2014-09-17 19:59:41 · 341 阅读 · 0 评论 -
Sort List leetcode
Sort a linked list in O(n log n) time using constant space complexity.原创 2014-09-02 14:16:45 · 291 阅读 · 0 评论 -
Word Break leetcode
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"原创 2014-09-03 09:00:24 · 377 阅读 · 0 评论 -
Reorder List leetcode
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原创 2014-09-02 19:31:00 · 427 阅读 · 0 评论 -
Reverse Nodes in k-Group leetcode
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is原创 2014-09-01 22:01:16 · 367 阅读 · 0 评论 -
LRU Cache leetcode
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原创 2014-09-02 17:06:20 · 349 阅读 · 0 评论 -
Distinct Subsequences leetcode
Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be non原创 2014-09-01 20:11:14 · 290 阅读 · 0 评论 -
Subsets leetcode
Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For exa原创 2014-08-18 20:05:00 · 460 阅读 · 0 评论 -
Valid Sudoku and Sudoku Solver leetcode
Valid Sudoku原创 2014-08-18 21:53:02 · 411 阅读 · 0 评论 -
Longest Consecutive Sequence leetcode
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3原创 2014-08-18 13:04:18 · 437 阅读 · 0 评论 -
Sqrt(x) leetcode
Implement int sqrt(int x).Compute and return the square root of x.原创 2014-09-11 16:33:46 · 375 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node II leetcode
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.Initially, all next pointers are set to NULL.What if the given原创 2014-08-12 19:19:47 · 291 阅读 · 0 评论 -
ZigZag Conversion leetcode
he 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 I原创 2014-09-09 12:31:16 · 366 阅读 · 0 评论 -
leetcode Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A straight forward solution using O(m原创 2014-08-04 14:24:56 · 462 阅读 · 0 评论 -
leetcode Plus One
刚开始看这道题的时候,都没看懂,(⊙﹏⊙b汗)后来明白:原创 2014-07-29 17:14:16 · 370 阅读 · 0 评论 -
leetcode Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers原创 2014-07-29 16:04:48 · 344 阅读 · 0 评论 -
leetcode Gray Code 格雷码
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 number of bits in the code, print the sequence of原创 2014-07-29 15:14:48 · 368 阅读 · 0 评论 -
Single Number II leetcode
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi原创 2014-07-25 18:57:15 · 399 阅读 · 0 评论 -
LeetCode Unique Binary Search Trees--动态规划思想
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \原创 2014-07-23 19:10:00 · 493 阅读 · 0 评论 -
leetcode Maximum Depth of Binary Tree 非递归算法
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 leaf node./** * Definition for binary tree原创 2014-07-29 15:06:19 · 550 阅读 · 0 评论 -
leetcode Balanced Binary Tree 后序遍历思想避免重复遍历结点
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 depth of the two subtrees of every node never diffe原创 2014-07-29 15:15:10 · 451 阅读 · 0 评论 -
leetcode 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?/** * Definition for singly-linked list. * struct ListNode { * int val; *原创 2014-07-29 15:08:22 · 364 阅读 · 0 评论 -
leetcode Linked List Cycle II 单链表中的环问题集锦
Linked List CycleGiven a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?如何判断一个单链表中有环?Linked List Cycle IIGiven a linked list,原创 2014-08-02 08:31:20 · 551 阅读 · 1 评论