<script language=javascript>
var str="12355657890"
var temp=str.split("")
var tempObject=new Array()
for(var i in temp)
if(!tempObject[temp[i]])
tempObject[temp[i]]=1
if(tempObject.length==temp.length){
alert("ok")
}else{
alert("有重复")
}
</script>
调试欢乐多
alert(reg.test("19348"));
var reg=/^(\d)((?!\1)\d)((?!\1|\2)\d)((?!\1|\2|\3)\d)((?!\1|\2|\3|\4)\d)((?!\1|\2|\3|\4|\5)\d)((?!\1|\2|\3|\4|\5|\6)\d)((?!\1|\2|\3|\4|\5|\6|\7)\d)((?!\1|\2|\3|\4|\5|\6|\7|\8)\d)((?!\1|\2|\3|\4|\5|\6|\7|\8|\9)\d)$/;
alert(reg.test(num));
//^o^推广个函数
var CSHOW = function (f) {
//测试函数
var a = [], b = arguments, i = 1;
for (; i < b.length ; i ++) a[i - 1] = b[i] + " = " + f(b[i]);
alert(a.join("\n"));
};var isNoRepeat = function (string) {
//校验是否重复,字数改{10}这里的10就可以
return /^(?!.*?(.).*?\1)[0-9]{10}$/.test(string);
};CSHOW(
isNoRepeat, "1234567890", "1204567893", "1234567894", "1234565890", "1234567390", "7204561893"
);
</script>
//^o^推广个函数
var CSHOW = function (f) {
//测试函数
var a = [], b = arguments, i = 1;
for (; i < b.length ; i ++) a[i - 1] = b[i] + " = " + f(b[i]);
alert(a.join("\n"));
};var isNoRepeat = function (string) {
//校验是否重复,字数改{10}这里的10就可以
return /^(?!.*?(.).*?\1)[0-9]{10}$/.test(string);
};CSHOW(
isNoRepeat, "1234567890", "1204567893", "1234567894", "1234565890", "1234567390", "7204561893"
);
</script>
muxrwc兄的正则用的非常的漂亮啊!我自己也设计了一个计算是否重复字符的函数,,,共享一下...顺便结贴了..String.prototype.isRepeatStr=function(){
for(var i=0;i<this.length;i++){
if(this.lastIndexOf(this.charAt(i))>i) return true;
}
return false;
}
for(var i=0;i <this.length;i++){
if(this.lastIndexOf(this.charAt(i))> i) return true;
}
return false;
}