Notice
Recent Posts
Recent Comments
Link
목록2023/05/24 (1)
넘치게 채우기
[LeetCode] 2542. Maximum Subsequence Score
https://leetcode.com/problems/maximum-subsequence-score/description/ Maximum Subsequence Score - LeetCode Can you solve this real interview question? Maximum Subsequence Score - You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k. For chosen indic leetcode.com 문제 유형 : 우선순위 큐 문제 난이도 ..
PS/LeetCode
2023. 5. 24. 22:10