________搜索
一北
一只有梦想的程序员,专注web后端,大数据等领域。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ2386经典DFS深搜
/** *@ author StormMaybin *@ date 2016-09-27 */Description Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N x M (1 <= N <= 100;原创 2016-09-27 00:11:56 · 790 阅读 · 0 评论 -
搜索POJ1321
/** *@ author StormMaybin *@ date 2016-09-29 */ 生命不息,奋斗不止! 题目描述棋盘问题 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 37025 Accepted: 18237Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆原创 2016-09-29 23:20:33 · 531 阅读 · 0 评论 -
leetcode 96. Unique Binary Search Trees
生命不息,奋斗不止! @author stormma @date 2017/10/21 题目Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example Given n = 3, there are a total of 5 unique BST原创 2017-10-23 20:31:31 · 271 阅读 · 0 评论 -
Leetcode 98.Validate Binary Search Tree
@author stormma @date 2017/11/28 生命不息,奋斗不止! 题目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原创 2017-11-28 23:22:49 · 320 阅读 · 0 评论 -
Leetcode Combinations问题总结
@author stormma @date 2017/11/30 生命不息,奋斗不止! 题目1Given two integers n and k, return all possible combinations of k numbers out of 1 … nExample n = 4, k = 2 [2,4], [3,4],原创 2017-11-30 09:40:37 · 793 阅读 · 0 评论 -
leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
生命不息,奋斗不止 @author stormma @date 2018/03/23 Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. Fo...原创 2018-03-23 16:20:58 · 398 阅读 · 0 评论 -
leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal
生命不息,奋斗不止 @author stormma @date 2018/03/23 Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. ...原创 2018-03-23 16:40:31 · 432 阅读 · 0 评论
分享