OJ-BFS
文章平均质量分 66
Morrisss_
做更好地自己。
展开
-
hdu-1253 胜利大逃亡(BFS)
hdu-1253 胜利大逃亡(BFS)题目描述 胜利大逃亡 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34840 Accepted Submission(s): 12482 Problem Descript原创 2016-11-15 16:23:50 · 522 阅读 · 0 评论 -
LeetCode OJ-513.Find Bottom Left Tree Value
LeetCode OJ-513.Find Bottom Left Tree Value题目描述 Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input: 2 / \ 1 3Output: 1 Example 2:原创 2017-05-02 17:33:25 · 669 阅读 · 0 评论