목록2025/12/06 (1)

넘치게 채우기

[LeetCode] 3578. Count Partitions With Max-Min Difference at Most K

https://leetcode.com/problems/count-partitions-with-max-min-difference-at-most-k/description/?envType=daily-question&envId=2025-12-06LeetCode - Count Partitions With Max-Min Difference at Most K문제 유형: 모노토닉 큐, 다이나믹 프로그래밍, 슬라이딩 윈도우문제 난이도: Medium 문제You are given an integer array nums and an integer k. Your task is to partition nums into one or more non-empty contiguous segments such that in each se..
PS/LeetCode 2025. 12. 6. 17:04
이전 Prev 1 Next 다음