import java.util.Arrays;
public class lzwCode {
public static void main(String[] args) {
int num = 11;
int[] lzw = { 11, 9, 8, 4, 5, 6, 7, 3, 2, 10, 1, 12};
int[] arr = arraySort(lzw);
int len = arr.length;
int i, j;
i = 0;
j = len - 1;
while (arr[j] > num) {
j--;
}
while (i < j) {
for (int m=0; m<j-1; m++) {
if (arr[m]+arr[j] == num) {
System.out.println(arr[m]+","+arr[j]);
}
}
j--;
}
}
//简单的冒泡排序
public static int[] arraySort(int []arr){
int temp;
for (int i=0; i<arr.length; i++) {
for (int j=i; j<arr.length; j++) {
if(arr[i]>arr[j]) {
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
return arr;
}
}
控制台结果