<!DOCTYPE html> <html> <head lang="en"> <meta charset="UTF-8"> <title></title> <script type="text/javascript"> //=======方法1 (有点复杂)=== 递归函数 // Object.prototype.nextf = function(){ // if(this.nextSibling.nodeType == 3){ // if(this.nextSibling.nextSibling.nodeType ==1){ // return this.nextSibling.nextSibling; // } // } // } //=== 方法2 (简单) ===递归函数 Object.prototype.nextf = function(){ var ele = null; if(this.nextSibling.nodeType == Node.ELEMENT_NODE) { return this.nextSibling; } else { ele = this.nextSibling.nextf(); } return ele; //返回值。向下执行,向上返回! } </script> </head> <body> <div> <p>呵呵</p> <p>哈哈</p> <p>嘿嘿</p> </div> </body> <script type="text/javascript"> var a = document.getElementsByTagName("div")[0]; var b = a.firstChild.nextSibling; var p = b.nextf(); alert(p.innerHTML); </script> </html>
递归函数方法查找节点
最新推荐文章于 2023-07-06 14:13:47 发布