随笔分类 -  Algorithmic Techniques Summary

Sweep Line Algorithm Summary
摘要：Given a set of closed intervals, find the smallest set of numbers that covers all the intervals. If there are multiple smallest sets, return any of th 阅读全文
posted @ 2019-03-30 01:42 Review->Improve 阅读(780) 评论(0) 推荐(0)
Core Data Structures, Algorithms and Concepts
摘要：Graph: n nodes, m edges Representation Adjacency Matrix: O(n^2) space, not efficient for sparse graph Adjacency List: O(n + m) space, efficient for sp 阅读全文
posted @ 2019-03-08 12:27 Review->Improve 阅读(617) 评论(0) 推荐(0)