sunliuxun-CSDN博客

Binary Tree DFS template/** * Copyright: NineChapter * - Algorithm Course, Mock Interview, Interview Questions * - More details on: http://www.ninechapter.com/ */Template 1: Traversepubl

2014-09-27 08:07:37 356

转载 L3：05 - Binary Tree Maximum Path Sum

https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example: Given the below binar

2014-09-27 08:06:00 327

转载 L3：04 - Balanced Binary Tree

https://oj.leetcode.com/problems/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

2014-09-27 08:04:25 426

转载 L3：03 - Maximum Depth of Binary Tree

https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/

2014-09-27 08:03:09 370

转载 L3：02 - Divide & Conquer Algorithm

- Merge Sort- Quick Sort- Most of the Binary Tree Problems !

2014-09-27 08:02:06 275

转载 L3：01 - Binary Tree DFS Traversal

https://oj.leetcode.com/problems/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 / 3 return

2014-09-27 07:59:20 359

转载 L2：12 - Recover Sorted Array

Given a rotated sorted array, recover it to sorted array in-place. Example [4, 5, 1, 2, 3] -> [1, 2, 3, 4, 5]/** * Copyright: NineChapter * - Algorithm Course, Mock Interview, Interview Question

2014-09-27 07:52:33 368

转载 L2：11 - Median of Two Sorted Arrays

https://oj.leetcode.com/problems/median-of-two-sorted-arrays/

2014-09-27 07:48:47 324

转载 L2：10 - Merge Sorted Array

https://oj.leetcode.com/problems/merge-sorted-array/

2014-09-27 07:47:15 287

转载 L2：08 - Remove Duplicates from Sorted Array I, II

https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/

2014-09-27 07:44:26 301

转载 L2：06 - Search a 2D Matrix

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted from left to right. The first integer of each row

2014-09-27 07:42:01 328

转载 L2：05 - Search in Rotated Sorted Array II

https://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/

2014-09-27 07:37:23 377

转载 L2：04 - Search in Rotated Sorted Array

https://oj.leetcode.com/problems/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

2014-09-27 07:33:13 366

转载 L2：03 - Search Insert Position

https://oj.leetcode.com/problems/search-insert-position/

2014-09-27 07:31:20 298

转载 L1：Restore IP Addresses

https://oj.leetcode.com/problems/restore-ip-addresses/Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given "25525511135", r

2014-09-27 07:27:52 311

转载 L1：Palindrome Partitioning

https://oj.leetcode.com/problems/palindrome-partitioning/

2014-09-27 07:25:18 306

转载 L1：Letter Combinations of a Phone Number

https://oj.leetcode.com/problems/letter-combinations-of-a-phone-number/Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters

2014-09-27 07:24:03 345

转载 L1：Combination Sum

https://oj.leetcode.com/problems/combination-sum/Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same rep

2014-09-27 07:20:47 255

转载 L1：06 - Permutations II

Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [1,1,2], [1,2,1], and [2,1,1].

2014-09-27 07:15:58 371

转载 L1：05 - Permutations

https://oj.leetcode.com/problems/permutations/

2014-09-27 07:12:56 349

转载 L2：02 - 二分法第一个应用Search for a Range

https://oj.leetcode.com/problems/search-for-a-range/

2014-09-16 06:53:03 341

Binary search is a famous question in algorithm. For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target number d

2014-09-16 06:27:13 358

转载 L1：04 - Subsets II

https://oj.leetcode.com/problems/subsets-ii/Given a collection of integers that might contain duplicates, S, return all possible subsets. Note: Elements in a subset must be in non-descending order

2014-09-16 06:14:22 349

转载 L1：03 - subSets

https://oj.leetcode.com/problems/subsets/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 c

2014-09-16 06:07:48 401

转载 L1：02 - Implement strStr()

Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.

2014-09-16 05:53:25 319

转载 mitbbs @ 面试做题总结

http://www.mitbbs.com/article_t/JobHunting/32740447.html

2014-07-22 10:37:33 659

原创 LeetCode3.4 @ Add Binary D2F4

Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".

2014-07-21 03:55:42 439

原创 LeetCode3.2 @ Implement strStr() D4F5

Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.

2014-07-20 06:32:02 470

原创 LeetCode3.1 @ Valid Palindrome 检验回文串 D2F5

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 palindrome."race a car" is not a

2014-07-20 01:40:58 535

原创 Remove Duplicates from Sorted ListII 有序链表去重II D3F3

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->5, return 1->2->5.Given 1->1-

2014-07-19 14:31:50 391

原创 Remove Duplicates from Sorted List 有序链表去重 D1F3

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, return 1->2->3.

2014-07-19 12:51:54 319

空空如也

空空如也