blocks|key|3991707|text|您可以拆分path并使用各个部分，如下所示：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|3991708|let+path+=+'0-0-1';
let+parts+=+path.split('-');

//+Call+your+splice+using+your+parts+(unsure+if+your+'1'+is+the+index,+or+deleteCount).

//+If+parts[2]+is+the+index
arr[parts[0]].child[parts[1]].splice(parts[2],+1);

//+If+parts[2]+is+the+deleteCount:
arr[parts[0]].child[parts[1]].splice(1,+parts[2]);|code-block|syntax|javascript|3991709|entityMap^0|5|4|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@$9|N|A|O|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|P|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|Q|8|@]|D|@]|E|$]]]|L|$]]

<p>You could split your <code>path</code> and use the parts, like so:</p>

<pre><code>let path = '0-0-1';
let parts = path.split('-');

// Call your splice using your parts (unsure if your '1' is the index, or deleteCount).

// If parts[2] is the index
arr[parts[0]].child[parts[1]].splice(parts[2], 1);

// If parts[2] is the deleteCount:
arr[parts[0]].child[parts[1]].splice(1, parts[2]);
</code></pre>


blocks|key|3988714|text|您可以通过保存最后一个索引并返回实际索引的子项来减少索引。稍后与最后一个索引拼接。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3988715|​|3988716|function+deepSplice(array,+path)+{
++++var+indices+=+path.split('-'),
++++++++last+=+indices.pop();

++++indices
++++++++.reduce((a,+i)+=>+a[i].child,+array)
++++++++.splice(last,+1);
}

const+array+=+[{+name:+'FolderA',+child:+[{+name:+'FolderB',+child:+[{+name:+'FolderC0',+child:+[]+},+{+name:+'FolderC1',+child:+[]+}]+}]+},+{+name:+'FolderM',+child:+[]+}];

deepSplice(array,+"0-0-1");
console.log(array);|code-block|syntax|javascript|3988717|.as-console-wrapper+{+max-height:+100%25+!important;+top:+0;+}|3988718|3988719|entityMap^0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|P|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|F|7|Q|8|@]|9|@]|A|$G|H]]|$1|K|3|C|5|6|7|R|8|@]|9|@]|A|$]]|$1|L|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|M|$]]

<p>You could reduce the indices by saving the last index and returning the children of the actual index. Later splice with the last index.</p>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>function deepSplice(array, path) {
    var indices = path.split('-'),
        last = indices.pop();

    indices
        .reduce((a, i) =&gt; a[i].child, array)
        .splice(last, 1);
}

const array = [{ name: 'FolderA', child: [{ name: 'FolderB', child: [{ name: 'FolderC0', child: [] }, { name: 'FolderC1', child: [] }] }] }, { name: 'FolderM', child: [] }];

deepSplice(array, "0-0-1");
console.log(array);</code></pre>
<pre class="snippet-code-css lang-css prettyprint-override"><code>.as-console-wrapper { max-height: 100% !important; top: 0; }</code></pre>
</div>
</div>
</p>


blocks|key|3988740|text|如果路径总是由3个(或更少)索引组成，您可以很容易地完成，如下所示：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3988741|​|3988742|function+deleteByPath(arr,+path)+{
+++const+index+=+path.split('-').map((x)+=>+%2Bx);
+++if+(+index.length+<+1)+{
++++++return+null;
+++}+else+if+(+1+===+index.length+)+{
+++++return+arr.splice(index[0],+1);
+++}+else+if+(+2+===+index.length+)+{
+++++return+arr[index[0]].child.splice(index[1],+1);
+++}+else+{
+++++return+arr[index[0]].child[index[1]].child.splice(index[2],+1);
+++}
}

const+arr+=+[
++{
++++name:+'FolderA',
++++child:+[
++++++{
++++++++name:+'FolderB',
++++++++child:+[
++++++++++{
++++++++++++name:+'FolderC0',
++++++++++++child:+[],
++++++++++},
++++++++++{
++++++++++++name:+'FolderC1',
++++++++++++child:+[],
++++++++++},
++++++++],
++++++},
++++],
++},
++{
++++name:+'FolderM',
++++child:+[],
++},
];

console.log(deleteByPath(arr,+"0-0-1"));
console.log(deleteByPath(arr,+"0-1"));
console.log(deleteByPath(arr,+"0"));|code-block|syntax|javascript|3988743|3988744|如果路径可能由少于3个部分组成，您可以调整函数deleteByPath以根据部分的数量来处理情况。|offset|length|style|CODE|3988745|如果路径是任意的，并且可以有任意长度，您可以将deleteByPath函数调整为递归，如下所示：|3988746|function+deleteByIndexRecursive(arr,+index,+current)+{
++return+current%2B1+<+index.length+?+deleteByIndexRecursive(arr.child[index[current]],+current%2B1)+:+arr.child.splice(index[current],+1);+
}
function+deleteByPath(arr,+path)+{
+++const+index+=+path.split('-').map((x)+=>+%2Bx);
+++if+(+1>index.length)+{
+++++return+null;
+++}+else+if+(+1===index.length)+{
+++++return+arr.splice(index[0],+1);
+++}+else+{
+++++return+deleteByIndexRecursive(arr[index[0]],+index,+1);
+++}
}|3988747|entityMap^0|0|0|0|0|N|C|0|N|C|0|0^^$0|@$1|2|3|4|5|6|7|V|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|W|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|X|8|@]|9|@]|A|$G|H]]|$1|I|3|C|5|6|7|Y|8|@]|9|@]|A|$]]|$1|J|3|K|5|6|7|Z|8|@$L|10|M|11|N|O]]|9|@]|A|$]]|$1|P|3|Q|5|6|7|12|8|@$L|13|M|14|N|O]]|9|@]|A|$]]|$1|R|3|S|5|F|7|15|8|@]|9|@]|A|$G|H]]|$1|T|3|-4|5|6|7|16|8|@]|9|@]|A|$]]]|U|$]]

<p>If the path is always going to be composed by 3 (or less) indices you can do it easily like the following:</p>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="true">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>function deleteByPath(arr, path) {
   const index = path.split('-').map((x) =&gt; +x);
   if ( index.length &lt; 1) {
      return null;
   } else if ( 1 === index.length ) {
     return arr.splice(index[0], 1);
   } else if ( 2 === index.length ) {
     return arr[index[0]].child.splice(index[1], 1);
   } else {
     return arr[index[0]].child[index[1]].child.splice(index[2], 1);
   }
}

const arr = [
  {
    name: 'FolderA',
    child: [
      {
        name: 'FolderB',
        child: [
          {
            name: 'FolderC0',
            child: [],
          },
          {
            name: 'FolderC1',
            child: [],
          },
        ],
      },
    ],
  },
  {
    name: 'FolderM',
    child: [],
  },
];

console.log(deleteByPath(arr, "0-0-1"));
console.log(deleteByPath(arr, "0-1"));
console.log(deleteByPath(arr, "0"));</code></pre>
</div>
</div>
</p>

<p>If the path is going to be composed of maybe less than 3 parts you can adjust the function <code>deleteByPath</code> to handle cases based on number of parts.</p>

<p>if the path is going to be arbitrary and can have any length you can adjust the <code>deleteByPath</code> function to be recursive like the following:</p>

<pre><code>function deleteByIndexRecursive(arr, index, current) {
  return current+1 &lt; index.length ? deleteByIndexRecursive(arr.child[index[current]], current+1) : arr.child.splice(index[current], 1); 
}
function deleteByPath(arr, path) {
   const index = path.split('-').map((x) =&gt; +x);
   if ( 1&gt;index.length) {
     return null;
   } else if ( 1===index.length) {
     return arr.splice(index[0], 1);
   } else {
     return deleteByIndexRecursive(arr[index[0]], index, 1);
   }
}
</code></pre>


blocks|key|3991790|text|您可以编写一个递归函数，该函数沿层次结构向下遍历，直到路径可用。下面是一个非常小的代码片段。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3991791|​|3991792|const+arr+=+[
++{
++++name:+'FolderA',
++++child:+[
++++++{
++++++++name:+'FolderB',
++++++++child:+[
++++++++++{
++++++++++++name:+'FolderC0',
++++++++++++child:+[],
++++++++++},
++++++++++{
++++++++++++name:+'FolderC1',
++++++++++++child:+[],
++++++++++},
++++++++],
++++++},
++++],
++},
++{
++++name:+'FolderM',
++++child:+[],
++},
];

let+ar_path+=+"0-0-1";

function+deleteRecursive(arr,+path)+{
++if(Array.isArray(arr)+&&+path.length+>+0){
+++++const+index+=+Number(path.shift());
+++++if+(path.length+>+0)+
++++++++deleteRecursive(arr[index].child,+path)
+++++else+
++++++++arr.slice(index,+1);
++}+else+{
+++++console.log('invalid');
++}
}


deleteRecursive(arr,+ar_path.split('-'))

console.log(arr);|code-block|syntax|javascript|3991793|3991794|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|M|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|N|8|@]|9|@]|A|$G|H]]|$1|I|3|C|5|6|7|O|8|@]|9|@]|A|$]]|$1|J|3|-4|5|6|7|P|8|@]|9|@]|A|$]]]|K|$]]

<p>You could write a recursive function which travels down the hierarchy till the path is available. Below is a very minimal snippet.</p>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>const arr = [
  {
    name: 'FolderA',
    child: [
      {
        name: 'FolderB',
        child: [
          {
            name: 'FolderC0',
            child: [],
          },
          {
            name: 'FolderC1',
            child: [],
          },
        ],
      },
    ],
  },
  {
    name: 'FolderM',
    child: [],
  },
];

let ar_path = "0-0-1";

function deleteRecursive(arr, path) {
  if(Array.isArray(arr) &amp;&amp; path.length &gt; 0){
     const index = Number(path.shift());
     if (path.length &gt; 0) 
        deleteRecursive(arr[index].child, path)
     else 
        arr.slice(index, 1);
  } else {
     console.log('invalid');
  }
}


deleteRecursive(arr, ar_path.split('-'))

console.log(arr);</code></pre>
</div>
</div>
</p>


blocks|key|3988779|text|​|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3988780|//Variable+setup:
const+arr+=+[
++++{
++++++++name:+'FolderA',
++++++++child:+[
++++++++++++{
++++++++++++++++name:+'FolderB',
++++++++++++++++child:+[
++++++++++++++++++++{
++++++++++++++++++++++++name:+'FolderC0',
++++++++++++++++++++++++child:+[],
++++++++++++++++++++},
++++++++++++++++++++{
++++++++++++++++++++++++name:+'FolderC1',
++++++++++++++++++++++++child:+[],
++++++++++++++++++++},
++++++++++++++++],
++++++++++++},
++++++++],
++++},
++++{
++++++++name:+'FolderM',
++++++++child:+[],
++++},
];
const+path+=+"0-0-1";
//Break+the+path+into+pieces+to+iterate+through:
const+pathArray+=+path.split("-");
//Javascript+assignments+are+by+reference,+so+arrayToManage+is+going+to+be+an+internal+piece+within+the+original+array
let+arrayToManage+=+arr;
//We+are+going+to+iterate+through+the+children+of+the+array+till+we+get+above+where+we+want+to+remove
while(pathArray.length+>+1){
++++const+key+=+parseInt(pathArray.shift());
++++arrayToManage+=+arrayToManage[key].child;
}
//Get+the+last+position+of+the+last+array,+where+we+want+to+remove+the+item
const+key+=+parseInt(pathArray.shift());
arrayToManage.splice(key,1);
//And+because+it's+all+by+reference,+changed+we+made+to+arrayToManage+were+actually+made+on+the+arr+object
console.log("end+result:",+JSON.stringify(arr));|code-block|syntax|javascript|3988781|3988782|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|K|8|@]|9|@]|A|$E|F]]|$1|G|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|M|8|@]|9|@]|A|$]]]|I|$]]

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>//Variable setup:
const arr = [
    {
        name: 'FolderA',
        child: [
            {
                name: 'FolderB',
                child: [
                    {
                        name: 'FolderC0',
                        child: [],
                    },
                    {
                        name: 'FolderC1',
                        child: [],
                    },
                ],
            },
        ],
    },
    {
        name: 'FolderM',
        child: [],
    },
];
const path = "0-0-1";
//Break the path into pieces to iterate through:
const pathArray = path.split("-");
//Javascript assignments are by reference, so arrayToManage is going to be an internal piece within the original array
let arrayToManage = arr;
//We are going to iterate through the children of the array till we get above where we want to remove
while(pathArray.length &gt; 1){
    const key = parseInt(pathArray.shift());
    arrayToManage = arrayToManage[key].child;
}
//Get the last position of the last array, where we want to remove the item
const key = parseInt(pathArray.shift());
arrayToManage.splice(key,1);
//And because it's all by reference, changed we made to arrayToManage were actually made on the arr object
console.log("end result:", JSON.stringify(arr));</code></pre>
</div>
</div>
</p>


<p>I have an object as shown:</p>

<pre><code>const arr = [
  {
    name: 'FolderA',
    child: [
      {
        name: 'FolderB',
        child: [
          {
            name: 'FolderC0',
            child: [],
          },
          {
            name: 'FolderC1',
            child: [],
          },
        ],
      },
    ],
  },
  {
    name: 'FolderM',
    child: [],
  },
];
</code></pre>

<p>And I have path as string:</p>

<pre><code>var path = "0-0-1".
</code></pre>

<p>I have to delete the object:</p>

<pre><code>{
    name: 'FolderC1',
    child: [],
 },
</code></pre>

<p>Which I can do so by doing,</p>

<pre><code>arr[0].child[0].splice(1, 1);
</code></pre>

<p>But I want to do it dynamically. Since path string can be anything, I want the above '.' operator and splice definition to be created dynamically to splice at particular place.</p>


Deleting from an object using JavaScript

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我有一个对象，如下所示：const arr = [  {    name: 'FolderA',    child: [      {        name: 'FolderB',        child: [          {            name: 'FolderC0',            c...

问使用JavaScript从对象中删除
EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用JavaScript从对象中删除EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用JavaScript从对象中删除
EN