roakfwk30 / algorithm star
안효원 안효원 2022-03-02
cleaner
@d308520fa4da8d3070165555e9da5733b0398511
 
d308520
al01/section2/2.js (added)
+++ al01/section2/2.js
@@ -0,0 +1,16 @@
+
+
+function solution(arr){
+
+    if(arr.length < 1 || arr.length > 1000) return "error";
+
+    for(let i = arr.length - 1; i >= 1; i--){
+        if(arr[i] <= arr[i - 1]){
+            arr.splice(i, 1);
+        }
+    }
+    return arr.length;    
+
+}
+
+console.log(solution([130, 135, 148, 140, 150, 150, 153]));(No newline at end of file)
 
d308520
al01/section2/3.js (added)
+++ al01/section2/3.js
@@ -0,0 +1,28 @@
+//  가위 : 1   바위 : 2   보 : 3
+
+function solution(arrA, arrB){
+
+    if(arrA.length != arrB.length) return console.log("error");;
+
+    for(let i = 0; i < arrA.length; i++){
+        if(arrA[i] == 1){
+            if(arrB[i] == 2) console.log("B");
+            else if(arrB[i] == 3) console.log("A");
+            else if(arrB[i] == 1) console.log("B");
+            else return "error";
+        }else if(arrA[i] == 2){
+            if(arrB[i] == 1) console.log("A");
+            else if(arrB[i] == 3) console.log("B");
+            else if(arrB[i] == 2) console.log("D");
+            else return console.log("error");
+        }else if(arrA[i] == 3){
+            if(arrB[i] == 1) console.log("B");
+            else if(arrB[i] == 2) console.log("A");
+            else if(arrB[i] == 3) console.log("D");
+            else return "error";
+        }else console.log("error");
+    }
+
+}
+
+solution([2, 3, 3, 1, 3], [1, 1, 2, 2, 3]);(No newline at end of file)
Add a comment
List