01 2015 档案

[LeetCode] Search in Rotated Sorted Array II 二分搜索
摘要：Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function to... 阅读全文
posted @ 2015-01-22 00:52 A_zhu 阅读(161) 评论(0) 推荐(0)
[LeetCode] Search Insert Position 二分搜索
摘要：Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or... 阅读全文
posted @ 2015-01-22 00:38 A_zhu 阅读(215) 评论(0) 推荐(0)
[LeetCode] Remove Duplicates from Sorted List II 链表
摘要：Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文
posted @ 2015-01-22 00:01 A_zhu 阅读(131) 评论(0) 推荐(0)
[LeetCode] Unique Binary Search Trees II dfs 深度搜索
摘要：Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文
posted @ 2015-01-21 23:23 A_zhu 阅读(160) 评论(0) 推荐(0)
[LeetCode] Scramble String 字符串 dp
摘要：Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation... 阅读全文
posted @ 2015-01-21 20:25 A_zhu 阅读(213) 评论(0) 推荐(0)
[LeetCode] 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 ... 阅读全文
posted @ 2015-01-21 15:56 A_zhu 阅读(169) 评论(0) 推荐(0)
[LeetCode] Convert Sorted List to Binary Search Tree DFS,深度搜索
摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Hide TagsDepth-first SearchLinked List 这... 阅读全文
posted @ 2015-01-15 20:10 A_zhu 阅读(221) 评论(0) 推荐(0)
[LeetCode] Valid Number 确认是否为数值
摘要：Validate if a given string is numeric.Some examples:"0"=>true" 0.1 "=>true"abc"=>false"1 a"=>false"2e10"=>trueNote:It is intended for the problem stat... 阅读全文
posted @ 2015-01-15 17:16 A_zhu 阅读(308) 评论(0) 推荐(0)
[LeetCode] 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 (just like on the telephon... 阅读全文
posted @ 2015-01-15 16:10 A_zhu 阅读(179) 评论(0) 推荐(0)
[论文]Clustering-Based Ensembles as an Alternative to Stacking
摘要：Clustering-Based Ensembles as an Alternativeto Stacking作者：Anna Jurek, Yaxin Bi, Shengli Wu, and Chris D. Nugent, Member, IEEE杂志：IEEE TRANSACTIONS ON K... 阅读全文
posted @ 2015-01-09 22:42 A_zhu 阅读(461) 评论(0) 推荐(0)
[LeetCode] Factorial Trailing Zeroes 阶乘末尾0
摘要：Given an integern, return the number of trailing zeroes inn!.Note:Your solution should be in logarithmic time complexity.Credits:Special thanks to@tsf... 阅读全文
posted @ 2015-01-08 22:57 A_zhu 阅读(1693) 评论(0) 推荐(0)
[LeetCode] Maximum Depth of Binary Tree dfs,深度搜索
摘要：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 le... 阅读全文
posted @ 2015-01-08 18:16 A_zhu 阅读(169) 评论(0) 推荐(0)
[LeetCode] Count and Say 字符串
摘要：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"tw... 阅读全文
posted @ 2015-01-08 17:51 A_zhu 阅读(445) 评论(0) 推荐(0)
[LeetCode] Binary Tree Postorder Traversal dfs,深度搜索
摘要：Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No... 阅读全文
posted @ 2015-01-08 14:04 A_zhu 阅读(141) 评论(0) 推荐(0)
[LeetCode] Climbing Stairs 斐波那契数列
摘要：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2015-01-08 13:45 A_zhu 阅读(237) 评论(0) 推荐(0)
[LeetCode] Reorder List 反向插入链表
摘要：Given a singly linked listL: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 exam... 阅读全文
posted @ 2015-01-08 02:44 A_zhu 阅读(295) 评论(0) 推荐(0)
[LeetCode] Sum Root to Leaf Numbers dfs,深度搜索
摘要：Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep... 阅读全文
posted @ 2015-01-07 23:41 A_zhu 阅读(152) 评论(0) 推荐(0)
[LeetCode] Linked List Cycle II 链表环起始位置
摘要：Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?Hid... 阅读全文
posted @ 2015-01-06 15:00 A_zhu 阅读(339) 评论(0) 推荐(0)
[LeetCode] Find Minimum 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 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文
posted @ 2015-01-06 14:00 A_zhu 阅读(143) 评论(0) 推荐(0)
[LeetCode] Path Sum II 深度搜索
摘要：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 andsum =... 阅读全文
posted @ 2015-01-05 18:57 A_zhu 阅读(146) 评论(0) 推荐(0)
[LeetCode] Surrounded Regions 广度搜索
摘要：Given a 2D board containing'X'and'O', capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that surrounded region... 阅读全文
posted @ 2015-01-05 18:38 A_zhu 阅读(177) 评论(0) 推荐(0)
[LeetCode] Insert Interval 二分搜索
摘要：Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially... 阅读全文
posted @ 2015-01-05 00:24 A_zhu 阅读(242) 评论(0) 推荐(0)
[LeetCode] Search a 2D Matrix 二分搜索
摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文
posted @ 2015-01-04 22:26 A_zhu 阅读(170) 评论(0) 推荐(0)