[최재영] 8_3

goawmfhfl/3_1.js

@@ -0,0 +1,55 @@
+// 🌟 문제 풀이 🌟
+
+function solution(s){
+    let answer = "NO"
+    const lowerCase = s.toLowerCase()
+
+    for(let i=0; i<s.length; i++){
+        if(lowerCase.indexOf(lowerCase[0]) === lowerCase.indexOf(lowerCase[s.length-1])) answer="YES"
+    }
+    return answer;
+}
+
+console.log(solution("gooG"));
+
+// 🧑🏻‍💻 다른 문제 풀이 🧑🏻‍💻
+
+function solution(s) {
+    const lowerStr = s.toLowerCase();
+    if ([...lowerStr].reverse().join("") === lowerStr) {
+    return "YES";
+    }
+    return "NO";
+    }
+
+    let str = "gooG"
+    console.log(solution(str));
+
+
+// 👨🏻‍🏫 강사님 문제 풀이 1 👨🏻‍🏫
+
+function solution(s){
+    let answer = "YES"
+    s=s.toLowerCase();
+    let len = s.length;
+    for(let i=0; i<Math.floor(len/2); i++){
+        if(s[i]!==s[len-i-1]) return "NO"
+    }
+    return answer;
+}
+
+let str = "gooG"
+console.log(solution(str));
+
+// 👨🏻‍🏫 강사님 문제 풀이 2 👨🏻‍🏫
+
+function solution(s){
+    let answer = "YES"
+    s=s.toLowerCase();
+    if(s.split('').reverse().join('') !== s) return "NO"
+
+    return answer;
+}
+
+let str = "gooG"
+console.log(solution(str));

goawmfhfl/3_2.js

@@ -0,0 +1,11 @@
+// 👨🏻‍🏫 강사님 문제 풀이 1 👨🏻‍🏫
+
+function solution(s){
+    let answer = "YES";
+    s=s.toLowerCase().replace(/[^a-z]/g,'')
+    if(s.split('').reverse().join('') !== s) return "NO"
+    return answer;
+}
+
+let str ="found7, time:, study, Yduts;, emit, 7Dnuof"
+console.log(solution(str));

goawmfhfl/3_3.js

@@ -0,0 +1,27 @@
+// 🌟 문제 풀이 🌟
+
+function solution(arr){
+    let answer = ''
+
+    for(let x of arr){
+        if(!isNaN(x)) answer+=x
+    }   
+    return parseInt(answer);
+}
+
+let str = "g0en2R0s8eSoft"
+console.log(solution(str));
+
+// 👨🏻‍🏫 강사님 문제 풀이 👨🏻‍🏫
+
+function solution(string){
+    let answer = 0;
+
+    for(let x of string){
+        if(!isNaN(x)) answer = answer*10+Number(x);
+        }   
+    return parseInt(answer);
+}
+
+let str = "g0en2R0s8eSoft"
+console.log(solution(str));

goawmfhfl/3_4.js

@@ -0,0 +1,36 @@
+// 🌟 문제 풀이 🌟
+
+function solution(s,t){
+    let answer = new Array(s.length).fill(0)
+    let cnt = 1000;
+
+    for(let i=0; i<s.length; i++){
+        if(s[i] === t) {
+            cnt = 0;
+            answer[i] = cnt
+        }
+        else{
+            cnt ++
+            answer[i] = cnt
+        }
+    }
+    console.log(answer);
+
+    cnt = 1000
+
+    for(let i=s.length-1; i>=0; i--){
+        if(s[i] === t){
+            cnt = 0
+            answer[i] = cnt
+        }
+        else{
+            cnt++
+            answer[i]= Math.min(answer[i],cnt)
+        }
+    }
+
+    return answer;
+}
+
+let str = "teachermode"
+console.log(solution(str,'e'));

goawmfhfl/3_5.js

@@ -0,0 +1,19 @@
+// 🌟 문제 풀이 🌟
+
+function solution(s){
+    let answer = [];
+    let cnt = 1;
+
+    for(let i=0; i<s.length; i++){
+        if (s[i]===s[i+1])cnt++
+        else{
+            answer.push(s[i])
+            if(cnt>1) answer.push(String(cnt))
+            cnt = 1
+        }
+    }
+    return answer.join('');
+}
+
+let str = "KKHSSSSSSSE"
+console.log(solution(str));