코드와이

CompleteBinaryTree package week0208_0212; import java.util.LinkedList; import java.util.Queue; /** * @author THKim */ public class CompleteBinaryTree { private char[] nodes; private int lastIndex; private final int SIZE; public CompleteBinaryTree(int size){ SIZE = size; nodes = new char[size+1];// 0인덱스 사용 안함 } public boolean isEmpty(){ return lastIndex == 0; } private boolean isFull(){ return la..

Node package week0208_0212; public class Node { public String data; public Node link; public Node(String data) { super(); this.data = data; } public Node(String data, Node link) { this.data = data; this.link = link; } @Override public String toString() { return "Node [data=" + data + ", link=" + link + "]"; } } SinglyLinkedList package week0208_0212; public class SinglyLinkedList { private Node ..

부분집합 1 1, 2, 3 을 갖고 만든 부분 집합으로 재귀를 사용. [1, 2, 3], [1, 2], [1, 3], [1], [2, 3], [2], [3], [] 을 출력. package week0201_0205; public class 부분집합 { static boolean[] isSelected = new boolean[3]; static int[] arr = {1,2,3}; public static void main(String[] args) { func(0); } public static void func(int idx) { if(idx == 3) { for(int i = 0 ; i < 3 ; i++) { if(isSelected[i]) { System.out.print(arr[i]+ " ");..

순 열 package week0201_0205; import java.util.Arrays; public class permu { static int N = 3; static int[] numbers; static boolean[] isSelected; public static void main(String[] args) { numbers = new int[3]; isSelected = new boolean[4]; perm(0); } public static void perm(int cnt) { if ( cnt == 3) { System.out.println(Arrays.toString(numbers)); return; } for(int i = 1; i