随笔分类 -  leetcode

上一页 1 2 3 4
【LeetCode】Convert Sorted Array to Binary Search Tree
摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for binary tree * public class TreeN... 阅读全文
posted @ 2014-05-07 22:08 一弦一仙 阅读(159) 评论(0) 推荐(0)
【LeetCode】Binary Tree Level Order Traversal II
摘要：Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2014-05-07 21:56 一弦一仙 阅读(151) 评论(0) 推荐(0)
【LeetCode】Populating Next Right Pointers in Each Node
摘要：http://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/Given a binary tree struct TreeLinkNode { TreeLinkNode *left; ... 阅读全文
posted @ 2014-05-07 21:25 一弦一仙 阅读(164) 评论(0) 推荐(0)
【LeetCode】Remove Duplicates from Sorted Array II
摘要：http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array-ii/Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?F... 阅读全文
posted @ 2014-05-06 22:17 一弦一仙 阅读(93) 评论(0) 推荐(0)
【LeetCode】Binary Tree Inorder Traversal
摘要：Binary Tree Inorder TraversalTotal Accepted:16406Total Submissions:47212My SubmissionsGiven a binary tree, return theinordertraversal of its nodes' va... 阅读全文
posted @ 2014-05-06 21:24 一弦一仙 阅读(93) 评论(0) 推荐(0)
【LeetCode】Merge Two Sorted Lists
摘要：Merge Two Sorted ListsMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the fir... 阅读全文
posted @ 2014-05-06 21:12 一弦一仙 阅读(111) 评论(0) 推荐(0)
【LeetCode】Reverse Integer
摘要：http://oj.leetcode.com/problems/reverse-integer/public class Solution { public int reverse(int x) { String strX = Integer.toString(x); ... 阅读全文
posted @ 2014-05-06 20:29 一弦一仙 阅读(137) 评论(0) 推荐(0)
【LeetCode】Same Tree
摘要：http://oj.leetcode.com/problems/same-tree/public class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { Stack pstack = new... 阅读全文
posted @ 2014-05-06 20:17 一弦一仙 阅读(118) 评论(0) 推荐(0)
【LeetCode】Maximum Depth of Binary Tree
摘要：http://oj.leetcode.com/problems/maximum-depth-of-binary-tree/public class Solution { public int maxDepth(TreeNode root) { if(root!=null){ ... 阅读全文
posted @ 2014-05-06 19:50 一弦一仙 阅读(94) 评论(0) 推荐(0)
【LeetCode】Minimum Path Sum
摘要：http://oj.leetcode.com/problems/minimum-path-sum/public class Solution { public int minPathSum(int[][] grid) { int row = grid.length; ... 阅读全文
posted @ 2014-05-06 19:40 一弦一仙 阅读(105) 评论(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 @ 2014-04-25 22:36 一弦一仙 阅读(155) 评论(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 @ 2014-04-25 21:35 一弦一仙 阅读(125) 评论(0) 推荐(0)
【LeetCode】Merge Sorted Array
摘要：Merge Sorted ArrayGiven two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that i... 阅读全文
posted @ 2014-04-25 21:14 一弦一仙 阅读(133) 评论(0) 推荐(0)
【LeetCode】Search for a Range
摘要：http://oj.leetcode.com/problems/search-for-a-range/使用快速排序的原理进行查找public class Solution { public int[] searchRange(int[] A, int target) { in... 阅读全文
posted @ 2014-04-25 20:28 一弦一仙 阅读(98) 评论(0) 推荐(0)

上一页 1 2 3 4