301 301 301 301 301
3 3 3 3 3
0 0 0 0 0
1 1 1 1 1
3 3 3 3 1
3 3 3 3 0
3 3 3 0 3
3 3 3 1 3
………
意思是将第一列的每个301,分成3、0、1,从第二列往下是不同组合的例子,要用JS写一下,把所有不重复的组合遍历出来。大家给写写喽,写的正确还给再加分啊
3 3 3 3 3
0 0 0 0 0
1 1 1 1 1
3 3 3 3 1
3 3 3 3 0
3 3 3 0 3
3 3 3 1 3
………
意思是将第一列的每个301,分成3、0、1,从第二列往下是不同组合的例子,要用JS写一下,把所有不重复的组合遍历出来。大家给写写喽,写的正确还给再加分啊
var f = ["大王", "红桃", "黑桃", "方块", "梅花", "小王"];
var n = ["A","2","3","4","5","6","7","8","9","10","J","Q","K"];
var p = [], k = {}, x, y, z;
while(p.length < 54) {
x = f[f.length * Math.random() >> 0];
y = n[n.length * Math.random() >> 0];
z = (x=="小王" || x=="大王") && x || x + y;
! k[z] && p.push(z) && (k[z] = !0);
}
alert(p.join("\n"))
</script>