05 2016 档案

partition-list
摘要：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 阅读全文
posted @ 2016-05-31 23:23 Adding 阅读(130) 评论(0) 推荐(0)
entity.Student@150f3932, entity.Student@1a740c6b 没有实体中的数据
摘要：public class AppServerAction extends BaseAction { /** * */ /** * 初始化 “我的产品”列表 JSP页面,具有分页功能 * * @param request * @param model * @return */ @Autowired p 阅读全文
posted @ 2016-05-30 11:18 Adding 阅读(163) 评论(0) 推荐(0)
construct-binary-tree-from-inorder-and-postorder-traversal
摘要：Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. 阅读全文
posted @ 2016-05-23 08:59 Adding 阅读(175) 评论(0) 推荐(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. 阅读全文
posted @ 2016-05-22 21:18 Adding 阅读(132) 评论(0) 推荐(0)
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
摘要：/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { pu... 阅读全文
posted @ 2016-05-22 16:03 Adding 阅读(454) 评论(0) 推荐(0)
convert-sorted-list-to-binary-search-tree
摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 阅读全文
posted @ 2016-05-20 22:58 Adding 阅读(123) 评论(0) 推荐(0)
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree andsum =
摘要：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F 阅读全文
posted @ 2016-05-20 11:33 Adding 阅读(172) 评论(0) 推荐(0)
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 the depth of the two subtrees of every node never diffe
摘要：class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public class Solution { public boolean isBalanced(TreeNode root) { if(root==nu... 阅读全文
posted @ 2016-05-20 09:47 Adding 阅读(540) 评论(0) 推荐(0)
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 represents the number123. Find the total sum of a
摘要：class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public class Solution { public int sumNumbers(TreeNode root) { if(root==null)... 阅读全文
posted @ 2016-05-19 14:34 Adding 阅读(133) 评论(0) 推荐(0)
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 list.
摘要：图解： 此题过程分为三个阶段，分别是 1、负责后面一个节点，并且将这个节点插入到原来链表中 2、复制后面一个节点的random指针。 3 拆分组合链表为两部分。 第一部分代码： 第二部分 代码： 第三部分代码： 总的代码： 阅读全文
posted @ 2016-05-19 09:27 Adding 阅读(474) 评论(0) 推荐(0)
leetcode算法
摘要：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? 阅读全文
posted @ 2016-05-18 20:52 Adding 阅读(199) 评论(0) 推荐(0)
leetcode
摘要：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. Fo 阅读全文
posted @ 2016-05-18 16:32 Adding 阅读(267) 评论(0) 推荐(0)
leetcode
摘要：Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are+,-,*,/. Each operand may be an integer or another expre 阅读全文
posted @ 2016-05-16 20:59 Adding 阅读(257) 评论(0) 推荐(0)