排序map、pq、stack。固定 递归 贪心 开关 二分 滑动窗口（固递贪开二滑）

摘要： ［抄题］： You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should ch 阅读全文

摘要： ［抄题］： Given the running logs of n functions that are executed in a nonpreemptive single threaded CPU, find the exclusive time of these functions. Each 阅读全文

摘要： ［抄题］： Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee re 阅读全文

摘要： ［抄题］： Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer t 阅读全文

摘要： ［抄题］： Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn't one, return 0 instead. Note:The s 阅读全文

摘要： ［抄题］： Given an array of citations in ascending order (each citation is a non-negative integer) of a researcher, write a function to compute the resear 阅读全文

摘要： ［抄题］： Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. Acc 阅读全文

摘要： ［抄题］： 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 阅读全文

摘要： ［抄题］： Design a data structure that supports all following operations in average O(1) time. Note: Duplicate elements are allowed. Example: [暴力解法]： 时间分析 阅读全文

摘要： ［抄题］： Design a data structure that supports all following operations in average O(1) time. Example: [暴力解法]： 时间分析： 空间分析： [优化后]： 时间分析： 空间分析： ［奇葩输出条件］： ［ 阅读全文