Last Stone Weight (Max Heap)
Max-Heap pops two largest stones (Y, X). If Y > X, push (Y-X) back.
MAX (Y)
VS
2ND MAX (X)
Root (Max)
Popped Stone
Survivor/Result
當前步驟
Ready.
步驟 0 / 0
邏輯解釋
C++ Code