摘要:
460. LFU Cache Hard Design and implement a data structure for a Least Frequently Used (LFU) cache. Implement the LFUCache class: LFUCache(int capacity 阅读全文
摘要:
560. Subarray Sum Equals K Medium Given an array of integers nums and an integer k, return the total number of continuous subarrays whose sum equals t 阅读全文
摘要:
31. Next Permutation Medium Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If su 阅读全文
摘要:
18. 4Sum Medium Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: 0 <= 阅读全文
摘要:
207. Course Schedule Medium There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequ 阅读全文
摘要:
743. Network Delay Time Medium You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed e 阅读全文