package algo_programmers;

import java.util.*;

public class Algo_Programmers_03 {
	
	  public static int[] solution(int[] numbers) {
	        int[] answer = {};
	        List <Integer> temp = new ArrayList<Integer>();
	        List <Integer> answerList = new ArrayList<Integer>();
	        
	        //  Á¤ºÎ ¹è¿­ numbers ¼­·Î ´Ù¸¥ index ¿¡ ÀÖ´Â µÎ °³ÀÇ ¼ö¸¦ »Ì¾Æ ´õÇؼ­ ¸¸µé ¼ö ÀÖ´Â
	        //  ¸ðµç ¼ö¸¦ ¹è¿­¿¡ ¿À¸§Â÷¼øÀ¸·Î ´ã¾Æ Return
	        for(int i=0; i<numbers.length; i++) {
	            for(int j=0; j<numbers.length; j++) {
	                if(i != j) {
	                    int plus = numbers[i] + numbers[j];
	                    temp.add(plus);
	                }
	            }
	        }
	        for(int each : temp) {
	            if(!answerList.contains(each)) {
	                answerList.add(each);
	            }
	        }
	        Collections.sort(answerList);
	        System.out.println("each Print : " + answerList);        
	        System.out.println("temp 2 : " + temp);
	        
	        answer = new int[ answerList.size() ];
	        int cnt = 0;
	       for(int a : answerList) {
	           answer[cnt] = a;
	           cnt++;
	       }
	        return answer;
	  }
	  
	 public static void main(String[] args) {
		int [] test1 = {2,1,3,4,1}; 
		int [] test2 = {5,0,2,7}; 
		solution(test1); 
		solution(test2);
	}
}
// ÀÔÃâ·Â ¿¹
//numbers	result
//[2,1,3,4,1] [2,3,4,5,6,7]
//[5,0,2,7]	[2,5,7,9,12]


// ¹®Á¦
// Á¤¼ö ¹è¿­ numbers°¡ ÁÖ¾îÁý´Ï´Ù. numbers¿¡¼­ ¼­·Î ´Ù¸¥ À妽º¿¡ ÀÖ´Â µÎ °³ÀÇ ¼ö¸¦ »Ì¾Æ ´õÇؼ­ ¸¸µé ¼ö ÀÖ´Â ¸ðµç ¼ö¸¦ ¹è¿­¿¡ ¿À¸§Â÷¼øÀ¸·Î ´ã¾Æ return Çϵµ·Ï solution ÇÔ¼ö¸¦ ¿Ï¼ºÇØÁÖ¼¼¿ä.