function clearText() {
var content=document.getElementById("content");
// 在此完成该函数
for(var i=content.childNodes.length-1;i>=0;i--){
var x=content.removeChild(content.childNodes[i]);
x=null;
}
}
var content=document.getElementById("content");
// 在此完成该函数
for(var i=content.childNodes.length-1;i>=0;i--){
var x=content.removeChild(content.childNodes[i]);
x=null;
}
}
2015-07-06
var otest = document.getElementById("test");
var newnode=document.createElement("li");
newnode.innerHTML="php";
otest.insertBefore(newnode,otest.lastChild);
var newnode=document.createElement("li");
newnode.innerHTML="php";
otest.insertBefore(newnode,otest.lastChild);
2015-07-06
if(z!=null){
document.write("<br />previoussibling:");
document.write(z.nodeName);
document.write("=");
document.write(z.innerHTML);
}else{
document.write("<br>已是第一个节点");
}
document.write("<br />previoussibling:");
document.write(z.nodeName);
document.write("=");
document.write(z.innerHTML);
}else{
document.write("<br>已是第一个节点");
}
2015-07-06
function get_previousSibling(n){
var x=n.previousSibling;
while(x && x.nodeType!=1){
x=x.previousSibling;
}
return x;
}
var z=get_previousSibling(x);
var x=n.previousSibling;
while(x && x.nodeType!=1){
x=x.previousSibling;
}
return x;
}
var z=get_previousSibling(x);
2015-07-06
switch(s_1){
case "+":result=first+second;break;
case "-":result=first-second;break;
case "*":result=first*second;break;
case "/":result=first/second;break;
default:document.write("你输入的符号有误。");break;
}
document.getElementById("fruit")=result;
}
case "+":result=first+second;break;
case "-":result=first-second;break;
case "*":result=first*second;break;
case "/":result=first/second;break;
default:document.write("你输入的符号有误。");break;
}
document.getElementById("fruit")=result;
}
+ 我来回答
回答最高可+2积分
+ 我来回答
回答最高可+2积分