스택, 큐, 데크 나의 풀이

minsoftk · minsoftk · commit 8b70a86dae14 · 2021-10-12T13:57:38.000+09:00
diff --git a/JS/05.스택,큐,테크/03.후위식연산(postfix).js b/JS/05.스택,큐,테크/03.후위식연산(postfix).js
@@ -1,6 +1,28 @@
 function solution(s) {
-	let answer = '';
+	let answer = 0;
+	let reg = /[^0-9]/;
+	let stack = [];
 
-	return answer;
+	for (let i = 0; i < s.length; i++) {
+		// s[i]가 숫자가 아니라면
+		if (!reg.test(s[i])) {
+			stack.push(parseInt(s[i]));
+		} else {
+			let a = 0,
+				b = 0;
+			b = stack.pop();
+			a = stack.pop();
+			if (s[i] === '*') {
+				stack.push(a * b);
+			} else if (s[i] === '/') {
+				stack.push(a / b);
+			} else if (s[i] === '+') {
+				stack.push(a + b);
+			} else {
+				stack.push(a - b);
+			}
+		}
+	}
+	return stack.pop();
 }
 console.log(solution('352+*9-')); // 12
diff --git a/JS/05.스택,큐,테크/04.연속된문자지우기.js b/JS/05.스택,큐,테크/04.연속된문자지우기.js
@@ -1,6 +1,11 @@
 function solution(s) {
-	let answer = '';
+	let answer = [s[0]];
 
+	for (let i = 1; i < s.length; i++) {
+		let top = answer[answer.length - 1];
+		if (s[i] === top) answer.pop();
+		else answer.push(s[i]);
+	}
 	return answer;
 }
 console.log(solution('acbbcaa')); // a
diff --git a/JS/05.스택,큐,테크/05.공주구하기.js b/JS/05.스택,큐,테크/05.공주구하기.js
@@ -1,6 +1,19 @@
-function solution(s) {
-	let answer = '';
-
+function solution(n, k) {
+	let answer;
+	let temp = [];
+	for (let i = 1; i <= n; i++) {
+		temp[i - 1] = i;
+	}
+	temp[0] = -1;
+	let pos = 0;
+	let cnt = n;
+	while (cnt) {
+		for (let i = 1; i <= k; i++) {
+			temp[pos + k] == 0;
+		}
+		cnt--;
+	}
+	console.log(temp);
 	return answer;
 }
 console.log(solution(8, 3)); // 7
diff --git a/JS/05.스택,큐,테크/06.교육과정설계.js b/JS/05.스택,큐,테크/06.교육과정설계.js
@@ -1,7 +1,21 @@
-function solution(s) {
-	let answer = '';
+function solution(need, plan) {
+	let answer;
 
-	return answer;
+	let stack = [];
+	// stack에 need 순서를 거꾸로 입력해준다. CBA -> ABC
+	for (let i = 0; i < need.length; i++) {
+		stack[need.length - 1 - i] = need[i];
+	}
+
+	// C, B, A 순서대로 일치하는 것을 찾으면 pop해준다.
+	for (let i = 0; i < plan.length; i++) {
+		let top = stack[stack.length - 1];
+		if (top === plan[i]) stack.pop();
+	}
+
+	// 만약 stack의 length가 0이라면 순서대로 수업계획을 잘 짠 것이다.
+	if (stack.length === 0) return 'YES';
+	else return 'NO';
 }
 console.log(solution('CBA', 'CBDAGE')); // YES
 console.log(solution('CBA', 'CBDBAGE')); // YES
diff --git a/JS/05.스택,큐,테크/07.영화관람.js b/JS/05.스택,큐,테크/07.영화관람.js
@@ -1,5 +1,15 @@
-function solution(s) {
+function solution(nums) {
 	let answer = '';
+	let stack = [];
+	for (let i = 0; i < nums.length; i++) {
+		if (nums[i] >= nums[i + 1]) {
+			stack.pop();
+			stack.push(i+1, nums[i]);
+		} else {
+			if (stack[0][1] > nums[i])
+		}
+	}
+	console.log(stack);
 
 	return answer;
 }
diff --git a/JS/05.스택,큐,테크/08.좋은 단어.js b/JS/05.스택,큐,테크/08.좋은 단어.js
@@ -1,7 +1,14 @@
-function solution(s) {
+function solution(s, m) {
 	let answer = '';
 
-	return answer;
+	let cnt = 0;
+	for (let i = 0; i < s.length; i++) {
+		for (let j = i + 1; j < s.length; j++) {
+			// j와 i의 차이가 m보다 작거나 같아야하고, s[i]번 문자열의 길이와 j번째 문자열의 길이가 같아야 한다.
+			if (j - i <= m && s[i].length === s[j].length) cnt++;
+		}
+	}
+	return cnt;
 }
 console.log(solution(['back', 'seen', 'big', 'good', 'size'], 2)); // 3
 console.log(solution(['back', 'seen', 'good', 'size'], 2)); // 5
