zoukankan      html  css  js  c++  java
  • Extjs/两个数组去除重复的数,求差集

                                                                 
                                    var allFee = new Array();// 所有的 
                                     var litFee = new Array();// 用户选择的
                                      // 剔除已有的记录
                                      forvar i = 0 ; i < feeMes.length ; i++){
                                          allFee.push( feeMes [i].feeCode );
                                      }
                                      forvar i = 0 ; i < inputMes.length ; i++){
                                          litFee.push( inputMes [i].feeCode );
                                      }
                                      forvar i = 0 ; i < allFee.length ; i++){
                                          var flag = true;
                                          for( j = 0 ; j < litFee.length ; j++){
                                              if ( allFee [i] == litFee [j] ){
                                                  var flag = false;
                                              }
                                          }
                                          if ( flag ){
                                              difArray.push( i );// 不重复的feecode
                                          }
                                      }




  • 相关阅读:
    NOIp199Cantor表
    NOIP2001数的计算
    NOIP2010排队接水
    普及组2006第三题jam的计数法
    2013提高组积木大赛
    洛谷1223排队接水
    9.3noip模拟赛第一题卡片
    2002普及组第四题过河卒
    细胞分裂(NOIP2009 普及组第三题)
    道路游戏(NOIP2009 普及组第四题)
  • 原文地址:https://www.cnblogs.com/babyhhcsy/p/3434639.html
Copyright © 2011-2022 走看看