zoukankan      html  css  js  c++  java
  • js正则表达式校验非负整数:^d+$ 或 ^[1-9]d*|0$ 【转载】

    <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">

    <html xmlns="http://www.w3.org/1999/xhtml">
    <head>
        <title></title>
        <script type="text/javascript">
            function validation() {
                var val = document.getElementById("txtNumber").value;
                var regu = /^d+$/;
                //var regu = /^[1-9]d*|0$/;  亲测可用
                if (val != "") {
                    if (!regu.test(val)) {
                        document.getElementById("labResult").style.color = "red";
                        document.getElementById("labResult").innerHTML = "验证失败!";
                    else {
                        document.getElementById("labResult").style.color = "green";
                        document.getElementById("labResult").innerHTML = "验证成功!";
                    }
                }
            }
        </script>
    </head>
    <body>
        <input id="txtNumber" name="txtNumber" type="text" />
        <input id="btnValidation" name="btnValidation" type="button" value="校验" onclick="validation()" />
        验证结果:<label id="labResult" ></label>
    </body>
    </html>
     
    转载自:http://www.cnblogs.com/lengzhan/p/6042730.html
  • 相关阅读:
    HDU 1828 Picture (线段树:扫描线周长)
    [USACO18OPEN] Multiplayer Moo (并查集+维护并查集技巧)
    NOIP2016 天天爱跑步 (树上差分+dfs)
    NOIP2013 华容道 (棋盘建图+spfa最短路)
    NOIP2015 运输计划 (树上差分+二分答案)
    NOIP2018 前流水账
    luogu P2331 [SCOI2005]最大子矩阵
    luogu P2627 修剪草坪
    CF101D Castle
    luogu P2473 [SCOI2008]奖励关
  • 原文地址:https://www.cnblogs.com/zhao-bo/p/6044567.html
Copyright © 2011-2022 走看看