24_03_20_과제

[김도완]

1번

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82

package t9_assignment;   import java.util.ArrayList;   // max,min / sort / search / merge / 통계(누적)     /*     정렬(sort)       10개의 난수(10~100)를 발생시켜서 ArrayList객체에 저장시킨후       원본/오름차순정렬/내림차순정렬 자료를 출력하시오.(ArrayList를 이용하세요)  */ public class Ass1 {     public static void main(String[] args) {         ArrayList<Integer> sort = new ArrayList<>();         for(int i = 0; i < 10; i++)         {             sort.add((int)(Math.random()*90) + 10);         }                  System.out.println("원본입니다~.");         for(int i = 0; i < sort.size(); i++)         {             System.out.print(sort.get(i)+" ");         } //        System.out.println("오름차순 정렬입니다."); //        Collections.sort(sort); //        for(int i = 0; i < sort.size(); i++) //        { //            System.out.println(sort.get(i)); //        } //        System.out.println("내림차순 정렬입니다."); //        Collections.sort(sort, Collections.reverseOrder()); //        for(int i = 0; i < sort.size(); i++) //        { //            System.out.println(sort.get(i)); //        }         System.out.println();         Integer[] nums = sort.toArray(new Integer[sort.size()]);                  System.out.println("오름차순입니다.");         for(int i = 0; i < sort.size(); i++)         {             for(int j = i+1; j < sort.size(); j++)             {                 if(nums[i] >= nums[j])                 {                     int temp;                     temp = nums[i];                     nums[i] = nums[j];                     nums[j] = temp;                 }             }         }         for(int i = 0; i < nums.length; i++)         {             System.out.print(nums[i]+" ");         }         System.out.println();                  System.out.println("내림차순입니다.");         for(int i = 0; i < sort.size(); i++)         {             for(int j = i+1; j < sort.size(); j++)             {                 if(nums[i] <= nums[j])                 {                     int temp;                     temp = nums[i];                     nums[i] = nums[j];                     nums[j] = temp;                 }             }         }         for(int i = 0; i < nums.length; i++)         {             System.out.print(nums[i]+" ");         }                       } }   Colored by Color Scripter

cs

2번

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33

package asds;   import java.util.ArrayList; import java.util.Collections;   //로또 번호 6개의 당첨번호를 만드는데 중복을 배제하여 오름차순으로 출력하세용~ //(단, ArrayList객체 써서만들기) public class sdsdfs {     public static void main(String[] args) {         ArrayList<Integer> Lotto = new ArrayList<Integer>();         for(int i = 0; i < 6; i++)         {             Lotto.add(0,((int)(Math.random()*45) + 1));             for(int j = Lotto.size()- 1; j > 0; j--)             {                 if(Lotto.get(j) == Lotto.get(0))                 {                     Lotto.remove(0);                     i--;                     break;                 }             }         }         Collections.sort(Lotto);                  for(int i = 0; i < 6; i++)         {             System.out.println(Lotto.get(i));         }     } }     Colored by Color Scripter

cs

3번

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

package t9_assignment;   import java.util.TreeSet;   //로또 번호 6개의 당첨번호를 만드는데 중복을 배제하여 오름차순으로 출력하세용~ //(단, set계열 써서만들기) public class Ass3 {     public static void main(String[] args) {         TreeSet<Integer> Lotto = new TreeSet<Integer>();         while(Lotto.size() < 6)         {             Lotto.add((int)(Math.random()*45) + 1);         }         for(Integer n1 : Lotto)         {             System.out.println(n1+" ");         }     } }   Colored by Color Scripter

cs

4번

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

package t9_assignment;   import java.util.ArrayList; import java.util.Scanner;   /*     그린 중학교 1반에서 3반의 명단이 다으과 같다,     이때 ArrayList에 각 반별로 저장 시켜놓고, ArrayList에 저장된 각반의 자료를 출력시켜보자.     또,반을 입력하면 그반의 학생들을 출력해주세요.      1반: 홍길동, 김말숙, 이기자     2반: 소나무, 대나무, 감나무, 밤나무     3반: 오사랑, 하나로, 행복해  */ public class Ass4 {     public static void main(String[] args) {         Scanner sc = new Scanner(System.in);         ArrayList<String[]> namelist = new ArrayList<String[]>();         String[] strArr1 = {"1반", "홍길동", "김말숙", "이기자"};         String[] strArr2 = {"2반", "소나무", "대나무", "감나무", "밤나무"};         String[] strArr3 = {"3반", "오사랑", "하나로", "행복해"};          namelist.add(strArr1);          namelist.add(strArr2);          namelist.add(strArr3);                    while(true)          {              System.out.print("원하는 반을 입력해주세요(종료는0입력):");              int ans = sc.nextInt();              if(ans == 0) break;              else if(ans > 3 || ans < 0)              {                  System.out.println("입력이 잘못되었습니다. 다시입력해주세요.");                  continue;              }              for(int i = 0; i < namelist.get(ans-1).length; i++)              {                  if(i == namelist.get(ans-1).length - 1) System.out.print(namelist.get(ans-1)[i]);                  else  System.out.print(namelist.get(ans-1)[i] + ", ");              }              System.out.println();          }          System.out.println("종료되었습니다.");          sc.close();     } }   Colored by Color Scripter

cs

[행복]

기본알고리즘에 충실하게 처리 잘 하셨네요. 수고하셨습니다.