[java] 백준 14888 : 연산자 끼워넣기

문제

https://www.acmicpc.net/problem/14888

14888번: 연산자 끼워넣기

 

 

코드

package main;
import java.util.*;

public class Main {

	static int max=Integer.MIN_VALUE;
	static int min=Integer.MAX_VALUE;
	static int n;
	static int[] op;
	static int[] numbers;
	public static void main(String[] args) {
	
	Scanner sc = new Scanner(System.in);
	n = sc.nextInt();
	numbers = new int[n];

	for(int i=0; i<n ;i++) {
		numbers[i]= sc.nextInt();
		}
	
	op = new int[4];
	for(int i=0; i<4 ;i++) {
		op[i]= sc.nextInt();
		}
	
	DFS(numbers[0],1);
	
	System.out.println(max);
	System.out.println(min);
	
	}
	
	static void DFS(int number, int idx) {
		if(idx==n) {
			max = Math.max(number, max);
			min = Math.min(number, min);
		}
		
		for(int i=0; i<4; i++) {
			if(op[i]>0) {
				op[i]--;
				if(i==0) {
					DFS(number+numbers[idx],idx+1);
				}
				else if(i==1) {
					DFS(number-numbers[idx],idx+1);
				}
				else if(i==2) {
					DFS(number*numbers[idx],idx+1);
				}
				else if(i==3) {
					DFS(number/numbers[idx],idx+1);
				}
				op[i]++;
			}
		
		}
	}

}

 

 

참고

https://st-lab.tistory.com/121