复制代码 代码如下:
var lishustr = "qwertyuiopasdfghjklmnbvcxz";
var s = lishustr.split("");
var lishua = ""; var lishub = ""; var lishuc = ""; var lishud = "";
lishua = s[getRandomNum(1,26)]; lishub = s[getRandomNum(1,26)]; lishuc = s[getRandomNum(1,26)]; lishud = s[getRandomNum(1,26)];
switch ("abcdefghijklmnopqrstuvwxyz".indexOf(lishud) + 1) {
case 1: case 2: case 3: case 4: case 5: case 6: case 7:
md5words = md5words + lishua + lishub + lishuc + lishud; break;
case 8: case 9: case 10: case 11: case 12: case 13: case 14:
md5words = lishua + md5words + lishub + lishuc + lishud; break;
case 15: case 16: case 17: case 18: case 19: case 20:
md5words = lishua + lishub + md5words + lishuc + lishud; break;
case 21: case 22: case 23: case 24: case 25: case 26:
md5words = lishua + lishub + lishuc + md5words + lishud; break;
}
function getRandomNum(lbound, ubound) {
return (Math.floor(Math.random() * (ubound - lbound)) + lbound);
}
本文网址: http://www.lantian360.com/blueblog/blog.asp?id=G37
转发请保留此网址,谢谢合作。
您可能感兴趣的文章:- Java、JavaScript、Oracle、MySQL中实现的MD5加密算法分享
- 浅谈Javascript Base64 加密解密
- javascript实现des解密加密全过程
- javascript md5加密代码
- JavaScript加密解密7种方法总结分析
- JavaScript数据结构和算法之图和图算法
- JavaScript实现穷举排列(permutation)算法谜题解答
- JavaScript实现N皇后问题算法谜题解答
- JavaScript中九种常用排序算法
- JavaScript实现SHA-1加密算法的方法