得到radiobuttonlist 选中值:
var CheckBoxList=document.all.optButtonList;
var objCheckBox,CheckValue="";
for(i=0;i<CheckBoxList.rows.length;i++)
{
objCheckBox = document.getElementById('optButtonList'+ "_" + i);
if(objCheckBox.checked == true)
{
CheckValue = objCheckBox.value;
}
}
if(CheckValue!="")
{
alert(CheckValue) ; }
得到 CheckBoxList 选中值
var CheckBoxList=document.all.checkList;
var objCheckBox,CheckValue="";
for(i=0;i<CheckBoxList.rows.length;i++)
{
objCheckBox = document.getElementById("checkList_" + i);
if(objCheckBox.checked == true)
{
CheckValue += CheckBoxList.rows[i].cells[0].childNodes(1).innerText + ",";
}
}
if(CheckValue!="")
{
alert(CheckValue);
}
var CheckBoxList=document.all.optButtonList;
var objCheckBox,CheckValue="";
for(i=0;i<CheckBoxList.rows.length;i++)
{
objCheckBox = document.getElementById('optButtonList'+ "_" + i);
if(objCheckBox.checked == true)
{
CheckValue = objCheckBox.value;
}
}
if(CheckValue!="")
{
alert(CheckValue) ; }
得到 CheckBoxList 选中值
var CheckBoxList=document.all.checkList;
var objCheckBox,CheckValue="";
for(i=0;i<CheckBoxList.rows.length;i++)
{
objCheckBox = document.getElementById("checkList_" + i);
if(objCheckBox.checked == true)
{
CheckValue += CheckBoxList.rows[i].cells[0].childNodes(1).innerText + ",";
}
}
if(CheckValue!="")
{
alert(CheckValue);
}
近期安排
石子合并问题圆形版 HRBUST 1819区间dp+环形+四边形优化
Common Subsequence HDU 1159 最长公共子序列Longest Common Subsequence,LCS
二维树状数组 1:单点修改,区间查询 LibreOJ 133
c++位运算
石子合并问题直线版 HRBUST 1818 简单区间动规
最少拦截系统 HDU 1257 LIS最长递增子序列
Longest Common Subsequence Again HDU 2253 LCS+位压缩
石子合并 HYSBZ 3229 区间dp,最优二叉树问题,加西亚瓦克斯算法(GarsiaWachs)