Merge pull request #10 from algorithm-cote-study/yeji/week4

인프런 4주차

Author: seunggulee1007

src/main/java/sgyj/inflearn/yeji/week5/Solution41.java

@@ -0,0 +1,43 @@
+package sgyj.inflearn.yeji.week5;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+import java.util.Scanner;
+
+public class Solution41 {
+    // 공주구하기
+    public static int solution(int length, int target){
+        int answer = 0;
+        List<Integer> queue = new ArrayList<>();
+        List<Integer> result = new ArrayList<>();
+        int front = 0;
+        int rear = length-1;
+        for(int i=1; i<=length; i++){
+            queue.add( i );
+        }
+
+        int i = 1;
+        while ( !queue.isEmpty()){
+            if(i == target){
+                result.add( queue.get( front ) );
+                queue.remove( front );
+                i = 1;
+            }else{
+                queue.add(queue.get( front ));
+                queue.remove( front );
+                rear++;
+                i++;
+            }
+        }
+
+
+        return result.get( result.size()-1 );
+    }
+
+    public static void main(String[] args){
+        Scanner sc = new Scanner( System.in);
+        int[] input = Arrays.stream( sc.nextLine().split( " ")).mapToInt( Integer::parseInt).toArray();
+        System.out.println(solution(input[0],input[1]));
+    }
+}

src/main/java/sgyj/inflearn/yeji/week5/Solution42.java

@@ -0,0 +1,37 @@
+package sgyj.inflearn.yeji.week5;
+
+import java.util.Scanner;
+
+public class Solution42 {
+    // 교육과정설계
+    public static String solution(String target, String subjcet){
+        int index=0;
+        int[] result = new int[target.length()];
+        int compare = 0;
+        while(index<target.length()){
+            if(compare>=subjcet.length()){
+                compare = 0;
+            }
+            if(!subjcet.contains(String.valueOf( target.charAt( index ) ))){
+                return "NO";
+            }
+            if(target.charAt(index)==subjcet.charAt(compare)){
+                result[index] = compare;
+                index++;
+            }
+            compare++;
+        }
+        int min = result[0];
+        for(int i : result){
+            if(min>i) return "NO";
+        }
+        return "YES";
+    }
+
+    public static void main(String[] args){
+        Scanner sc = new Scanner( System.in);
+        String target = sc.nextLine();
+        String input = sc.nextLine();
+        System.out.println(solution(target,input));
+    }
+}

src/main/java/sgyj/inflearn/yeji/week5/Solution43.java

@@ -0,0 +1,48 @@
+package sgyj.inflearn.yeji.week5;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+import java.util.Scanner;
+
+public class Solution43 {
+    // 응급실
+    public static int solution(int n,int target, int[] hwanja){
+        int answer = 0;
+        List<Integer> compare = new ArrayList<>();
+        List<Integer> result = new ArrayList<>();
+        for(int i =0; i<hwanja.length; i++){
+            compare.add(i);
+        }
+        int front = 0;
+        int rear = n-1;
+        while(!compare.isEmpty()){
+            if(rear == front){
+                result.add(compare.get(front));
+                compare.remove(0);
+                rear = compare.size()-1;
+            }
+            if(rear<0) break;
+            if(hwanja[compare.get(front)]<hwanja[compare.get(rear)]){
+                int c = compare.get(front);
+                compare.remove(0);
+                compare.add(c);
+                rear = compare.size()-1;
+            }
+            rear--;
+        }
+        for(int i = 0; i<result.size(); i++){
+            if(target==result.get( i )){
+                answer=i+1;
+            }
+        }
+        return answer;
+    }
+
+    public static void main(String[] args){
+        Scanner sc = new Scanner( System.in);
+        int[] input1 = Arrays.stream( sc.nextLine().split( " ")).mapToInt( Integer::parseInt).toArray();
+        int[] input2 = Arrays.stream(sc.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
+        System.out.println(solution(input1[0],input1[1],input2));
+    }
+}

src/main/java/sgyj/inflearn/yeji/week5/Solution44.java

@@ -0,0 +1,42 @@
+package sgyj.inflearn.yeji.week5;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class Solution44 {
+    // 선택 정렬
+    public static void swap(int[] input,int findMinIndex, int index){
+        int tmp = input[index];
+        input[index] = input[findMinIndex];
+        input[findMinIndex] = tmp;
+    }
+
+    public static int[] solution(int n, int[] input){
+        int index = 0;
+        while(index < n){
+            int min = Integer.MAX_VALUE;
+            int findMinIndex = -1;
+            for(int i = index; i<n; i++){
+                if(input[i]<min){
+                    min = input[i];
+                    findMinIndex = i;
+                }
+            }
+            swap(input,findMinIndex,index);
+            index++;
+        }
+        return input;
+    }
+
+    public static void main(String[] args){
+        Scanner sc = new Scanner( System.in);
+        int n = sc.nextInt();
+        sc.nextLine();
+        int[] input = Arrays.stream( sc.nextLine().split( " ")).mapToInt( Integer::parseInt).toArray();
+        for(int i : solution( n,input )){
+            System.out.print(i+" ");
+        }
+    }
+
+
+}

src/main/java/sgyj/inflearn/yeji/week5/Solution45.java

@@ -0,0 +1,38 @@
+package sgyj.inflearn.yeji.week5;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class Solution45 {
+    // 버블정렬
+    public static void swap(int[] input,int findMinIndex, int index){
+        int tmp = input[index];
+        input[index] = input[findMinIndex];
+        input[findMinIndex] = tmp;
+    }
+
+    public static int[] solution(int n, int[] input){
+        int t = 0;
+        while(t<n-1){
+            int last = 0;
+            for(int j=n-1; j>t; j--){
+                if(input[j-1]>input[j]){
+                    swap(input,j-1,j);
+                }
+                last = j;
+            }
+            t = last;
+        }
+        return input;
+    }
+
+    public static void main(String[] args){
+        Scanner sc = new Scanner( System.in);
+        int n = sc.nextInt();
+        sc.nextLine();
+        int[] input = Arrays.stream( sc.nextLine().split( " ")).mapToInt( Integer::parseInt).toArray();
+        for(int i : solution(n,input)) {
+            System.out.print(i +  " ");
+        }
+    }
+}

src/main/java/sgyj/inflearn/yeji/week5/Solution46.java

@@ -0,0 +1,36 @@
+package sgyj.inflearn.yeji.week5;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class Solution46 {
+    // 삽입정렬
+    public static void swap(int[] input,int minIndex, int index){
+        int tmp = input[minIndex];
+        input[minIndex] = input[index];
+        input[index] = tmp;
+    }
+
+    public static int[] solution(int n, int[] input){
+        int k = 1;
+        while(k<n){
+            for(int i=k; i>0; i--){
+                if(input[i-1]>input[i]){
+                    swap(input,i-1,i);
+                }
+            }
+            k++;
+        }
+        return input;
+    }
+
+    public static void main(String[] args){
+        Scanner sc = new Scanner( System.in);
+        int n = sc.nextInt();
+        sc.nextLine();
+        int[] input = Arrays.stream( sc.nextLine().split( " ")).mapToInt( Integer::parseInt).toArray();
+        for(int i : solution(n,input)) {
+            System.out.print(i +  " ");
+        }
+    }
+}

src/main/java/sgyj/inflearn/yeji/week5/Solution47.java

@@ -0,0 +1,60 @@
+package sgyj.inflearn.yeji.week5;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class Solution47 {
+    // Least Recently Used
+    public static void moveCache(int[] input, int cache){
+        int first = input[0];
+        for(int i = 1; i<input.length; i++){
+            int next = input[i];
+            input[i] = first;
+            first = next;
+        }
+        input[0] = cache;
+    }
+
+    public static void restoreCache(int[] input, int targetIndex, int cache){
+        int first = input[0];
+        for(int i=1; i<=targetIndex; i++){
+            int next = input[i];
+            input[i] = first;
+            first = next;
+        }
+        input[0] = cache;
+    }
+
+    public static int[] solution(int n, int[] input){
+        int[] result = new int[n];
+        int target=0;
+        int i = 0;
+        while ( i< input.length ){
+            // 해야할 작업이 캐시에 없음
+            if(target == n-1){
+                target=0;
+                moveCache(result,input[i]);
+                i++;
+                continue;
+            }
+            if(result[target]==input[i]){
+                restoreCache(result,target,result[target]);
+                i++;
+                target=0;
+            }
+            if(result[target]!=input[i]){
+                target++;
+            }
+        }
+        return result;
+    }
+
+    public static void main(String[] args){
+        Scanner sc = new Scanner( System.in);
+        int[] input1 =  Arrays.stream(sc.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
+        int[] input2 = Arrays.stream( sc.nextLine().split( " ")).mapToInt( Integer::parseInt).toArray();
+        for(int i : solution(input1[0],input2)){
+            System.out.print(i+" ");
+        }
+    }
+}