알고리즘 & 자료구조569 백준 9663 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; //N-Queen //https://www.acmicpc.net/problem/9663 public class Main9663 { static int N, ans; static int[] col; // col[i] : i번 행의 퀸은 col[i]번 열에 놓았다는 기록 //row번 ~ N번 행에 대해서 가능한 퀸을 놓는 경우의 수를 구하기 static void rec_func(int row) { if (row == N + 1) { //각 행마다 하나씩 잘 놓았다. ans++; } else { for (int c = 1; c 2022. 5. 22. 백준 14888 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; //연산자 끼워넣기 //https://www.acmicpc.net/problem/14888 public class Main14888 { static int N, max, min; static int[] nums, operators, order; static StringBuilder sb = new StringBuilder(); static int calculator() { int value = nums[1]; for (int i = 1; i 2022. 5. 19. 백준 15650 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; //N과 M(2) //https://www.acmicpc.net/problem/15650 public class BOJ15650 { static int N, M; static int[] selected, used; static StringBuilder sb = new StringBuilder(); static void rec_func(int k) { if (k == M + 1) { // 다 골랐다면 for (int i = 1; i 2022. 5. 19. 알고스팟 : JUMPGAME package algospot; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class JumpGame { public static int N; public static int[][] memo; public static int[][] map; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readL.. 2022. 4. 17. 내적 package programmers; public class DotProduct { public int solution(int[] a, int[] b) { int answer = 0; for (int i = 0; i < a.length; i++) { answer += (a[i] * b[i]); } return answer; } } 2022. 4. 16. 음양 더하기 package programmers; public class AddNegativeAndPositiveNumbers { public int solution(int[] absolutes, boolean[] signs) { int answer = 0; for (int i = 0; i < absolutes.length; i++) { if(signs[i]){ answer += absolutes[i]; }else{ answer += -1 * absolutes[i]; } } return answer; } } 2022. 4. 15. 이전 1 ··· 41 42 43 44 45 46 47 ··· 95 다음