- 博客(38)
- 资源 (14)
- 问答 (6)
- 收藏
- 关注
原创 Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary
2015-01-10 16:09:05 3800
原创 Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20
2015-01-10 15:53:26 3717
原创 Binary Tree Level Order Traversal II
Binary Tree Level Order Traversal II
2015-01-10 15:15:16 3753
原创 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.
2015-01-09 20:30:11 3916
原创 Populating Next Right Pointers in Each Node II
Populating Next Right Pointers in Each Node II
2015-01-09 15:12:50 3853
原创 Populating Next Right Pointers in Each Node
Populating Next Right Pointers in Each Node
2015-01-09 15:01:01 3904
原创 Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota
2015-01-08 07:56:17 3719
原创 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.For example,一道类似围棋的问题,不能逃出X棋子的包
2015-01-07 14:33:54 4034
原创 Find Minimum in Rotated Sorted Array II
Find Minimum in Rotated Sorted Array II
2015-01-06 08:42:24 3861
原创 Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array
2015-01-06 08:31:19 3662
原创 Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to
2015-01-05 15:56:06 3807
原创 Candy
CandyThere are N children standing in a line. Each child is assigned a rating value.
2015-01-05 13:12:25 3668
原创 Copy List with Random Pointer
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.
2015-01-04 20:50:22 3789
原创 Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using ext
2015-01-04 16:11:36 3671
原创 Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list. *
2015-01-04 15:19:25 3648
原创 Linked List Cycle
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list. * class ListNode { * int val; *
2015-01-04 14:26:10 3663
原创 Reorder List
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.For example,Given {1,2,3,4}, reorder it t
2015-01-04 11:24:25 3692
原创 Binary Tree Preorder Traversal
Binary Tree Preorder TraversalGiven a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3},
2015-01-04 09:22:06 3734
原创 Binary Tree Postorder Traversal
Binary Tree Postorder TraversalGiven a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3},
2015-01-04 08:34:38 3687
原创 LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if
2015-01-03 20:33:30 3715
Git权威指南视频教程
2015-10-24
saxpath.jar
2015-08-07
expect 脚本响应的很慢
2017-01-14
shell 怎么越过跳板机访问多台服务器
2016-07-17
mapminmax([1 1 1]) 为什么输出的是1,
2016-05-09
谁有java版的神经网络程序
2015-11-12
java垃圾回收机制怎么回收变量
2015-05-04
TA创建的收藏夹 TA关注的收藏夹
TA关注的人