2048游戏 JavaScript实现

字节跳动笔试题



参考Google2015校园招聘在线笔试题2–2048游戏
k记录要被放置的位置索引
1.k位置元素是0，将e[i]移到e[k]
2.k位置非零：
（1）e[i]==e[k]相同，碰撞，e[k]×=2，k移到下一个位置（++k或–k）
（2）e[i]！=e[k]不同,k移到下一个位置（++k或–k），将e[i]移到e[k]

let n = 1;
// let arr = [[0, 0, 0, 2], [0, 0, 0, 2], [0, 0, 4, 8], [0, 0, 4, 8]];
let arr = [[0, 0, 0, 0], [0, 0, 2, 2], [0, 2, 8, 8], [2, 4, 2, 16]];
if (n == 1) {//上
    for (let j = 0; j < 4; ++j) {
        let k = 0;
        for (let i = 1; i < 4 ; ++i) {
            if (0 == arr[i][j]) continue;
            if (0 == arr[k][j]) {
                arr[k][j] = arr[i][j];
                arr[i][j] = 0;
            } else if (arr[i][j] == arr[k][j]) {
                // arr[k][j] = arr[i][j]*2;
                arr[k][j] = arr[i][j]<<1;
                arr[i][j] = 0;
                ++k;
            } else {
                ++k;
                if (k != i) {
                    arr[k][j] = arr[i][j];
                    arr[i][j] = 0;
                }
            }
        }
    }
}else if (n == 2) {//下
    for (let j = 0; j < 4; ++j) {
        let k = 4 - 1;
        for (let i = 4 - 2; i >= 0; --i) {
            if (0 == arr[i][j])continue;
            if (0 == arr[k][j]) {
                arr[k][j] = arr[i][j];
                arr[i][j] = 0;
            } else if (arr[i][j] == arr[k][j]) {
                // arr[k][j] = arr[i][j] * 2;
                arr[k][j] = arr[i][j]<<1;
                arr[i][j] = 0;
                --k;
            } else {
                --k;
                if (k != i) {
                    arr[k][j] = arr[i][j];
                    arr[i][j] = 0;
                }
            }
        }
    }
}else if (n == 3) {//左
    for (let i = 0; i < 4; ++i) {
        let k = 0;
        for (let j = 1; j < 4; ++j) {
            if(0==arr[i][j])
                continue;
            if(0==arr[i][k]){
                arr[i][k]=arr[i][j];
                arr[i][j]=0;
            }else if(arr[i][j]==arr[i][k]){
                arr[i][k]=arr[i][j]<<1;
                arr[i][j]=0;
                ++k;
            }else{
                ++k;
                if(k!=j){
                    arr[i][k]=arr[i][j];
                    arr[i][j]=0;
                }
            }
        }
    }
}else{//右
    for (let i = 0; i < 4-1; ++i) {
        let k = 4-1;
        for (let j = 4-2; j >=0; --j) {
            if(0==arr[i][j])
                continue;
            if(0==arr[i][k]){
                arr[i][k]=arr[i][j];
                arr[i][j]=0;
            }else if(arr[i][j]==arr[i][k]){
                arr[i][k]=arr[i][j]<<1;
                arr[i][j]=0;
                --k;
            }else{
                --k;
                if(k!=j){
                    arr[i][k]=arr[i][j];
                    arr[i][j]=0;
                }
            }
        }
    }
};
console.log(arr);

复杂度O(n^2)