- 博客(14)
- 资源 (5)
- 收藏
- 关注
RSS订阅原创 LeetCode 112 Path Sum
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 and sum
2014-08-29 22:20:50
429
原创 LeetCode 99 Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is pretty straight forward. Could you devis
2014-08-29 20:06:12
615
1
原创 LeetCode 59 Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3
2014-08-28 20:28:59
1512
1
原创 LeetCode 46 Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and [2,1,1].
2014-08-28 14:31:02
1232
2
原创 LeetCode 45 Permutations
Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].思
2014-08-28 14:20:56
1118
1
原创 LeetCode 30 Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible o
2014-08-28 09:40:05
829
1
原创 LeetCode 44 Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal i
2014-08-27 17:44:20
823
1
原创 LeetCode 34 Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found in t
2014-08-27 11:15:18
731
1
原创 LeetCode 54 Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if yo
2014-08-26 15:28:52
506
转载 JAVA采用JDBC执行批处理操作注意的有关问题
JAVA采用JDBC执行批处理操作注意的问题让我们看看如何使用JDBC API在Java中执行批量插入。虽然你可能已经知道，但我会尽力解释基础到复杂的场景。 在此笔记里，我们将看到我们如何可以使用像Statement和PreparedStatement JDBC API来批量在任何数据库中插入数据。此外，我们将努力探索一些场景，如在内存不足时正常运行，以及如何优化批量操作。
2014-08-20 09:45:01
542
原创 LeetCode 24 Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is
2014-08-18 21:30:48
525
原创 LeetCode 93 Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order
2014-08-17 19:19:08
518
原创 LeetCode 77 Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]
2014-08-14 22:03:42
615
原创 LeetCode 103 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
2014-08-14 16:11:53
684
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人