'2022/07/01 글 목록

406. Queue Reconstruction by Height

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an array of people, people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] represents the ith person of height hi with exactly ki other people in front who have a height greater than or equal to hi. Reconstruct and return the queue that is represented by the input array people. The return..

Algorithm/LeetCode Daily Challenge 2022. 7. 1. 10:30

이전 1 다음

이전 다음

공지사항

최근에 올라온 글