Merge pull request #74 from KNU-HAEDAL/Dobbymin

Solve: 문제 17, 18

Author: Dobbymin

Dobbymin/Algorithm/book/17.js

@@ -0,0 +1,13 @@
+function solution(cards1, cards2, goal) {
+	for (const s of goal) {
+		if (cards1[0] == s) {
+			cards1.shift();
+		} else if (cards2[0] == s) {
+			cards2.shift();
+		} else {
+			return 'No';
+		}
+	}
+
+	return 'Yes';
+}

Dobbymin/Algorithm/book/18.js

@@ -0,0 +1,30 @@
+function countSort(arr, k) {
+	const hashTable = new Array(k + 1).fill(0);
+	for (const num of arr) {
+		if (num <= k) {
+			hashTable[num] = 1;
+		}
+	}
+
+	return hashTable;
+}
+
+function solution(arr, target) {
+	const hashTable = countSort(arr, target);
+	for (const num of arr) {
+		const complement = target - num;
+
+		if (
+			complement !== num &&
+			complement >= 0 &&
+			complement <= target &&
+			hashTable[complement] === 1
+		) {
+			return true;
+		}
+	}
+	return false;
+}
+
+console.log(solution([1, 2, 3, 4, 8], 6));
+console.log(solution([2, 3, 5, 9], 10));