使用原生js做一个简单的定时访问页面

2020年3月的某一个周末,我在无聊之下想通过js实现刷浏览量的功能,它的优点是不需要引入任何东西,只需要建一个html页面,将我们的js代码加进去就可以执行。(记得允许你的浏览器打开其他页面)

开始思路,通过js的for循环一直访问文章地址,链接方式使用window.open("地址")的方式

$(function (){
        for (var i=0; i<100; i++) {
            window.open("https://www.baidu.com/");
        }
    })

可以看到这个是循环open了100次百度的页面,但是没有关闭,大量的标签在浏览器上让浏览器非常卡顿,于是我们要加入关闭标签的功能。

location.close();

这个是关闭标签页的功能,但是测试后我们是关闭了我们js的页面,我们实际要关闭的是open的页面,再修改一下,在我们使用open的时候用var定义接受一下对象以便于关闭打开的标签页

$(function (){
        for (var i=0; i<100; i++) {
            var ww = window.open("https://www.baidu.com/");
            ww.close();
            window.open("https://www.baidu.com/");
        }
    })

这样就只会关闭我们打开的页面,但是我们要实现自动化就要用定时执行了

window.setInterval(a,5000); // a是方法名 5000是毫秒  意思就是每隔5000毫秒调用a方法

function a (){
   var ww = window.open("https://www.baidu.com/");
   ww.close();
   window.open("https://www.baidu.com/");
}

但是实际情况肯定并不会只打开一个页面,于是我们再优化一下,将要打开的页面定义在数组里,这样每次定时执行会先关闭之前的页面,再执行我们定义好的数组地址。

var ad = ["https://blog.csdn.net/AnNanDu/article/details/104946524","https://blog.csdn.net/AnNanDu/article/details/104796290","https://blog.csdn.net/AnNanDu/article/details/104795235",
        "https://blog.csdn.net/AnNanDu/article/details/104718395","https://blog.csdn.net/AnNanDu/article/details/104697868","https://blog.csdn.net/AnNanDu/article/details/104559232","https://blog.csdn.net/AnNanDu/article/details/104551022",
        "https://blog.csdn.net/AnNanDu/article/details/104532424","https://blog.csdn.net/AnNanDu/article/details/104521307","https://blog.csdn.net/AnNanDu/article/details/104311229","https://blog.csdn.net/AnNanDu/article/details/104248809",
        "https://blog.csdn.net/AnNanDu/article/details/104248809","https://blog.csdn.net/AnNanDu/article/details/103888862","https://blog.csdn.net/AnNanDu/article/details/103817183","https://blog.csdn.net/AnNanDu/article/details/103800005",
        "https://blog.csdn.net/AnNanDu/article/details/103765749"
    ];

window.setInterval(a,5000); // a是方法名 5000是毫秒  意思就是每隔5000毫秒调用a方法

function a (){
   for (var i=0; i<ad.length; i++) {
            var ww = window.open(ad[i]);
            ww.close();
            if (ww==null){
                window.open(ad[i]);
            }
   }
}

但是如果要每次要打开100个地址还是对浏览器有影响,所以我们多定义几个定时js来让他们交错开

var ad = ["https://blog.csdn.net/AnNanDu/article/details/104946524","https://blog.csdn.net/AnNanDu/article/details/104796290","https://blog.csdn.net/AnNanDu/article/details/104795235",
        "https://blog.csdn.net/AnNanDu/article/details/104718395","https://blog.csdn.net/AnNanDu/article/details/104697868","https://blog.csdn.net/AnNanDu/article/details/104559232","https://blog.csdn.net/AnNanDu/article/details/104551022",
        "https://blog.csdn.net/AnNanDu/article/details/104532424","https://blog.csdn.net/AnNanDu/article/details/104521307","https://blog.csdn.net/AnNanDu/article/details/104311229","https://blog.csdn.net/AnNanDu/article/details/104248809",
        "https://blog.csdn.net/AnNanDu/article/details/104248809","https://blog.csdn.net/AnNanDu/article/details/103888862","https://blog.csdn.net/AnNanDu/article/details/103817183","https://blog.csdn.net/AnNanDu/article/details/103800005",
        "https://blog.csdn.net/AnNanDu/article/details/103765749"
    ];
    var bd = ["https://blog.csdn.net/AnNanDu/article/details/103732422","https://blog.csdn.net/AnNanDu/article/details/103729332","https://blog.csdn.net/AnNanDu/article/details/103528623",
        "https://blog.csdn.net/AnNanDu/article/details/103406640","https://blog.csdn.net/AnNanDu/article/details/103391666","https://blog.csdn.net/AnNanDu/article/details/103387220","https://blog.csdn.net/AnNanDu/article/details/103324327",
        "https://blog.csdn.net/AnNanDu/article/details/103270410","https://blog.csdn.net/AnNanDu/article/details/103262381","https://blog.csdn.net/AnNanDu/article/details/103259328","https://blog.csdn.net/AnNanDu/article/details/103251069",
        "https://blog.csdn.net/AnNanDu/article/details/103250990","https://blog.csdn.net/AnNanDu/article/details/103214815","https://blog.csdn.net/AnNanDu/article/details/103185475","https://blog.csdn.net/AnNanDu/article/details/103179238",
        "https://blog.csdn.net/AnNanDu/article/details/102719110"
    ];
    window.setInterval(a,5000);
    window.setInterval(b,6000);

    function a (){
        for (var i=0; i<ad.length; i++) {
            var ww = window.open(ad[i]);
            ww.close();
            if (ww==null){
                window.open(ad[i]);
            }
        }
    }

    function b(){
        for (var i=0; i<bd.length; i++) {
            var ww = window.open(bd[i]);
            ww.close();
            if (ww==null){
                window.open(bd[i]);
            }
        }
    }

可以看到我们将a、b两个方法的定时时间差了1s,所以在b执行的时候a已经关闭了他的所有页面,避免了同一时间打开过多页面,如果还要同时打开更多的页面,继续加定时任务和数组,他们直接的执行时间最好岔开2秒钟,下面为完整代码,直接复制粘贴打开页面就可以执行。

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>Title</title>
</head>
<body>
Hello World
</body>
<script>



    var ad = ["https://blog.csdn.net/AnNanDu/article/details/104946524","https://blog.csdn.net/AnNanDu/article/details/104796290","https://blog.csdn.net/AnNanDu/article/details/104795235",
        "https://blog.csdn.net/AnNanDu/article/details/104718395","https://blog.csdn.net/AnNanDu/article/details/104697868","https://blog.csdn.net/AnNanDu/article/details/104559232","https://blog.csdn.net/AnNanDu/article/details/104551022",
        "https://blog.csdn.net/AnNanDu/article/details/104532424","https://blog.csdn.net/AnNanDu/article/details/104521307","https://blog.csdn.net/AnNanDu/article/details/104311229","https://blog.csdn.net/AnNanDu/article/details/104248809",
        "https://blog.csdn.net/AnNanDu/article/details/104248809","https://blog.csdn.net/AnNanDu/article/details/103888862","https://blog.csdn.net/AnNanDu/article/details/103817183","https://blog.csdn.net/AnNanDu/article/details/103800005",
        "https://blog.csdn.net/AnNanDu/article/details/103765749"
    ];
    var bd = ["https://blog.csdn.net/AnNanDu/article/details/103732422","https://blog.csdn.net/AnNanDu/article/details/103729332","https://blog.csdn.net/AnNanDu/article/details/103528623",
        "https://blog.csdn.net/AnNanDu/article/details/103406640","https://blog.csdn.net/AnNanDu/article/details/103391666","https://blog.csdn.net/AnNanDu/article/details/103387220","https://blog.csdn.net/AnNanDu/article/details/103324327",
        "https://blog.csdn.net/AnNanDu/article/details/103270410","https://blog.csdn.net/AnNanDu/article/details/103262381","https://blog.csdn.net/AnNanDu/article/details/103259328","https://blog.csdn.net/AnNanDu/article/details/103251069",
        "https://blog.csdn.net/AnNanDu/article/details/103250990","https://blog.csdn.net/AnNanDu/article/details/103214815","https://blog.csdn.net/AnNanDu/article/details/103185475","https://blog.csdn.net/AnNanDu/article/details/103179238",
        "https://blog.csdn.net/AnNanDu/article/details/102719110"
    ];
    window.setInterval(a,5000);
    window.setInterval(b,6000);

    function a (){
        for (var i=0; i<ad.length; i++) {
            var ww = window.open(ad[i]);
            ww.close();
            if (ww==null){
                window.open(ad[i]);
            }
        }
    }

    function b(){
        for (var i=0; i<bd.length; i++) {
            var ww = window.open(bd[i]);
            ww.close();
            if (ww==null){
                window.open(bd[i]);
            }
        }
    }
</script>
</html>

 

### 回答1: 使用 JavaScript 写一个冒泡排序的算法可以这样: function bubbleSort(arr) { for (let i = 0; i < arr.length; i++) { for (let j = 0; j < arr.length - i - 1; j++) { if (arr[j] > arr[j + 1]) { let temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } return arr; } ### 回答2: 冒泡排序是一种简单直观的排序算法,通过不断比较相邻的元素并交换位置,将较大的元素逐渐“浮”到数组的末尾。下面是使用原生JavaScript编写的冒泡排序代码。 ```javascript function bubbleSort(arr) { var len = arr.length; for (var i = 0; i < len-1; i++) { for(var j = 0; j < len-1-i; j++){ if (arr[j] > arr[j+1]) { // 交换位置 var temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } return arr; } // 测试 var array = [64, 34, 25, 12, 22, 11, 90]; console.log(bubbleSort(array)); // 输出 [11, 12, 22, 25, 34, 64, 90] ``` 在这段代码中,我们使用两个嵌套的循环来实现冒泡排序。外层循环控制比较和交换的次数,内层循环用于比较相邻元素并交换位置。通过不断地将较大的元素向后移动,最终将最大的元素放置到数组末尾。通过重复这个过程,我们最终将整个数组按照升序排列。 以上就是使用原生JavaScript编写冒泡排序的代码。 ### 回答3: 冒泡排序是一种简单而常用的排序算法,它逐渐地将较大的数值移到右侧,较小的数值移到左侧,以达到整体排序的目的。下面是使用原生JS编写的冒泡排序算法: ```javascript function bubbleSort(arr) { var len = arr.length; for (var i = 0; i < len-1; i++) { for (var j = 0; j < len-1-i; j++) { if (arr[j] > arr[j+1]) { var temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } return arr; } // 测试例子 var exampleArr = [5, 3, 8, 4, 2]; console.log(bubbleSort(exampleArr)); // 输出 [2, 3, 4, 5, 8] ``` 这段代码中,我们使用了两个嵌套的循环,外层循环控制进行的轮数,内层循环控制每轮比较的次数。在每轮比较中,如果当前元素比它后面的元素大,就交换这两个元素的位置。经过多轮的比较和交换,最终将达到一个有序的数组。 这个冒泡排序算法的时间复杂度是O(n^2),因为需要进行两层循环,每层循环次数可能达到n-1次,所以总的比较次数是n*(n-1)/2,即O(n^2)。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

余生大大

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值