摘要：
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such an arrangement is not pos 阅读全文
阅读排行榜
[LeetCode] 895. Maximum Frequency Stack_Hard tag: stack
2021-07-29 23:17 by Johnson_强生仔仔, 28 阅读, 收藏,
摘要：
Design a stack-like data structure to push elements to the stack and pop the most frequent element from the stack. Implement the FreqStack class: Freq 阅读全文
[LeetCode] 703. Kth Largest Element in a Stream_Easy tag: Heap
2021-06-28 10:41 by Johnson_强生仔仔, 28 阅读, 收藏,
摘要：
Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element. 阅读全文
[LeetCode] 54. Spiral Matrix_Medium tag: array, DFS
2021-08-22 07:13 by Johnson_强生仔仔, 26 阅读, 收藏,
摘要：
Given an m x n matrix, return all elements of the matrix in spiral order. Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [1,2,3,6,9,8,7, 阅读全文
[LeetCode] 399. Evaluate Division_Medium tag: DFS
2021-08-18 23:14 by Johnson_强生仔仔, 26 阅读, 收藏,
摘要：
You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equa 阅读全文
浙公网安备 33010602011771号