leetcode
文章平均质量分 71
ZhikangFu
这个作者很懒,什么都没留下…
展开
-
leetcode难度及面试频率
1Two Sum25arraysort setTwo Pointers2Add Two Numbers34linked listTwo Pointers转载 2015-08-21 17:01:10 · 390 阅读 · 0 评论 -
2.2.2Reverse Linked ListII
Notes: 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->NULL, m = 2 and n = 4, return 1->4->3->2->5原创 2015-05-25 14:20:17 · 326 阅读 · 0 评论 -
5.4.7 Sum Root to Leaf Numbers
Notes: 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原创 2015-06-09 13:42:07 · 404 阅读 · 0 评论 -
5.3.4 Convert Sorted Array to Binary Searh Tree
Notes: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. Solution: Recursion. *//** * Definition for binary tree * struct TreeNode { * int v原创 2015-06-09 15:49:29 · 380 阅读 · 0 评论 -
5.3.1 Unique Binary Sear Trees
Notes: 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.原创 2015-06-09 14:13:14 · 298 阅读 · 0 评论 -
6.1 Merge Sorted Array
Notes: 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.原创 2015-06-09 18:25:02 · 389 阅读 · 0 评论 -
5.3.5 Convert Sorted List to Binary Sear Tree
Notes: Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. Solution: 1. Recursion. Pre-order. A very good Idea.原创 2015-06-09 18:03:31 · 552 阅读 · 0 评论 -
5.3.3 Validate Binary Searh Tree
Notes: Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only nodes with k原创 2015-06-09 15:14:34 · 361 阅读 · 0 评论 -
5.1.10 Populating Next Right Pointers in Each Node II
Notes: Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution still work? Note原创 2015-06-05 16:49:49 · 84 阅读 · 0 评论 -
5.1.9 Flatten Binary Tree to Linked List
Notes: Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3 4 6 The原创 2015-06-05 14:31:33 · 337 阅读 · 0 评论 -
5.2.1 Construct Binary Tree from Preorder and Inorder Traversal
/* Author: Annie Kim, anniekim.pku@gmail.com Date: May 16, 2013 Problem: Construct Binary Tree from Preorder and Inorder Traversal Difficulty: Easy So原创 2015-06-05 17:14:11 · 458 阅读 · 0 评论 -
5.1.8 Balanced Binary Tree
平衡二叉树(Balanced Binary Tree)又被称为AVL树(有别于AVL算法),且具有以下性质:它是一 棵空树或它的左右两个子树的高度差的绝对值不超过1,并且左右两个子树都是一棵平衡二叉树。 Notes: Given a binary tree, determine if it is height-balanced.原创 2015-06-04 17:30:16 · 301 阅读 · 0 评论 -
5.1.6 Same Tree
Notes: Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the s原创 2015-06-04 17:15:48 · 346 阅读 · 0 评论 -
2.2.6 RotateList.h
Notes: 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原创 2015-05-25 15:21:15 · 298 阅读 · 0 评论 -
5.4.4 Path Sum II
Notes: 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原创 2015-06-11 16:57:13 · 446 阅读 · 0 评论 -
2.2.5 Remove Duplicates from Sorted List II
Notes: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->3->3->4->4原创 2015-06-12 17:25:26 · 443 阅读 · 0 评论 -
4.1.3LeetCode: Largest Rectangle in Histogram(直方图最大面积)
http://www.cnblogs.com/avril/archive/2013/08/24/3278873.html具体的题目描述为: Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the are转载 2015-06-01 18:06:42 · 621 阅读 · 0 评论 -
2.1.14 TrappingRainWater
notes:Given n non-negative integers representing an elevation map where the width ofeach bar is 1, compute how much water it is able to trap after raining.For exa原创 2015-05-11 17:17:32 · 481 阅读 · 0 评论 -
2.2.9ReverseNodesinkGroup
Notes: 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 en原创 2015-05-25 17:51:56 · 412 阅读 · 0 评论 -
5.4.3 Path Sum
Notes: 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.原创 2015-06-11 16:40:13 · 359 阅读 · 0 评论 -
2.2.5 RemoveDuplicatesfromSortedListII.h
Notes: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->3->3->4->4原创 2015-05-25 15:07:47 · 395 阅读 · 0 评论 -
2.2.3 Partition List
Notes: 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 original relative order原创 2015-05-25 14:32:57 · 292 阅读 · 0 评论 -
2.28SwapNodesinPairs
Notes: 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 alg原创 2015-05-26 15:44:00 · 413 阅读 · 0 评论 -
5.4.1 Minimum Depth of Binary Tree
Notes: 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 leaf node.原创 2015-06-11 16:17:38 · 426 阅读 · 0 评论 -
2.27RemoveNthNodeFromEndofList
Note: Given n will always be valid. Try to do this in one pass. Solution: head---back------front------>NULL | | ---> n */原创 2015-05-25 15:28:01 · 305 阅读 · 0 评论 -
2.2.10CopyListwithRandomPointer
Notes: 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 lis原创 2015-05-26 15:37:13 · 274 阅读 · 0 评论 -
2.2.4RemoveDuplicatesfromSortedList
Notes: 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,原创 2015-05-25 16:49:54 · 306 阅读 · 0 评论 -
5.1.5 Recover Binary Sear Tree
Notes: Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Note: A solution using O(n) space is原创 2015-06-04 16:57:38 · 391 阅读 · 0 评论 -
5.1.7 Symmetric Tree
ifficulty: Easy Source: http://leetcode.com/onlinejudge#question_101 Notes: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).原创 2015-06-04 17:22:11 · 353 阅读 · 0 评论 -
3.2ImplementstrStr
Notes: Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. Solution: 1. Check in th原创 2015-05-26 16:29:49 · 298 阅读 · 0 评论 -
3.7WildcardMatching
Notes: Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*' Matches any sequence of characters (including the empty seq原创 2015-05-27 16:30:50 · 652 阅读 · 0 评论 -
3.1ValidPalindrome
Notes: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan, a canal: Panama" is a pa原创 2015-05-26 16:14:09 · 365 阅读 · 0 评论 -
3.8LongestCommonPrefix
Notes: Write a function to find the longest common prefix string amongst an array of strings. Solution: ... */class Solution {public: string longe原创 2015-05-27 17:09:59 · 370 阅读 · 0 评论 -
3.9 ValidNumber
Notes: Validate if a given string is numeric. Some examples: "0" => true " 0.1 " => true "abc" => false "1 a" => false "2e10" => t原创 2015-05-27 17:45:42 · 368 阅读 · 0 评论 -
2.2.1Add Two Numbers
Notes: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.原创 2015-05-14 17:13:16 · 434 阅读 · 0 评论 -
2.1.20 Gas Station
Notes: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 t原创 2015-05-13 17:46:58 · 379 阅读 · 0 评论 -
2.1.19 Set Matrix Zeroes
Notes:Given a m x 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原创 2015-05-13 17:33:22 · 498 阅读 · 0 评论 -
2.1.18Gray Code
Notes: 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原创 2015-05-12 17:25:35 · 452 阅读 · 0 评论 -
2.1.16 Plus One
Notes: Given a number represented as an array of digits, plus one to the number.class Solution {public: vector plusOne(vector &digits) { int carry = 1, N = digits.size()原创 2015-05-12 16:10:50 · 455 阅读 · 0 评论 -
2.1.17 Climbing Stairs
Notes: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?原创 2015-05-12 16:29:41 · 495 阅读 · 0 评论