华为2019秋招笔试题答案(前端)

版权声明:转载请声明出处 https://blog.csdn.net/weixin_40890907/article/details/82687444
//取出字符串中最后一个不重复的字符
    var str = 'sshfajaohfiaoh'
    function lastWord(str) {
        var arr = str.split("").reverse()
        var res = []
        for (var i = 0; i < arr.length; i++) {
            if (arr.lastIndexOf(arr[i]) === arr.indexOf(arr[i])) {
                return arr[i]
            }
        }
    }
    console.log(lastWord(str))
//乘法
    var str1 = '363';
    var str2 = '225'
    var big = '';
    var small = '';
    var add = 0;
    var obj = [];
    var result = [];
    var answer = [];
    if (str1.length >= str2.length) {
        big += str1;
        small += str2;
    } else {
        big += str2;
        small += str1;
    }
    var arr1 = big.split('');
    var arr2 = small.split('').reverse();
    for (var i = 0; i < arr2.length; i++) {
        obj[i] = new  Array(i);
        for (var j = 0; j < arr1.length; j++) {
            obj[i][j] = arr2[i] * arr1[j];
        }
        obj[i].reverse();
    }
    for (var k = 0; k < obj.length; k++) {
        var p = k;
        var q = obj.length;
        while (p) {
            obj[k].unshift(0);
            p--;
        }
        while (obj[k].length <= (str1.length + str2.length - 2)) {
            obj[k].push(0);
        }
    }
    for (var q = 0; q < obj[str2.length - 1].length; q++) {
        var t = str2.length - 1;
        var sum = 0;
        while (t >= 0) {
            sum += obj[t][q];
            t--;
        }
        result.push(sum);
    }
    for (var r = 0; r < result.length; r++) {
        result[r] += add;
        add = 0;
        var x = Math.floor(result[r] / 10);
        var y = result[r] % 10;
        answer.push(y);
        if (x > 0) {
            add += x;
        }
    }
    console.log(answer.reverse().join(''))

猜你喜欢

转载自blog.csdn.net/weixin_40890907/article/details/82687444