js中,数组对象操作——双层遍历-for循环之splice-删除、push-添加 & 数组中添加对象 & 删除数组中对象 & 数组中对象的参数值置空

文章详细描述了在JavaScript中如何使用双层遍历进行数组操作,包括删除arr2中与arr1相同的对象、修改classify值、添加新对象以及处理arr1中多余的对象,展示了splice和push方法的应用。
摘要由CSDN通过智能技术生成

js中,数组对象操作——双层遍历-for循环之splice-删除、push-添加 & 数组中添加对象 & 删除数组中对象 & 数组中对象的参数值置空

index.js

<!DOCTYPE html>
<html lang="en">
  <head>
    <meta charset="UTF-8" />
    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
    <title>Document</title>
  </head>

  <body>
    <script>
      // 场景1
      // arr1和arr2中,classify和workerCode相同,不往arr2中添加arr1中的对象;workerCode相同,classify不同,arr2中的classify值改为'1';arr1对中对象的workerCode,arr2中没有,这个对象直接添加到arr2中
      // let arr1 = [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      //   { classify: "1", workerCode: 17 },
      // ];

      // let arr2 = [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      //   { classify: "2", workerCode: 17 },
      //   { classify: "3", workerCode: 35 },
      // ];
      // for (let i = 0; i < arr1.length; i++) {
      //   let found = false;
      //   for (let j = 0; j < arr2.length; j++) {
      //     if (
      //       arr1[i].classify === arr2[j].classify &&
      //       arr1[i].workerCode === arr2[j].workerCode
      //     ) {
      //       found = true;
      //       break;
      //     } else if (
      //       arr1[i].workerCode === arr2[j].workerCode &&
      //       arr1[i].classify !== arr2[j].classify
      //     ) {
      //       arr2[j].classify = "1";
      //       found = true;
      //       break;
      //     }
      //   }
      //   if (!found) {
      //     arr2.push(arr1[i]);
      //   }
      // }
      // console.log(arr2);
      // [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      //   { classify: "1", workerCode: 17 },
      //   { classify: "3", workerCode: 35 },
      // ];

      // 场景2
      // arr1和arr2中,classify和workerCode相同,不往arr2中添加arr1中的对象;workerCode相同,classify不同,arr2中的classify值改为'1';arr1对中对象的workerCode,arr2中没有,这个对象直接添加到arr2中
      // let arr1 = [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      //   { classify: "1", workerCode: 17 },
      // ];

      // let arr2 = [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      //   { classify: "2", workerCode: 17 },
      //   { classify: "3", workerCode: 35 },
      // ];
      // for (let i = 0; i < arr1.length; i++) {
      //   let found = false;
      //   for (let j = 0; j < arr2.length; j++) {
      //     if (
      //       arr1[i].classify === arr2[j].classify &&
      //       arr1[i].workerCode === arr2[j].workerCode
      //     ) {
      //       found = true;
      //       break;
      //     } else if (
      //       arr1[i].workerCode === arr2[j].workerCode &&
      //       arr1[i].classify !== arr2[j].classify
      //     ) {
      //       arr2[j].classify = "1";
      //       found = true;
      //       break;
      //     }
      //   }
      //   if (!found) {
      //     arr2.push(arr1[i]);
      //   }
      // }
      // console.log(arr2);
      //场景3
      //arr1和arr2中,classify和workerCode相同,不往arr2中添加arr1中的对象;workerCode相同,classify不同,arr2中的classify值改为'1';arr1对中对象的workerCode,arr2中没有,这个对象直接添加到arr2中;arr2对中对象的classify为‘1’且该对象的workerCodearr1中没有,则删除arr2中该对象
      // let arr1 = [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      //   { classify: "1", workerCode: 17 },
      // ];

      // let arr2 = [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      //   { classify: "2", workerCode: 17 },
      //   { classify: "3", workerCode: 35 },
      // ];
      // for (let i = 0; i < arr1.length; i++) {
      //   let found = false;
      //   for (let j = 0; j < arr2.length; j++) {
      //     if (
      //       arr1[i].classify === arr2[j].classify &&
      //       arr1[i].workerCode === arr2[j].workerCode
      //     ) {
      //       found = true;
      //       break;
      //     } else if (
      //       arr1[i].workerCode === arr2[j].workerCode &&
      //       arr1[i].classify !== arr2[j].classify
      //     ) {
      //       arr2[j].classify = "1";
      //       found = true;
      //       break;
      //     }
      //   }
      //   if (!found) {
      //     arr2.push(arr1[i]);
      //   }
      // }

      // for (let i = 0; i < arr2.length; i++) {
      //   let found = false;
      //   for (let j = 0; j < arr1.length; j++) {
      //     if (
      //       arr2[i].classify === "1" &&
      //       arr2[i].workerCode === arr1[j].workerCode
      //     ) {
      //       found = true;
      //       break;
      //     }
      //   }
      //   if (!found && arr2[i].classify === "1") {
      //     arr2.splice(i, 1);
      //     i--;
      //   }
      // }
      // console.log(arr2);
      // 场景4
      // 删除arr1中比arr2中多的对象
      // let arr1 = [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      //   { classify: "1", workerCode: 17 },
      // ];

      // let arr2 = [
      //   { classify: "1", workerCode: 15 },
      //   { classify: "1", workerCode: 16 },
      // ];
      // for (let i = 0; i < arr1.length; i++) {
      //   let found = false;
      //   for (let j = 0; j < arr2.length; j++) {
      //     if (
      //       arr1[i].classify === arr2[j].classify &&
      //       arr1[i].workerCode === arr2[j].workerCode
      //     ) {
      //       found = true;
      //       break;
      //     }
      //   }
      //   if (!found) {
      //     arr1.splice(i, 1);
      //     i--;
      //   }
      // }
      // console.log(arr1);
      // 场景5
      // arr1中比arr2中多的对象,classify值改为空字符串
      let arr1 = [
        { classify: "1", workerCode: 15 },
        { classify: "1", workerCode: 16 },
        { classify: "1", workerCode: 17 },
      ];

      let arr2 = [
        { classify: "1", workerCode: 15 },
        { classify: "1", workerCode: 16 },
      ];
      for (let i = 0; i < arr1.length; i++) {
        let found = false;
        for (let j = 0; j < arr2.length; j++) {
          if (
            arr1[i].classify === arr2[j].classify &&
            arr1[i].workerCode === arr2[j].workerCode
          ) {
            found = true;
            break;
          }
        }
        if (!found) {
          arr1[i].classify = "";
        }
      }
      console.log(arr1);
    </script>
  </body>
</html>
  • 6
    点赞
  • 8
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值