Skip to content

Commit 356ceea

Browse files
GoogleokGoogleok
committed
java 알고리즘 강의 > 2. Array (1, 2차원 배열) - 1 ~ 4
1 parent dce66be commit 356ceea

4 files changed

Lines changed: 132 additions & 0 deletions

File tree

‎src/inflearn_course/Array/가위바위보.java‎

Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
package inflearn_course.Array;
2+
3+
import java.util.Scanner;
4+
5+
public class 가위바위보 {
6+
public static void main(String[] args) {
7+
가위바위보 T = new 가위바위보();
8+
Scanner kb = new Scanner(System.in);
9+
int n = kb.nextInt();
10+
int[] a = new int[n];
11+
int[] b = new int[n];
12+
for (int i = 0; i < n; i++) {
13+
a[i] = kb.nextInt();
14+
}
15+
16+
for (int i = 0; i < n; i++) {
17+
b[i] = kb.nextInt();
18+
}
19+
for (char x : T.solution(n, a, b).toCharArray()) {
20+
System.out.println(x);
21+
}
22+
}
23+
24+
private String solution(int n, int[] a, int[] b) {
25+
StringBuilder answer = new StringBuilder();
26+
for (int i = 0; i < n; i++) {
27+
if (a[i] == b[i]) answer.append("D");
28+
else if (a[i] == 1 && b[i] == 3) answer.append("A");
29+
else if (a[i] == 2 && b[i] == 1) answer.append("A");
30+
else if (a[i] == 3 && b[i] == 2) answer.append("A");
31+
else answer.append("B");
32+
}
33+
return answer.toString();
34+
}
35+
36+
}

‎src/inflearn_course/Array/보이는학생.java‎

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
package inflearn_course.Array;
2+
3+
import java.util.Scanner;
4+
5+
public class 보이는학생 {
6+
public static void main(String[] args) {
7+
보이는학생 T = new 보이는학생();
8+
Scanner kb = new Scanner(System.in);
9+
int n = kb.nextInt();
10+
int[] arr = new int[n];
11+
for (int i = 0; i < n; i++) {
12+
arr[i] = kb.nextInt();
13+
}
14+
System.out.println(T.solution(n, arr));
15+
}
16+
17+
public int solution(int n, int[] arr) {
18+
int answer = 1, max = arr[0];
19+
for (int i = 1; i < n; i++) {
20+
if (arr[i] > max) {
21+
answer++;
22+
max = arr[i];
23+
}
24+
}
25+
return answer;
26+
}
27+
28+
}

‎src/inflearn_course/Array/큰수출력하기.java‎

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
package inflearn_course.Array;
2+
3+
import java.util.ArrayList;
4+
import java.util.Scanner;
5+
6+
public class 큰수출력하기 {
7+
public static void main(String[] args) {
8+
큰수출력하기 T = new 큰수출력하기();
9+
Scanner kb = new Scanner(System.in);
10+
int n = kb.nextInt();
11+
int[] arr = new int[n];
12+
for (int i = 0; i < n; i++) {
13+
arr[i] = kb.nextInt();
14+
}
15+
16+
for (int x : T.solution(n, arr)) {
17+
System.out.print(x + " ");
18+
}
19+
}
20+
21+
private ArrayList<Integer> solution(int n, int[] arr) {
22+
ArrayList<Integer> answer = new ArrayList<>();
23+
answer.add(arr[0]);
24+
25+
for (int i = 1; i < n; i++) {
26+
if (arr[i] > arr[i - 1]) answer.add(arr[i]);
27+
}
28+
29+
return answer;
30+
}
31+
32+
33+
}

‎src/inflearn_course/Array/피보나치수열.java‎

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
package inflearn_course.Array;
2+
3+
import java.util.Scanner;
4+
5+
public class 피보나치수열 {
6+
public static void main(String[] args) {
7+
피보나치수열 T = new 피보나치수열();
8+
Scanner kb = new Scanner(System.in);
9+
int n = kb.nextInt();
10+
for (int x : T.solution(n)) {
11+
System.out.print(x + " ");
12+
}
13+
}
14+
15+
private int[] solution(int n) {
16+
int[] answer = new int[n];
17+
answer[0] = 1;
18+
answer[1] = 1;
19+
for (int i = 2; i < n; i++) {
20+
answer[i] = answer[i - 2] + answer[i - 1];
21+
}
22+
return answer;
23+
}
24+
25+
private void solution2(int n) {
26+
int a = 1, b = 1, c;
27+
System.out.println(a + " " + b + " ");
28+
for (int i = 2; i < n; i++) {
29+
c = a + b;
30+
System.out.print(c + " ");
31+
a = b;
32+
b = c;
33+
}
34+
}
35+
}

0 commit comments

Comments
 (0)