Javascript ÃÜÂëÇ¿¶ÈÉèÖà ½Å±¾
/**
* 6 ¼¶Ç¿¶ÈÉèÖã¨Êý×Ö¡¢´óд×Öĸ¡¢Ð¡Ð´×Öĸ¡¢ÌØÊâ×Ö·û¡¢³¤¶È>=6¡¢³¤¶È>=10£©
* Èç¹ûÃÜÂëΪ¿Õ£¬·µ»Ø 0
*/
function __pwdStrength(pwd) {
var sum = [0, 0, 0, 0];
for (var i=0; i<pwd.length; i++) {
var c = pwd.charCodeAt(i);
if (c >=48 && c <=57) //Êý×Ö
sum[0] = 1;
else if (c >=65 && c <=90) //´óд×Öĸ
sum[1] = 1;
else if (c >=97 && c <=122) //Сд×Öĸ
sum[2] = 1;
else //ÌØÊâ×Ö·û
sum[3] = 1;
}
var level = sum[0] + sum[1] + sum[2] + sum[3];
if (pwd.length >= 6) level++;
if (pwd.length >= 10) level++;
return level;
}
function __pwdStrength_name(pwd) {
var names = [ '¿Õ', 'Ì«Èõ', 'Èõ', '½ÏÈõ', 'ÖÐ', '½ÏÇ¿', 'Ç¿'];
var level = __pwdStrength(pwd);
var result = names[level];
if (!result) result = names[6];
return result;
}
function __pwdStrength_color(pwd) {
var names = [ '#000000', '#FF0000', '#E89097', '#800080', '#0000FF', '#00FF00', '#008000'];
var level = __pwdStrength(pwd);
var result = names[level];
if (!result) result = names[6];
return result;
}
±¾ÎÄÀ´×ÔCSDN²©¿Í£¬×ªÔØÇë±êÃ÷³ö´¦£ºhttp://blog.csdn.net/subchen/archive/2007/10/29/1854387.aspx
Ïà¹ØÎĵµ£º
<a class="bt_3" href="javascript:void(0)" mce_href="javascript:void(0)" id="btnSubmit1" onclick="submitPage()">Ìá½»</a>
submitPage() ÊÇÎÒ¶¨ÒåµÄÒ»¸öº¯Êý£¬ÔÒâÊǵã»÷Õâ¸ö<a>ʱ£¬Ìá½»Ò»¸ö±íµ¥¡£ft, ie6 ¾ÓÈ»²»¿ÉÒÔ£¬ÔõôҲ²»ÄÜÌá½»¡£
¿´À´ÊÇÒòΪ ie6 Ö´ÐÐĬÈ϶¯×÷ÒýÆðÀ´£¬Ä¿Ç°Á½ÖÖ½â¾ö·½·¨£ ......
1.´´½¨½Úµã²¢Ìí¼ÓÄÚÈÝ:ʹÓõķ½·¨:createElementºÍcreateTextNode
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
<title>HTML DOM</title>
&nbs ......
´úÂëʾÀý
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312" />
<title>ÎÞ±êÌâÎĵµ</title>
</head>
<mce:style><!--
.man{ float:left; background:#9af; margin:3px; padding:3px; cursor:default}
--></mce:style>< ......
½ñÌìÔÚ×öÒ»¸öѧÉúÐÅÏ¢ÐÞ¸ÄÒ³ÃæµÄʱºòÓöµ½ÁËÒ»µãСÎÊÌ⣬ÒòÐèÇóÖ¸³öѧÉúÔڲ鿴¸öÈËÐÅϢʱ¿ÉÒÔÉê¸æÆäÖеĴíÎóÐÅÏ¢£¬²¢Ìá½»ÕýÈ·ÐÅÏ¢£¬ËùÒÔÎÒÔÚÏÔʾ»ù±¾ÐÅÏ¢µÄʱºò¶ÔÓÚѧԺ¡¢×¨ÒµºÍ°à¼¶µÈ¾Í²ÉÓÃÁËÏÂÀ²Ëµ¥£¬ÎªÁËʹÏÂÀ²Ëµ¥ÏÔʾѧÉúµ±Ç°µÄÐÅÏ¢£¬ÇÒ¾ßÓÐÁª¶¯Ð§¹ûÐèÔÚjsÖлñÈ¡sessionÖд«¹ýÀ´µÄÏà ......
1¡¢²åÈëÅÅÐò->Ö±½Ó²åÈë·¨ÅÅÐò
function InsertSort(arr) { //²åÈëÅÅÐò->Ö±½Ó²åÈë·¨ÅÅÐò
var st = new Date();
var temp, j;
for(var i=1; i<arr.length; i++) {
if((arr[i]) < (arr[i-1])) {
temp = arr[i];
j = i-1;
do {
arr[j+1] = arr[j];
j--;
}
whil ......