<p>안녕하세요. 강의 너무 잘 듣고 있습니다.</p>
<p>그리디 알고리즘에 대한 개념이 안잡혀서 질문드리고 싶습니다.</p>
<p>이렇게 짠 코드도 그리디 알고리즘을 이용했다고 볼 수 있나요?</p>
<div style="color: #d4d4d4; background-color: #1e1e1e; font-family: Consolas, 'Courier New', monospace; font-size: 14px; line-height: 19px; white-space: pre;">
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #569cd6;">function</span>&nbsp;<span style="color: #dcdcaa;">solution</span>(<span style="color: #9cdcfe;">times</span>){</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #569cd6;">let</span>&nbsp;<span style="color: #9cdcfe;">count</span>&nbsp;=&nbsp;<span style="color: #b5cea8;">0</span>;</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #569cd6;">let</span>&nbsp;<span style="color: #9cdcfe;">x</span>&nbsp;=&nbsp;<span style="color: #9cdcfe;">times</span>.<span style="color: #dcdcaa;">sort</span>((<span style="color: #9cdcfe;">a</span>,<span style="color: #9cdcfe;">b</span>)&nbsp;<span style="color: #569cd6;">=&gt;</span>&nbsp;{</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #c586c0;">if</span>(<span style="color: #9cdcfe;">a</span>[<span style="color: #b5cea8;">0</span>]&nbsp;===&nbsp;<span style="color: #9cdcfe;">b</span>[<span style="color: #b5cea8;">0</span>])&nbsp;<span style="color: #c586c0;">return</span>&nbsp;<span style="color: #9cdcfe;">a</span>[<span style="color: #b5cea8;">1</span>]&nbsp;-&nbsp;<span style="color: #9cdcfe;">b</span>[<span style="color: #b5cea8;">1</span>];</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #c586c0;">else</span>{<span style="color: #c586c0;">return</span>&nbsp;<span style="color: #9cdcfe;">a</span>[<span style="color: #b5cea8;">0</span>]&nbsp;-&nbsp;<span style="color: #9cdcfe;">b</span>[<span style="color: #b5cea8;">0</span>];}</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;})</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #569cd6;">let</span>&nbsp;<span style="color: #9cdcfe;">pos</span>&nbsp;=<span style="color: #b5cea8;">0</span>;</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #c586c0;">for</span>&nbsp;(<span style="color: #569cd6;">let</span>&nbsp;<span style="color: #9cdcfe;">i</span>&nbsp;=<span style="color: #b5cea8;">0</span>&nbsp;;&nbsp;<span style="color: #9cdcfe;">i</span>&lt;<span style="color: #9cdcfe;">x</span>.<span style="color: #9cdcfe;">length</span>&nbsp;;&nbsp;<span style="color: #9cdcfe;">i</span>++){</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #c586c0;">if</span>(<span style="color: #9cdcfe;">x</span>[<span style="color: #9cdcfe;">pos</span>][<span style="color: #b5cea8;">1</span>]&nbsp;&gt;&nbsp;<span style="color: #9cdcfe;">x</span>[<span style="color: #9cdcfe;">i</span>][<span style="color: #b5cea8;">0</span>])&nbsp;<span style="color: #9cdcfe;">count</span>++;</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #c586c0;">else</span>&nbsp;{<span style="color: #c586c0;">break</span>;&nbsp;<span style="color: #9cdcfe;">pos</span>++;&nbsp;}</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span style="color: #c586c0;">return</span>&nbsp;<span style="color: #9cdcfe;">count</span>;</div>
<div>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</div>
</div>

<p>안녕하세요^^</p>
<p>그리디에 개념을 포괄적으로 생각하면 정렬을 하고 정렬 순서대로 하나씩 처리하는 코드 또는 우선순위큐를 사용하는 코드라면 그리디 풀이법이라고 합니다.</p>

인프런 커뮤니티 질문&답변

결혼식 그리디