TitanYang's Programming
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273 package baekjoon; import java.util.Scanner;import java.util.Arrays;class makePassword{ int n,m; char[] origin; makePassword(char[] a,int n, int m){ this.origin=a; this.n=n; this.m=m; Arrays.sort(origin); } void make(String s, int t) { if(t==m)return; s=s+origi..
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778/** * @Summary : * @Package : recusion * @FileName : zSeek.java * @Author : Yang TaeIl * @date : 2018. 2. 12. * */package recursion; import java.util.Scanner; /** * z형태로 탐색할 배열을 만들고, 탐색하는 메소드가 들어있는 클래스 * * @Package : recursion * @FileName : zSeek.java..
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556/** * @Summary : * @Package : recursion * @FileName : pillEx.java * @Author : Yang TaeIl * @date : 2018. 2. 12. * */package recursion; import java.util.Scanner; /** * 알약먹기 경우의 수 구하는 알고리즘 * @Package : recursion * @FileName : pillEx.java * @Author : Yang TaeIl * @date : 2018. 2. 12. * */ public c..