62,614
社区成员
发帖
与我相关
我的任务
分享
/**
*
*/
package houlei.test;
import java.util.Collection;
import java.util.LinkedList;
/**
* 该类创建于 2008-10-17 下午04:53:56
*
* @version 1.0.0
* @author 侯磊
*/
public class L {
public static void main(String[] args) {
fun(3, new int[] { 1, 2, 3 }, null);
}
/**
* @param level 嵌套的层次
* @param a 待传的数组
* @param rs 首次调用的时候,为null
*/
public static void fun(int level, int a[], int [] rs) {
if (rs == null) rs = new int[a.length];
for (int i = 0; i < a.length; i++) {
if (level <= 0) {
StringBuffer sb = new StringBuffer();
for(int k=0;k<rs.length;k++)sb.append(rs[k]);
System.out.println(sb.toString());
return;
} else {
rs[rs.length-level]=a[i];
fun(level - 1, a, rs);
}
}
}
}
public func(int i,int j,int k) {
int ii,jj,kk;
kk++;
if kk > a.length {
kk = 0;
jj++;
}
if jj > a.length {
jj = 0;
ii++;
}
System.out.println(a[i]+","+a[j]+","+a[k]);
func(ii,jj,kk);
}
public class SequenceGenerator {
private char[] elements;
private char[] sequence;
public SequenceGenerator(char[] elements, int sequenceLength) {
this.elements = elements;
this.sequence = new char[sequenceLength];
}
public static void main(String[] args) {
new SequenceGenerator(new char[] { '1', '2', '3' }, 5).generate();
}
public void generate() {
generate(0);
}
private void generate(int index) {
for (int i = 0; i < elements.length; i++) {
sequence[index] = elements[i];
if (index + 1 < sequence.length) {
generate(index + 1);
} else {
System.out.println(String.valueOf(sequence));
}
}
}
}