tag 最小堆

標籤
貢獻1
25
11:43 AM · Nov 18 ,2025

@最小堆 / 博客 RSS 訂閱

愛吃飯的程序媛 - 1005. Maximize Sum Of Array After K Negations

題目 Given an array A of integers, we must modify the array in the following way: we choose an i and replace A[i] with -A[i], and we repeat this process K times in total. (We may choose the

數組 , yyds乾貨盤點 , 最小值 , 最小堆 , 代碼人生

收藏 評論