2017年9月17日
LeetCode 380. Insert Delete GetRandom O(1) （插入删除和获得随机数 常数时间）
摘要： Design a data structure that supports all following operations in average O(1) time. insert(val): Inserts an item val to the set if not already presen 阅读全文
posted @ 2017-09-17 10:52 Jimmy_Cheng 阅读(372) 评论(0) 推荐(0)
LeetCode 370. Range Addition （范围加法）$
摘要： Assume you have an array of length n initialized with all 0's and are given k update operations. Each operation is represented as a triplet: [startInd 阅读全文
posted @ 2017-09-17 07:24 Jimmy_Cheng 阅读(414) 评论(0) 推荐(0)