以下是输出数字和字母的6位所有组合的 Java 代码:
```java
public class Combination {
public static void main(String[] args) {
String[] characters = {"0","1","2","3","4","5","6","7","8","9",
"a","b","c","d","e","f","g","h","i","j","k","l","m","n",
"o","p","q","r","s","t","u","v","w","x","y","z",
"A","B","C","D","E","F","G","H","I","J","K","L","M","N",
"O","P","Q","R","S","T","U","V","W","X","Y","Z"};
int n = characters.length;
int r = 6;
generateCombinations(characters, "", n, r);
}
public static void generateCombinations(String[] characters, String prefix, int n, int r) {
if (r == 0) {
System.out.println(prefix);
return;
}
for (int i = 0; i < n; i++) {
String newPrefix = prefix + characters[i];
generateCombinations(characters, newPrefix, n, r - 1);
}
}
}
```
这个程序使用递归生成了所有的6位组合,其中包含数字和字母。它使用了一个字符串数组来存储数字和字母,然后使用一个循环遍历该数组中的所有元素,并将其添加到前缀字符串中,生成新的前缀字符串,然后递归调用自身以生成剩余的组合。当需要生成的字符数为0时,程序会输出当前的前缀字符串作为一个组合。