Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 11 additions & 0 deletions hanghae-java-study-12.iml
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
<?xml version="1.0" encoding="UTF-8"?>
<module type="JAVA_MODULE" version="4">
<component name="NewModuleRootManager" inherit-compiler-output="true">
<exclude-output />
<content url="file://$MODULE_DIR$">
<sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
</content>
<orderEntry type="inheritedJdk" />
<orderEntry type="sourceFolder" forTests="false" />
</component>
</module>
3 changes: 3 additions & 0 deletions src/LEESEUNGRYEOL/report1/Report1_1
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
2-4번 문제

정답 : 1,2,3,4,5
9 changes: 9 additions & 0 deletions src/LEESEUNGRYEOL/report1/Report1_2
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
2-7번 번 문제

정답 : 1: 12
2: true
3: 131
4: 51
5: 99
6: Java
7: 오류
28 changes: 28 additions & 0 deletions src/LEESEUNGRYEOL/report1/Report1_3.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
package LEESEUNGRYEOL.report1;
// 2-8번 문제
public class Report1_3 {
public static void main(String[] args) {
AddClass addClass = new AddClass();
addClass.test();
}
}

// 필요하다면 클래스 추가
class AddClass {
void test() {
int x = 1;
int y = 2;
int z = 3;

int tmp;

tmp = x;
x = y;
y = z;
z = tmp;

System.out.println("x=" + x);
System.out.println("y=" + y);
System.out.println("z=" + z);
}
}
3 changes: 3 additions & 0 deletions src/LEESEUNGRYEOL/report2/Report2_1
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
3-1번 문제

정답 : 4,5
13 changes: 13 additions & 0 deletions src/LEESEUNGRYEOL/report2/Report2_2
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
3-2번 문제

정답:
true (y가 0보다 크기 때문에)
13 ( 15-2 = 13 )
5 ( 3 + 2 = 5 )
false (
2 (c의 아스키코드는 68 - 65 = 3)
5 ('5'의 아스키코드 53에서 '0'의 아스키코드 48을 빼면 53 - 48 = 5)
66 (65 + 1 = 66 => 'B'의 아스키코드)
B (66 => 'B'의 아스키코드)
B (참조 후 연산이므로 아직,66 =>'B'의 아스키코드)
C (c++ 로 참조 된 이후에 67이 되었으므로 67 => 'C'의 아스키 코드)
18 changes: 18 additions & 0 deletions src/LEESEUNGRYEOL/report2/Report2_3.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
package LEESEUNGRYEOL.report2;
// 3-3번 문제
public class Report2_3 {
public static void main(String[] args) {
Find_num findNum = new Find_num();
int num = 456;
findNum.result(num);
}
}

class Find_num{
void result(int num)
{
int remainder = num % 100;
int result = num - remainder;
System.out.println(result);
}
}
28 changes: 28 additions & 0 deletions src/LEESEUNGRYEOL/report2/Report2_4.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
package LEESEUNGRYEOL.report2;
// 3-4번 문제
public class Report2_4 {
public static void main(String[] args){

int numOfApples = 1431; // 사과의 개수
int sizeOfBucket = 10; // 바구니의 크기(바구니에 담을 수 있는 사과의 개수)
Find_bucket find_bucket = new Find_bucket();
find_bucket.result(numOfApples,sizeOfBucket);

}
}

class Find_bucket{
void result(int a, int b)
{
int numOfBucket;
if (a%b != 0)
{
numOfBucket = (a/b + 1); // 모든 사과를 담는데 필요한 바구니의 수
}
else {
numOfBucket = a/b;
}
System.out.println("필요한 바구니의 수 :"+numOfBucket);
}

}
18 changes: 18 additions & 0 deletions src/LEESEUNGRYEOL/report2/Report2_5.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
package LEESEUNGRYEOL.report2;
// 3-5번
public class Report2_5 {
public static void main(String[] args) {
int num = 10;
Num_Category num_category = new Num_Category();
num_category.print_category(num);
}
}

class Num_Category{
void print_category(int num)
{
String result;
result = num > 0 ? "양수" : (num == 0 ? "0" : "음수");
System.out.println(result);
}
}
36 changes: 36 additions & 0 deletions src/LEESEUNGRYEOL/report2/Report2_6.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
package LEESEUNGRYEOL.report2;
// 3-6번 문제
public class Report2_6 {
public static void main(String[] args) {
int fahrenheit = 100;
Calculate_cel calculate_cel = new Calculate_cel();
calculate_cel.cal(fahrenheit);

// int a = 3;
// float b = 5/9f;
// float c = a*b;
// System.out.println(b);
}
}

class Calculate_cel{
void cal(int fahrenheit)
{
float celcius;
celcius = (5/9f) * (fahrenheit -32);
int a = (int) (celcius * 1000);

// b = 올림할껀지 반올림할껀지 판단하는 숫자
int b = a % 10;
if (b >= 5)
{
a += 10;
}
a = a/10;

celcius = (float) (a * 0.01);

System.out.println("Fahrenheit:" + fahrenheit);
System.out.println("Celcius:" + celcius);
}
}
20 changes: 20 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_1
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
// 4-1번 문제

정답 :

1. int형 변수 x가 10보다 크고 20보다 작을 때 true인 조건식
답: 10 < x && x <20
2. char형 변수 ch가 공백이나 탭이 아닐 때 true인 조건식
답: ch != ' ' && ch != '\t'
3. char형 변수 ch가 'x' 또는 'X'일 때 true인 조건식
답: ch == 'x' || ch == 'X'
4. char형 변수 ch가 숫자('0'~'9')일 때 true인 조건식
답: ch >= '0' && ch <= '9'
5. char형 변수 ch가 영문자(대문자 또는 소문자)일 때 true인 조건식
답: ch >= 'a' && ch < 'Z'
6. int형 변수 year가 400으로 나눠떨어지거나 또는 4로 나눠떨어지고 100으로 나눠떨어지지 않을때 true인 조건식
답: year%400 ==0 || year%400==0 && year%100 !=0
7. boolean형 변수 powerOn이 false일 때 true인 조건식
답: !(powerOn = false)
8. 문자열 참조변수 str이 "yes"일 때 true인 조건식
답: str.equals("yes")
32 changes: 32 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_10.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
package LEESEUNGRYEOL.report3;
//4-10 문제
public class Report3_10 {
public static void main(String[] args) {
// 1~100사이의 임의의 값을 얻어서 answer에 저장한다.
int answer = (int) (Math.random()*100 + 1);
int input = 0; //사용자입력을 저장할 공간
int count = 0; //시도횟수를 세기위한 변수

// 화면으로 부터 사용자입력을 받기 위해서 Scanner클래스 사용
java.util.Scanner s = new java.util.Scanner(System.in);
do {
count++;
System.out.print("1과 100사이의 값을 입력하세요 : ");
input = s.nextInt(); //입력받은 값을 변수 input에 저장한다.
if(answer < input)
{
System.out.println("더 작은 수를 입력하세요.");
}
if(answer == input) {
System.out.println("맞혔습니다.");
System.out.println("시도횟수는 " + count + "번입니다.");
break;
}
if(answer > input)
{
System.out.println("더 큰 수를 입력하세요.");
}
} while(true); //무한반복문
} // end of main

}
14 changes: 14 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_2.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
package LEESEUNGRYEOL.report3;
// 4-2번 문제
public class Report3_2 {
public static void main(String[] args){
int sum = 0;
for (int i = 1; i <= 10 ; i++) {
if(i%2 != 0 && i%3 != 0)
{
sum += i;
}
}
System.out.println("sum = " + sum);
}
}
21 changes: 21 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_3.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
package LEESEUNGRYEOL.report3;
// 4-3 문제
public class Report3_3 {
public static void main(String [] args)
{
int sum = 0;
int totalSum = 0;

for (int i = 1; i < 6 ; i++) {

for (int j = 1; j <= i; j++) {
sum += j;
}

totalSum += sum;
sum = 0;
}

System.out.println("totalSum = " + totalSum);
}
}
32 changes: 32 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_4.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
package LEESEUNGRYEOL.report3;
// 4-4 문제
public class Report3_4 {
public static void main(String [] args)
{
int sum = 0;
int s = 1;
int num = 0;



while (sum < 5)
{
num++;

if(s == 1)
{
sum = sum + num;
}
else
{
sum = sum -num;
}

s = -s;
}

System.out.println("num = " + num);
System.out.println("sum = " + sum);
}

}
27 changes: 27 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_5.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
package LEESEUNGRYEOL.report3;

// 4-5 문제
public class Report3_5 {
public static void main(String args[]) {
int i = 0, j = 0;


while (i < 5)
{
//i = 2 j = 3

while (j <= i) {
System.out.print('*');
j++;
}


i++;
j = 0;
System.out.println();

}


}
}
15 changes: 15 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_6.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
package LEESEUNGRYEOL.report3;
//4-6 문제
public class Report3_6 {
public static void main(String [] args)
{
for (int i = 1; i <= 6; i++) {
for (int j = 1; j <= 6 ; j++) {
if( i + j == 6)
{
System.out.println("(" + i +","+ j+")");
}
}
}
}
}
17 changes: 17 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_7.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
package LEESEUNGRYEOL.report3;
//4-7 문제
public class Report3_7 {
public static void main(String[] args) {
String str = "12345";
int sum = 0;;
int number;


for (int i = 0; i < str.length(); i++) {
number = str.charAt(i) - 48;
sum += number;
}

System.out.println("sum=" + sum);
}
}
8 changes: 8 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_8.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
package LEESEUNGRYEOL.report3;
//4-8 문제
public class Report3_8 {
public static void main(String[] args){
int value = (int) (Math.random()*6 + 1);
System.out.println("value:"+value);
}
}
19 changes: 19 additions & 0 deletions src/LEESEUNGRYEOL/report3/Report3_9.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
package LEESEUNGRYEOL.report3;
//4-9 문제
public class Report3_9 {
public static void main(String[] args) {
int num = 12345;
int sum = 0;
int a =1,b =1;

while (a != 0)
{
a = num / 10;
b = num % 10;
sum = sum +b;
num = a;
}

System.out.println("sum="+sum);
}
}
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading