ContextQMD
Back to Type Challenges

README.Ko

questions/00016-medium-pop/README.ko.md

latest2.5 KB
Original Source
<!--info-header-start--><h1>Pop </h1><blockquote><p>by Anthony Fu <a href="https://github.com/antfu" target="_blank">@antfu</a></p></blockquote><p><a href="https://tsch.js.org/16/play/ko" target="_blank"></a> &nbsp;&nbsp;&nbsp;<a href="./README.md" target="_blank"></a> <a href="./README.zh-CN.md" target="_blank"></a> <a href="./README.ja.md" target="_blank"></a> </p><!--info-header-end-->

이 챌린지에는 TypeScript 4.0 사용이 권장됩니다.

배열 T를 사용해 마지막 요소를 제외한 배열을 반환하는 제네릭 Pop<T>를 구현합니다.

예시

ts
type arr1 = ['a', 'b', 'c', 'd']
type arr2 = [3, 2, 1]

type re1 = Pop<arr1> // expected to be ['a', 'b', 'c']
type re2 = Pop<arr2> // expected to be [3, 2]

더보기: 비슷하게 Shift, Push 그리고 Unshift도 구현할 수 있을까요?

<!--info-footer-start-->

<a href="../../README.ko.md" target="_blank"></a> <a href="https://tsch.js.org/16/answer/ko" target="_blank"></a> <a href="https://tsch.js.org/16/solutions" target="_blank"></a> <hr><h3>관련된 문제들</h3><a href="https://github.com/type-challenges/type-challenges/blob/main/questions/00014-easy-first/README.ko.md" target="_blank"></a> <a href="https://github.com/type-challenges/type-challenges/blob/main/questions/00015-medium-last/README.ko.md" target="_blank"></a> <!--info-footer-end-->