우사미 코딩

1. 문제링크 https://leetcode.com/problems/maximum-subsequence-score/ 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 - nums1 : sum nums - nums2..

1. 문제링크 https://leetcode.com/problems/task-scheduler/ Task Scheduler - LeetCode Can you solve this real interview question? Task Scheduler - Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different task. Tasks could be done in any order. Each task is done in one unit of time. F leetcode.com 2. key point - priority_queue를 사용하자! 1) 각 task의 ..

queue는 FIFO (First In First Out) 로 먼저 들어온 데이터가 우선적으로 삭제하는 자료구조이지만 priority_queue는 삽입된 순서와 관련없이 우선순위가 높은 데이터를 삭제하는 자료구조이다 오름차순, 내림차순 queue를 사용해야 할 때가 있는데 이때 priority queue를 사용한다. priority_queue를 사용하려면 queue를 include 해야한다. #include 1. 값이 높은 숫자가 우선적으로 삭제되는 queue priority_queue lessQ; lessQ.push(3); lessQ.push(2); lessQ.push(1); lessQ.push(6); lessQ.push(8); lessQ.push(7); lessQ.pop(); // 8삭제 lessQ...