Heap.md 删除示例代码出错

int item = maxHeap[1]; // store the value of the root node
maxHeap[1] = maxHeap[heapSize]; // move the value of the last node to the root
maxHeap[heapSize--] = 0; // decrease the heap size by one and initialize the last node to 0

for (int i = 1; i * 2 <= heapSize;) {
    
    // if the last node is greater than both the left node and the right node, stop
    if (maxHeap[i] > maxHeap[i * 2] && maxHeap[i] > maxHeap[i * 2 + 1]) {
        break;
    }
    
    // if the left node is greater than the right node, swap
    else if (maxHeap[i * 2] > maxHeap[i * 2 + 1]) {
        swap(i, i * 2);
        i = i * 2;
    }
    
    // if the right node is greater than the left node
    else {
        swap(i, i * 2 + 1);
        i = i * 2 + 1;
    }
}

return item;