以递归算法实现对象、数组等深拷贝

最新推荐文章于 2023-02-17 18:32:30 发布

前端从爬上楼到滚下楼

最新推荐文章于 2023-02-17 18:32:30 发布

阅读量181

点赞数

文章标签：递归深拷贝 javascript es6

本文链接：https://blog.csdn.net/qq_32021025/article/details/103454750

版权

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>Document</title>
</head>
<body>
    
</body>
<script>
    let a = {
        a:1,
        b:[3,4],
        c:{
        a:1,
        b:[3,4]
    }
    }
    let b = [3,4];
    let c = 'hello world'
    function deepClone(obj){
        let result = null;
        if(typeof(obj) === 'object'){
            if(obj instanceof Array){
                result =[]
            }else {
                result = {}
            }
            for(let index in obj) {
                if(typeof(obj[index]) === 'object' && obj[index] !== null) {
                    obj[index] instanceof Array? result[index] = []:{}
                    result[index] = deepClone(obj[index]);
                }else{
                    result[index] = obj[index];
                }
            }
        }else{
            result = obj;
        }
        return result;
    }
    let res = deepClone(a);
    let res2 = deepClone(b);
    res.c.b[1] = 0;
    res2[1] = 0;
    console.log('object', a,res,b,res2)
</script>
</html>

如果想用js工具类推荐使用lodash，这只是我自己写着玩玩的

前端从爬上楼到滚下楼

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
以递归算法实现对象、数组等深拷贝

<!DOCTYPE html><html lang="en"><head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <meta http-equiv="X-U...
复制链接

扫一扫