| double heap的套路295+480 - 10/19 - 532E. K-diff Pairs in an Array - hash - 295H. Find Median from Data Stream - double heap - 480H. Sliding Window Median - a lazy remove heap design - 826M. Most Profit Assigning Work - binsearch. {buggy} notice lower cost might have higher reward - 901M. Online Stock Span - stack - 100E. 100. Same Tree - simple recursion - 451M. Sort Characters By Frequency - hash |
Read full article from 转型刷Leetcode记录帖【一亩三分地论坛刷题版】 -
No comments:
Post a Comment