编辑代码

// 对版本数组 arr = ["2.0",  "1.2.1", "1.3"] 进行升序，并计算圈复杂度
// 数组里对象
function solution(){
     const arr = ["2.0", "1.2.1", "1.3"]


     arr.sort(function(version1, version2) {
         const a = version1.split('.');
         const b = version2.split('.');
         const maxLength = Math.max(a.length, b.length);
         for (let i = 0; i < maxLength; i++) {
             const cur = a[i] || 0;
             const next = b[i] || 0;
             if (a[i] === b[i]) continue;
             if (parseInt(cur) > parseInt(next)) {
                 return 1;
             } else if(parseInt(cur) < parseInt(next)) {
                 return -1;
             }
         }
         return 0;
     })


    console.log(arr)
}

solution()