Jessica程序猿 - 博客园

2014年11月17日

摘要： Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文

posted @ 2014-11-17 13:26 Jessica程序猿阅读(134) 评论(0) 推荐(0) 编辑

Symmetric Tree

摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文

posted @ 2014-11-17 10:10 Jessica程序猿阅读(151) 评论(0) 推荐(0) 编辑

Validate Binary Search Tree

摘要： 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 n... 阅读全文

posted @ 2014-11-17 08:51 Jessica程序猿阅读(226) 评论(0) 推荐(0) 编辑

2014年11月16日

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 @ 2014-11-16 22:55 Jessica程序猿阅读(126) 评论(0) 推荐(0) 编辑

Two Sum

摘要： Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu... 阅读全文

posted @ 2014-11-16 20:32 Jessica程序猿阅读(216) 评论(0) 推荐(0) 编辑

Binary Tree Zigzag Level Order Traversal

摘要： Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文

posted @ 2014-11-16 17:18 Jessica程序猿阅读(227) 评论(0) 推荐(0) 编辑

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?本来不... 阅读全文

posted @ 2014-11-16 16:00 Jessica程序猿阅读(213) 评论(0) 推荐(0) 编辑

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 @ 2014-11-16 14:04 Jessica程序猿阅读(157) 评论(0) 推荐(0) 编辑

Binary Tree Preorder Traversal

摘要： Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].二叉树... 阅读全文

posted @ 2014-11-16 12:41 Jessica程序猿阅读(168) 评论(0) 推荐(0) 编辑

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 @ 2014-11-16 09:43 Jessica程序猿阅读(217) 评论(0) 推荐(0) 编辑

Jessica要努力了。。

公告