leetcode 165

来源：互联网发布：java 畅言评论插件编辑：程序博客网时间：2024/05/20 16:37

我的代码效率居然排100%

但看别人的代码我这个代码不够精简。

var search1 = function ( version1 ,version2) {    pos1 = version1.indexOf('.');    pos2 = version2.indexOf('.');    if(pos1==-1 && pos2==-1){        if(parseFloat(version1)==parseFloat(version2)){            return 0;        }else{            return parseFloat(version1)>parseFloat(version2)?1:-1;        }    }    if (pos1 != -1) {        n11 = parseFloat(version1.substr(0, pos1));        n12 = version1.substr(pos1 + 1, version1.length - pos1 - 1);    } else {        n11 = parseFloat(version1);        n12 = "0";    }    if (pos2 != -1) {        n21 = parseFloat(version2.substr(0, pos2));        n22 = version2.substr(pos2 + 1, version2.length - pos2 - 1);    } else {        n21 = parseFloat(version2);        n22 = "0";    }    //console.log(n11,n21,n12,n22);    if (n11 != n21) {        return n11 > n21 ? 1 : -1;    }    return search1(n12,n22);};return search1(version1,version2);

阅读全文

0 0