xxheexx

완전탐색으로 구현 import java.util.*; import java.io.*; public class Main { static int N; static Vector v; static Stack st; static void print(){ if(st.size()==N) { for(int num:st){ System.out.print(num+" "); } System.out.println(); return; } for(int i=1;i

코드 import java.util.*; import java.io.*; class Solution { public String[] solution(String[] strings, int n) { String[] answer = {}; PriorityQueue pq = new PriorityQueue(); PriorityQueue stringspq = new PriorityQueue(); Vector v = new Vector(); Vector stringsv = new Vector(); for(int i=0;i