정렬과 그리디 알고리즘 풀이

devbit4 · devbit4 · commit 31a6eecfec37 · 2023-04-28T17:02:46.000+09:00
diff --git a/섹션6/5.쇠막대기.html b/섹션6/5.쇠막대기.html
diff --git a/섹션6/6.공주구하기.html b/섹션6/6.공주구하기.html
diff --git a/섹션7/10.이분검색.html b/섹션7/10.이분검색.html
@@ -0,0 +1,29 @@
+<html>
+  <head>
+    <meta charset="UTF-8" />
+    <title>출력결과</title>
+  </head>
+  <body>
+    <script>
+      function solution(target, arr) {
+        let answer;
+        arr.sort((a, b) => a - b);
+        let lt = 0,
+          rt = arr.length - 1;
+        while (lt <= rt) {
+          let mid = parseInt((lt + rt) / 2);
+          if (arr[mid] === target) {
+            answer = mid + 1;
+            break;
+          } else if (arr[mid] > target) rt = mid - 1;
+          else lt = mid + 1;
+        }
+
+        return answer;
+      }
+
+      let arr = [23, 87, 65, 12, 57, 32, 99, 81];
+      console.log(solution(32, arr));
+    </script>
+  </body>
+</html>
diff --git a/섹션7/2.버블정렬.html b/섹션7/2.버블정렬.html
@@ -7,13 +7,15 @@
     <script>
       function solution(arr) {
         let answer = arr;
+
         for (let i = 0; i < arr.length - 1; i++) {
           for (let j = 0; j < arr.length - i - 1; j++) {
             if (arr[j] > arr[j + 1]) {
               [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
             }
           }
         }
+
         return answer;
       }
 
diff --git a/섹션7/3.스페셜정렬.html b/섹션7/3.스페셜정렬.html
@@ -0,0 +1,34 @@
+<html>
+  <head>
+    <meta charset="UTF-8" />
+    <title>출력결과</title>
+  </head>
+  <body>
+    <script>
+      function solution(arr) {
+        let answer = [];
+
+        for (let x of arr) {
+          if (x < 0) {
+            answer.push(x);
+          }
+        }
+        for (let x of arr) {
+          if (x > 0) {
+            answer.push(x);
+          }
+        }
+        // for (let x of arr) {
+        //   if (x < 0) answer.push(x);
+        // }
+        // for (let x of arr) {
+        //   if (x > 0) answer.push(x);
+        // }
+        return answer;
+      }
+
+      let arr = [1, 2, 3, -3, -2, 5, 6, -6];
+      console.log(solution(arr));
+    </script>
+  </body>
+</html>
diff --git a/섹션7/4.삽입정렬.html b/섹션7/4.삽입정렬.html
@@ -1,4 +1,4 @@
-<html>
+<!-- <html>
   <head>
     <meta charset="UTF-8" />
     <title>출력결과</title>
@@ -7,22 +7,27 @@
     <script>
       function solution(arr) {
         let answer = arr;
+
         for (let i = 0; i < arr.length; i++) {
-          let tmp = arr[i],
-            j;
-          for (j = i - 1; j >= 0; j--) {
-            if (arr[j] > tmp) arr[j + 1] = arr[j];
-            else break;
-          }
-          arr[j + 1] = tmp;
+          let temp = arr[i];
         }
+
+        // for (let i = 0; i < arr.length; i++) {
+        //   let tmp = arr[i],
+        //     j;
+        //   for (j = i - 1; j >= 0; j--) {
+        //     if (arr[j] > tmp) arr[j + 1] = arr[j];
+        //     else break;
+        //   }
+        //   arr[j + 1] = tmp;
+        // }
       }
 
       let arr = [11, 7, 5, 6, 10, 9];
       console.log(solution(arr));
     </script>
   </body>
-</html>
+</html> -->
 
 <html>
   <head>
@@ -34,14 +39,24 @@
       function solution(arr) {
         let answer = [];
         answer.push(arr[0]);
+
         for (let i = 1; i < arr.length; i++) {
           for (let j = 0; j < answer.length; j++) {
             if (arr[i] < answer[j]) {
-              answer.splice(j, 0, arr[i]);
+              answer.slice(j, 0, arr[i]);
               break;
             }
           }
         }
+
+        // for (let i = 1; i < arr.length; i++) {
+        //   for (let j = 0; j < answer.length; j++) {
+        //     if (arr[i] < answer[j]) {
+        //       answer.splice(j, 0, arr[i]);
+        //       break;
+        //     }
+        //   }
+        // }
         return answer;
       }
 
diff --git a/섹션7/6.장난꾸러기현수.html b/섹션7/6.장난꾸러기현수.html
@@ -0,0 +1,26 @@
+<html>
+  <head>
+    <meta charset="UTF-8" />
+    <title>출력결과</title>
+  </head>
+  <body>
+    <script>
+      function solution(arr) {
+        let answer = [];
+
+        let sortArr = [...arr].sort((a, b) => a - b);
+
+        for (let i = 0; i < sortArr.length; i++) {
+          if (arr[i] !== sortArr[i]) {
+            answer.push(i + 1);
+          }
+        }
+
+        return answer;
+      }
+
+      let arr = [120, 125, 152, 130, 135, 135, 143, 127, 160];
+      console.log(solution(arr));
+    </script>
+  </body>
+</html>
diff --git a/섹션7/7.좌표정렬.html b/섹션7/7.좌표정렬.html
@@ -0,0 +1,32 @@
+<html>
+  <head>
+    <meta charset="UTF-8" />
+    <title>출력결과</title>
+  </head>
+  <body>
+    <script>
+      function solution(arr) {
+        let answer = arr;
+
+        arr.sort((a, b) => {
+          if (a[0] === b[0]) {
+            return a[1] - b[1];
+          }
+
+          return a[0] - b[0];
+        });
+
+        return answer;
+      }
+
+      let arr = [
+        [2, 7],
+        [1, 3],
+        [1, 2],
+        [2, 5],
+        [3, 6],
+      ];
+      console.log(solution(arr));
+    </script>
+  </body>
+</html>
diff --git a/섹션7/8.회의실 배정.html b/섹션7/8.회의실 배정.html
@@ -0,0 +1,44 @@
+<html>
+  <head>
+    <meta charset="UTF-8" />
+    <title>출력결과</title>
+  </head>
+  <body>
+    <script>
+      function solution(meeting) {
+        let answer = 0;
+        meeting.sort((a, b) => {
+          if (a[1] === b[1]) return a[0] - b[0];
+          else return a[1] - b[1];
+        });
+
+        console.log(meeting);
+        let et = 0;
+
+        for (let x of meeting) {
+          if (x[0] >= et) {
+            answer++;
+            et = x[1];
+          }
+        }
+        // let et = 0;
+        // for (let x of meeting) {
+        //   if (x[0] >= et) {
+        //     answer++;
+        //     et = x[1];
+        //   }
+        // }
+        return answer;
+      }
+
+      let arr = [
+        [1, 4],
+        [2, 3],
+        [3, 5],
+        [4, 6],
+        [5, 7],
+      ];
+      console.log(solution(arr));
+    </script>
+  </body>
+</html>
diff --git a/섹션7/9.결혼식.html b/섹션7/9.결혼식.html
@@ -0,0 +1,50 @@
+<html>
+  <head>
+    <meta charset="UTF-8" />
+    <title>출력결과</title>
+  </head>
+  <body>
+    <script>
+      function solution(times) {
+        let answer = Number.MIN_SAFE_INTEGER;
+
+        let T_line = [];
+
+        for (let x of times) {
+          T_line.push([x[0], 's']);
+          T_line.push([x[1], 'e']);
+        }
+
+        T_line.sort((a, b) => {
+          if (a[0] === b[0]) {
+            return a[1].charCodeAt() - b[1].charCodeAt();
+          }
+
+          return a[0] - b[0];
+        });
+
+        let cnt = 0;
+
+        for (let x of T_line) {
+          if (x[1] === 's') {
+            cnt++;
+          } else {
+            cnt--;
+          }
+          answer = Math.max(cnt, answer);
+        }
+
+        return answer;
+      }
+
+      let arr = [
+        [14, 18],
+        [12, 15],
+        [15, 20],
+        [20, 30],
+        [5, 14],
+      ];
+      console.log(solution(arr));
+    </script>
+  </body>
+</html>

Original file line number	Diff line number	Diff line change
`@@ -7,13 +7,15 @@`
`7`	`7`	`<script>`
`8`	`8`	`function solution(arr) {`
`9`	`9`	`let answer = arr;`
	`10`	`+`
`10`	`11`	`for (let i = 0; i < arr.length - 1; i++) {`
`11`	`12`	`for (let j = 0; j < arr.length - i - 1; j++) {`
`12`	`13`	`if (arr[j] > arr[j + 1]) {`
`13`	`14`	`[arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];`
`14`	`15`	`}`
`15`	`16`	`}`
`16`	`17`	`}`
	`18`	`+`
`17`	`19`	`return answer;`
`18`	`20`	`}`
`19`	`21`