Leedcode
文章平均质量分 62
如沐春风心旷神怡
成功等于坚定的信念加上不间断的努力
展开
-
Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing togetherthe nodes of the first two lists.原创 2014-09-15 15:54:50 · 808 阅读 · 0 评论 -
Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverseorder and each of their nodes contain a single digit. Add the two numbers and return it as a lin原创 2014-09-03 17:22:38 · 452 阅读 · 0 评论 -
Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greaterthan or equal to x.You should preserve the original relative order of the nodes in each of原创 2014-09-11 13:06:18 · 510 阅读 · 0 评论 -
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,原创 2014-09-11 20:01:16 · 474 阅读 · 0 评论 -
Swap Nodes in Pairs
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 algorithm should use only constant space. You ma原创 2014-09-11 19:58:53 · 473 阅读 · 0 评论 -
Sort List
Sort List Sort a linked list in O(n log n) time using constant space complexity. 对一个链表进行排序,且时间复杂度要求为 O(n log n) ,空间复杂度为常量。一看到 O(n log n) 的排序,首先应该想到归并排序和快速排序,但是通常我们使用这两种排序方法时都是针对数组转载 2015-02-18 16:36:10 · 493 阅读 · 0 评论 -
Candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:?Each child must have at least one c原创 2014-09-01 14:44:59 · 381 阅读 · 0 评论 -
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?进阶。Given a linked list, return the node where the cycle begins. If the原创 2014-09-11 20:00:53 · 422 阅读 · 0 评论 -
Next Permutation
初阶。Implement next permutation, which rearranges numbers into the lexicographically next greater permutationof numbers.If such arrangement is not possible, it must rearrange it as the lowest poss原创 2014-08-28 16:39:52 · 426 阅读 · 0 评论 -
Rotate Image
You are given an n n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up: Could you do this in-place?分析:先按照对角线原创 2014-08-29 16:52:12 · 410 阅读 · 0 评论 -
Reverse Nodes in k-Group
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-11 20:01:34 · 1149 阅读 · 0 评论 -
Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->nullptr, m = 2 and n = 4,return 1->4->3->2->5->nullptr.Note: Given m, n satisfy the f原创 2014-09-09 16:51:53 · 599 阅读 · 0 评论 -
Longest Consecutive Sequence
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, 4原创 2014-08-26 10:03:38 · 593 阅读 · 0 评论 -
Median of Two Sorted Arrays
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sortedarrays. The overall run time complexity should be O(log(m + n)).思路。1)原创 2014-08-25 17:17:53 · 522 阅读 · 0 评论 -
Set Matrix Zeroes
Given a m n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up: Did you use extra space?A straight forward solution using O(mn) space is probably a bad idea原创 2014-08-29 17:09:20 · 576 阅读 · 0 评论 -
Gas Station
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 its原创 2014-09-01 14:07:06 · 431 阅读 · 0 评论 -
Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.原创 2014-09-26 11:21:31 · 397 阅读 · 0 评论 -
总结之排序
冒泡排序:冒泡排序主要思路是:通过交换使相邻的两个数变成小数在前大数在后,这样每次遍历后,最大的数就“沉”到最后面了。重复N次即可以使数组有序。原创 2014-11-03 17:31:46 · 588 阅读 · 0 评论 -
Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.原创 2014-10-14 13:53:02 · 537 阅读 · 0 评论 -
Binary Tree Level Order Traversal
初阶:Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level bylevel).For example: Given binary tree {3,9,20,#,#,15,7},3/ \9 20/ \15 7原创 2014-10-14 16:06:33 · 466 阅读 · 0 评论 -
count and say
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as "one 2原创 2015-01-30 15:02:43 · 446 阅读 · 0 评论 -
Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Ruleshttp://sudoku.com.au/TheRules.aspx .The Sudoku board could be partially filled, where empty cells are filled with the charac原创 2014-08-28 17:00:41 · 489 阅读 · 0 评论 -
Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note: You may assume that A has enough space to hold additional elements from B. The number ofelements initialized in A原创 2014-09-15 15:52:29 · 407 阅读 · 0 评论 -
总结之字符串
1.Valid Palindromehttp://blog.csdn.net/chencheng126/article/details/395229432.Implement strStr()http://blog.csdn.net/chencheng126/article/details/395230153.String to Integer (atoi)原创 2015-01-30 16:32:55 · 485 阅读 · 0 评论 -
Remove Nth Node From End of List
Given a linked list, remove the nthnode 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 the end, the linked li原创 2014-09-11 19:58:01 · 1325 阅读 · 0 评论 -
Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3 But the原创 2014-10-23 11:02:36 · 608 阅读 · 0 评论 -
Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum lengthof S is 1000, and there exists one unique longest palindromic substring.思路。1)动态规划。原创 2014-09-26 08:47:35 · 406 阅读 · 0 评论 -
Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?思路。f(n)表示爬到n层楼梯的原创 2014-08-29 16:54:04 · 465 阅读 · 0 评论 -
Search in Rotated Sorted Array
初阶。Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return原创 2014-08-25 16:47:27 · 430 阅读 · 0 评论 -
Remove Duplicates from Sorted Array
描述Given a sorted array, remove the duplicates in place such that each element appear only onceand return the new length.Do not allocate extra space for another array, you must do this in place w原创 2014-08-25 15:59:42 · 436 阅读 · 0 评论 -
总结之树
树有很多中,包括二叉树,平衡二叉树,查找二叉树,完全二叉树,原创 2014-10-22 00:07:58 · 699 阅读 · 0 评论 -
总结之链表
链表的基本操作:这里的head节点实际是一个dummy节点,第一个节点是从head->next开始的。这也是处理链表一个非常有效的方法。这里的操作包括:创建空链表,建立链表(头插入,尾插入),找前驱节点,增加一个节点(节点之前/之后),第K个元素之前(之后)插入新节点,删除节点,链表reverse(头结点插入,产生一个新链表),链表reverse(不产生新链表),链表的显示,链表的摧毁原创 2015-02-10 11:19:17 · 646 阅读 · 0 评论 -
总结之数组
1.Remove Duplicates from Sorted Arrayhttp://blog.csdn.net/chencheng126/article/details/388210832.Search in Rotated Sorted Array二分查找的进阶,不错的题。在二分查找前,先要确定一下哪一部分是有序数组。http://blog.csdn.net/ch原创 2015-02-02 11:22:02 · 562 阅读 · 0 评论 -
总结之栈和队列
栈在实际上有很多应用,比如说语法检查,判断平衡符号,函数的调用等等。下面写了两个栈使用的例子。1.Valid parenheses.http://blog.csdn.net/chencheng126/article/details/401071092.Longest valid parentheses.http://blog.csdn.net/chencheng126/原创 2015-01-23 14:26:14 · 461 阅读 · 0 评论 -
Lowest Commen Ancensor
#include using namespace std;struct TreeNode{ int data; TreeNode *left; TreeNode *right; TreeNode(int x):data(x),left(NULL),right(NULL) {}};//在二叉树中找最近公共祖先class solution{public: //check原创 2014-10-26 10:27:22 · 534 阅读 · 0 评论 -
Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note: AsolutionusingO(n)spaceisprettystraightforward. Couldyoudeviseaconstantspace原创 2014-10-21 23:21:18 · 426 阅读 · 0 评论 -
各种排序
#include using namespace std;class Solution{public: //冒泡排序 //比较相邻的两个元素,如果前面大于后面,则交换,每一轮过后,最大的那个数就放到了最后一个 //优化1:如果没有发生变化,那么证明已经是排好序了,则不需要再继续下一轮 //优化2:如果有100个数的数组,仅前面10个无序,后面90个都已排好序且都大于前面10个数字。原创 2014-09-18 12:57:30 · 423 阅读 · 0 评论 -
Valid Parentheses
Given a string containing just the characters ’(’, ’)’, ’{’, ’}’, ’[’ and ’]’, determine if theinput string is valid.The brackets must close in the correct order, ”()” and ”()[]” are all valid but原创 2014-10-15 10:05:41 · 455 阅读 · 0 评论 -
Integer to Roman
初阶。Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.进阶。Roman to IntegerGiven a roman numeral, convert it to an integer.Inpu原创 2014-09-26 14:22:32 · 332 阅读 · 0 评论 -
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原创 2014-09-01 14:54:13 · 424 阅读 · 0 评论