2014年6月10日

Hdu 1007　最近点对

摘要： 题目链接Quoit DesignTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29547Accepted Submission(s): 7741... 阅读全文

posted @ 2014-06-10 23:23 Stomach_ache 阅读(150) 评论(0) 推荐(0)

LeetCode --- Populating Next Right Pointers in Each Node II

摘要： 题目链接Problem description:Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would you... 阅读全文

posted @ 2014-06-10 14:55 Stomach_ache 阅读(152) 评论(0) 推荐(0)

LeetCode --- Populating Next Right Pointers in Each Node

摘要： 题目链接Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next po... 阅读全文

posted @ 2014-06-10 14:11 Stomach_ache 阅读(114) 评论(0) 推荐(0)

导航