담백한 웹 개발 이야기

class LinkedListNode { constructor(data) { this.data = data; this.next = null; } } class LinkedList { constructor() { this.head = null; this.size = 0; } isEmpty() { return this.size === 0; } insert(data) { const newNode = new LinkedListNode(data); if (this.head !== null) { newNode.next = this.head; } this.head = newNode; this.size++; } remove(data) { if (this.head.data === data) { this.head = th..

class Queue { constructor() { this.arr = [] } getBuffer() { return this.arr.slice(); } isEmpty() { return this.arr.length === 0; } enqueue(item) { this.arr.push(item); } dequeue() { return this.arr.shift(); } peek() { return this.arr[0]; } }

class Stack { #arr = [] constructor() { this.#arr = [] } getBuffer() { return this.#arr.slice(); } isEmpty() { return this.#arr.length === 0; } push(item) { this.#arr.push(item); } pop() { return this.#arr.pop(); } peek() { return this.#arr[this.#arr.length - 1]; } }

const set = new Set(); set.add(1); set.delete(1); set.add(2); console.log(set.has(1), set.has(2)); // false true 교집합 const intersectSets = (setA, setB) => { const intersection = new Set(); for (const elem of setB) { if (setA.has(elem)) { intersection.add(elem); } } return intersection; }; console.log( intersectSets( new Set([1, 2, 3, 4]), new Set([2, 3]), ) ); // Set {2, 3} 합집합 const unionSets =..