leetcode 622

1. 문제요구사항에 맞는 Circular Queue를 구현하라2. 해결class MyCircularQueue { queue: Array; front: number; rear: number; constructor(k: number) { this.queue = new Array(k+1).fill(null); this.front = 0; this.rear = 0; } enQueue(value: number): boolean { if(this.isFull()) return false; this.queue[this.rear] = value; this.rear = (this..