2018年5月10日
117. Populating Next Right Pointers in Each Node II 计算右边的附属节点
摘要： ［抄题］： Given a binary tree Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set t 阅读全文
posted @ 2018-05-10 17:17 苗妙苗 阅读(143) 评论(0) 推荐(0)
381. Insert Delete GetRandom O(1) - Duplicates allowed允许重复的设计1数据结构
摘要： ［抄题］： Design a data structure that supports all following operations in average O(1) time. Note: Duplicate elements are allowed. Example: [暴力解法]： 时间分析 阅读全文
posted @ 2018-05-10 09:52 苗妙苗 阅读(145) 评论(0) 推荐(0)