zoukankan      html  css  js  c++  java
  • JavaScript-表格排序

    一、知识

      appendChild():先删除,在排序

      sort():数组排序

      parseInt(): 将字符串==》整数(数字)

    !!!- HTML

      <input id="btn1" type="button" value="排序" />
      <table id="tab1" border="1" width="500">
      <thead>
        <td>ID</td>
        <td>姓名</td>
        <td>年龄</td>
        <td>操作</td>
      </thead>
      <tbody>
        <tr>
          <td>2</td>
          <td>张三</td>
          <td>23</td>
          <td></td>
        </tr>
        <tr>
          <td>6</td>
          <td>王四</td>
          <td>24</td>
          <td></td>
        </tr>
        <tr>
          <td>1</td>
          <td>Blue</td>
          <td>27</td>
          <td></td>
        </tr>
        <tr>
          <td>5</td>
          <td>张伟</td>
          <td>24</td>
          <td></td>
        </tr>
        <tr>
          <td>3</td>
          <td>李四</td>
          <td>28</td>
          <td></td>
        </tr>
        <tr>
          <td>4</td>
          <td>王五</td>
          <td>25</td>
          <td></td>
        </tr>
      </tbody>
    </table>

    !!! JS

    window.onload=function ()
    {
      var oTab=document.getElementById('tab1');
      var oBtn=document.getElementById('btn1');

      oBtn.onclick=function ()
      {
        var arr=[];                //先创建一个空数组,里面存放的是要排序的值

        for(var i=0;i<oTab.tBodies[0].rows.length;i++)
        {
          arr[i]=oTab.tBodies[0].rows[i];        //数组得到了表格里面的数据
        }

        arr.sort(function (tr1, tr2){               
          var n1=parseInt(tr1.cells[0].innerHTML);
          var n2=parseInt(tr2.cells[0].innerHTML);

          return n1-n2;
        });

        for(var i=0;i<arr.length;i++)
        {
          oTab.tBodies[0].appendChild(arr[i]);
        }
      };
    };

  • 相关阅读:
    BZOJ4821 SDOI2017相关分析(线段树)
    BZOJ3167/BZOJ4824 HEOI2013SAO/CQOI2017老C的键盘(树形dp)
    BZOJ4820 SDOI2017硬币游戏(概率期望+高斯消元+kmp)
    BZOJ4811 Ynoi2017由乃的OJ(树链剖分+线段树)
    BZOJ4810 Ynoi2017由乃的玉米田(莫队+bitset)
    Codeforces Round #522 Div. 1 没打记
    BZOJ4784 ZJOI2017仙人掌(树形dp+dfs树)
    43. Multiply Strings
    2. Add Two Numbers
    150. Evaluate Reverse Polish Notation
  • 原文地址:https://www.cnblogs.com/xiaoyangtian/p/7945103.html
Copyright © 2011-2022 走看看