zoukankan
html css js c++ java
正则
1.校验正整数
var reg = /^d+$/;
if(!reg.test($scope.siteDetail.workerQty)) {
$scope.alertmsg = '请输入正确的作业人数';
$scope.alertenabled = true;
$scope.checkDataPass = false;
return;
}
查看全文
相关阅读:
HDU-1115计算几何
树形DP入门之HDU 1296
拓扑排序-POJ1964
其他一些数状数组的题
HDU 2852(树状数组plus二分)
POJ-2155二维树状数组
HDOJ 1166 敌兵布阵 (线段树)
codevs 1082 线段树练习3 (线段树)
codevs 1081 线段树练习2 (线段树)
codevs 1080 线段树练习(线段树)
原文地址:https://www.cnblogs.com/baobeiqi-e/p/9884764.html
最新文章
AtCoder Grand Contest 045 A
AtCoder Grand Contest 046 A
agc047 B
agc047 A
阶乘的数量级
hihocoder #1442 : Smallest Rectangle
Google Kick Start 2020 Round B T1-3
Codeforces 1337D Xenia and Colorful Gems
Codeforces 1337C Linova and Kingdom
Codeforces 1324F Maximum White Subtree DFS
热门文章
Codeforces 1324E Sleeping Schedule DP
Codeforces1312E Array Shrinking 区间DP
Codeforces1312D Count the Arrays 组合数学
Codeforces 1321E World of Darkraft: Battle for Azathoth
Codeforces 1321D Navigation System
Codeforces 1321C Remove Adjacent
CODEFORCES-1077c
字符串之KMP算法
1-2-K博弈
POJ 2502 SUBWAY(最短路)
Copyright © 2011-2022 走看看