Python C++ heap priority queue速解Leetcode 2530 Maximal Score After Applying K Operations
Python CPP heap priority queue速解Leetcode 2530. Maximal Score After Applying K Operations
heap/priority queue是重要的資料結構，無論是C++的std::priority_queue或是python的heapq都可以拿來練習這題用貪婪演算可解的問題
----------
Heap/priority queue is an important data structure. Whether it is C++'s std::priority_queue or Python's heapq, you can use it to practice this problem that can be solved using greedy algorithm.
[codes on Leetcode]https://leetcode.com/problems/maximal...
[Leetcode Playlist] • C++ UnionFind BFS DFS解圖論問題Leetcode 1971 F...
[Python C++計數速解Leetcode 945 Minimum Increment to Make Array Unique] • Python C++計數速解Leetcode 945 Minimum Increm...