zoukankan      html  css  js  c++  java
  • 去除所有js,html,css代码

    <?php
    $search = array ("'<script[^>]*?>.*?</script>'si", // 去掉 javascript
                     "'<style[^>]*?>.*?</style>'si", // 去掉 css
                     "'<[/!]*?[^<>]*?>'si", // 去掉 HTML 标记
                     "'<!--[/!]*?[^<>]*?>'si", // 去掉 注释标记
                     "'([rn])[s]+'", // 去掉空白字符
                     "'&(quot|#34);'i", // 替换 HTML 实体
                     "'&(amp|#38);'i",
                     "'&(lt|#60);'i",
                     "'&(gt|#62);'i",
                     "'&(nbsp|#160);'i",
                     "'&(iexcl|#161);'i",
                     "'&(cent|#162);'i",
                     "'&(pound|#163);'i",
                     "'&(copy|#169);'i",
                     "'&#(d+);'e"); // 作为 PHP 代码运行

    $replace = array ("",
                      "",
                      "",
                      "",
                      "\1",
                      "\"",
                      "&",
                      "<",
                      ">",
                      " ",
                      chr(161),
                      chr(162),
                      chr(163),
                      chr(169),
                      "chr(\1)");
    //$document为需要处理字符串,如果来源为文件可以$document = file_get_contents('http://www.sina.com.cn');
    $out = preg_replace($search, $replace, $document);
    echo $out;
    ?>

    存为.php
  • 相关阅读:
    火车进出站(POJ1363)
    字符串反转,栈模拟(ZOJ1151)
    模拟网页的浏览Stack(POJ1028)
    Codeforces Round #347 (Div.2)_B. Rebus
    Codeforces Round #347 (Div.2)_A. Complicated GCD
    BFS模板
    广搜破解密码(HDU1195)
    DFS+BFS(POJ3083)
    砍树,POJ(2665)
    快速幂取模,POJ(1995)
  • 原文地址:https://www.cnblogs.com/ly312/p/1838312.html
Copyright © 2011-2022 走看看