dongposhi8677 2015-01-01 06:35
浏览 64
已采纳

在jQuery中从数组中找到重复的lat long

I have following collection of lat/long in java-script array.

locData=[[32.0770488,34.7958072],[32.0776696,34.7683079],[32.0776696,34.7683079],[32.07849,34.773982],[32.07849,34.773982],[32.07849,34.773982],[32.07849,34.773982],[32.07849,34.773982],[32.07849,34.773982],[32.07849,34.773982],[32.07849,34.773982],[32.077795,34.774825],[32.077795,34.774825],[32.077589,34.774565],[32.077589,34.774565],[32.077795,34.774825],[32.077795,34.774825],[32.077589,34.774565],[32.077795,34.774825],[32.077589,34.774565],[32.077795,34.774825],[32.077795,34.774825],[32.077589,34.774565],[32.077589,34.774565],[32.077589,34.774565],[32.077589,34.774565],[32.077589,34.774565],[32.083678,34.775796],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.079743,34.770179],[32.0776696,34.7683079],[32.0776696,34.7683079],[32.0776696,34.7683079],[32.0776696,34.7683079],[32.0776696,34.7683079],[32.0776696,34.7683079],[32.0776696,34.7683079],[32.0776696,34.7683079],[32.115119,34.818128],[31.749309,35.236047]];

Now I want to find duplicate lat/long from this array and generate new array which contains duplicate array list.

My Code:

for (var i = 0; i < locData.length; i++) {
        var title = JSON.stringify(titleData[i]);
        var id = JSON.stringify(ids[i]);
        title = title.replace(/[[\]/"]/g, "");
        id = id.replace(/[[\]/"]/g, "");
        var count = 0;
        var multiArray = [];    

        for(var j=0; j<locData.length; j++){
            if(locData[i][0] === locData[j][0] && locData[i][1] === locData[j][1]){
                count++;

                if(count>1){
                    //alert(locData[i]);
                    //console.log(locData[i]);
                    multiArray.push(locData[i]);

                }

            }
        }
        console.log(multiArray); 
}

But is not generating result as I want it with duplicates with unique each time is it any way?

  • 写回答

2条回答 默认 最新

  • douquanzhan0315 2015-01-01 08:12
    关注

    Try this code

    var multiArray = [];
    for (var i = 0; i < locData.length; i++) {
    
            var count = 0;
            for(var j=0; j<locData.length; j++){
                if(locData[i][0] === locData[j][0] && locData[i][1] === locData[j][1]){
                    count++;
                    if(count>1){ 
                          var mult_indx = 0;
                          for(x in multiArray)
                          {
                              if(locData[j][0] == multiArray[x][0] && locData[j][1] == multiArray[x][1])
                              {
                                  mult_indx++;
                              }
                          }
                          if(mult_indx==0)
                          {
                              multiArray.push(locData[i]);
                          }                    
                         locData.splice(j,2);
                    }              
                }
            }
    }
    
     console.log(multiArray); 
    

    Your reslut will be

    [[32.0776696,34.7683079]
     [32.07849,34.773982]
     [32.077795,34.774825]
     [32.077589,34.774565]
     [32.079743,34.770179]]
    
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥50 comfyui下连接animatediff节点生成视频质量非常差的原因
  • ¥20 有关区间dp的问题求解
  • ¥15 多电路系统共用电源的串扰问题
  • ¥15 slam rangenet++配置
  • ¥15 有没有研究水声通信方面的帮我改俩matlab代码
  • ¥15 ubuntu子系统密码忘记
  • ¥15 信号傅里叶变换在matlab上遇到的小问题请求帮助
  • ¥15 保护模式-系统加载-段寄存器
  • ¥15 电脑桌面设定一个区域禁止鼠标操作
  • ¥15 求NPF226060磁芯的详细资料