Level 0
class Solution {
public int solution(int num1, int num2) {
int answer = 0;
if((num1 > 0 && num1 <=100) && (num2 > 0 && num2 <=100)){
answer = (int) (num1 / num2);
}
return answer;
}
}
// sol 1.
class Solution {
public int solution(int num1, int num2) {
int answer = 0;
answer = num1 * num2;
return answer;
}
}
// sol 2.
class Solution {
public int solution(int num1, int num2) {
boolean val = (0<num1 && num1 <=100 && 0< num2 && num2 <=100);
int answer = 0;
if(val){
answer = num1/num2;
}else{
answer = -1;
}
return answer;
}
}
// sol 1.
=> 확인!
class Solution {
public int solution(int num1, int num2) {
int answer = 0;
if((num1 > 0 && num1 <=100) && (num2 > 0 && num2 <=100)){
answer = (int) (num1 / num2);
}
return answer;
}
}
// sol 2.
=> 확인!
class Solution {
public int solution(int num1, int num2) {
boolean test = (0 < num1 && num1 ≤ 100 && 0 < num2 && num2 ≤ 100);
int answer = -1;
if(test){
answer = num1 % num2;
}else{
answer = -1;
}
return answer;
}
}
class Solution {
public int solution(int angle) {
int answer = 0;
if(0 < angle && angle < 90){
answer = 1;
} else if(angle == 90){
answer = 2;
} else if(90 < angle && angle < 180){
answer = 3;
} else if(angle == 180){
answer = 4;
} else{
answer = -1;
}
return answer;
}
}
'이직준비 > 목표1_코테1(2210)' 카테고리의 다른 글
| Level 3-2 ( 1)이중우선순위큐 2)야근 지수 ) (0) | 2022.11.09 |
|---|---|
| Level 3-1 ( 1)불량 사용자 ) (0) | 2022.11.09 |
| Level 2 (1) | 2022.10.18 |
| Level 1 (0) | 2022.10.18 |
| 목차 (0) | 2022.10.18 |