ALGORITHM 🤖/Programmers

https://school.programmers.co.kr/learn/courses/30/lessons/120814 class Solution { public int solution(int n) { int answer = 0; if(n % 7 != 0){ //n을 7로 나눈 나머지가 0이 아니라면 answer += n / 7 + 1; //n을 7로 나눈 몫에 1을 더해서 return } else{ answer = n / 7; //n이 7로 나누어 떨어지면 그 몫을 return } return answer; } } → 만약 8명이면 최소 2판이 필요하기 때문에 7로 나눈 후 나머지가 있을 경우 +1을 해줘야 하고, 7로 나누어 떨어지는 경우 7명 당 1판씩 먹으면 되기 때문에 몫만 리턴해주면 된다!

https://school.programmers.co.kr/learn/courses/30/lessons/120841 class Solution { public int solution(int[] dot) { int answer = 0; if (dot[0] > 0 && dot[1] > 0){ //1사분면 answer = 1; } else if (dot[0] 0){ //2사분면 answer = 2; } else if (dot[0] 0 && dot[1] < 0){ //4사분면 answer = 4; } return answer; } } → 여기서 dot[0]은 x좌표, dot[1]..

https://school.programmers.co.kr/learn/courses/30/lessons/120824 class Solution { public int[] solution(int[] num_list) { int[] answer = new int [2]; int evv=0; //짝수 int odd=0; //홀수 for(int i = 0; i < num_list.length; i++){ if(num_list[i] % 2 == 0){ evv++; } else{ odd++; } } answer[0] = evv; answer[1] = odd; return answer; } }

https://school.programmers.co.kr/learn/courses/30/lessons/120809 class Solution { public int[] solution(int[] numbers) { int[] answer = new int [numbers.length]; for(int i = 0; i < numbers.length; i++){ answer[i] = numbers[i] * 2; } return answer; } }

https://school.programmers.co.kr/learn/courses/30/lessons/120817 class Solution { public double solution(int[] numbers) { double answer = 0; int sum = 0; for (int i=0; i < numbers.length; i++){ sum += numbers[i]; } answer = (double)sum/numbers.length; return answer; } }

https://school.programmers.co.kr/learn/courses/30/lessons/120831?language=java class Solution { public int solution(int n) { int answer = 0; for(int i = 1; i

https://school.programmers.co.kr/learn/courses/30/lessons/120830 def solution(n, k): answer = n * 12000 + k * 2000 - (n//10) * 2000 return answer