feat:华为笔试题

Author: Z1hgq

dp/maxSubArray.js

@@ -14,6 +14,6 @@ const maxSubArray = function (nums) {
   return max;
 };
 
-const arr = [-2, 1, 3, 4, -1, 2, 1, -5, 4];
+const arr = [-2, 1, -3, 4, -1, 2, 1, -5, 4];
 
 console.log(maxSubArray(arr));

dp/maxSubArray.ts

@@ -0,0 +1,12 @@
+function maxSubArray(nums: number[]): number {
+    const dp: number[] = [];
+    dp[0] = nums[0];
+    for (let i = 1; i < nums.length; i++) {
+        if (dp[i - 1] > 0) dp[i] = dp[i - 1] + nums[i];
+        else dp[i] = nums[i];
+    }
+    return Math.max(...dp);
+}
+
+const nums = [-2,1,-3,4,-1,2,1,-5,4];
+console.log(maxSubArray(nums));

huawei/climbStairs.js

@@ -0,0 +1,24 @@
+/**
+ * 经典的爬台阶问题，一次走一个台阶或者三个台阶，求走n级台阶总共有多少种走法，台阶数不超过50
+ * @param {number} n
+ * @return {number}
+ */
+var climbStairs = function(n) {
+    if (n < 3) {
+        return 1;
+    }
+    if (n === 3) {
+        return 2;
+    }
+    return climbStairs(n - 1) + climbStairs(n - 3);
+};
+console.log(climbStairs(50));
+var dpClimbStairs = function(n) {
+    const dp = [];
+    dp[0] = 1, dp[1] = 1, dp[2] = 2;
+    for (let i = 3; i < n; i++) {
+        dp[i] = dp[i - 1] + dp[i - 3];
+    }
+    return dp[n - 1];
+};
+console.log(dpClimbStairs(50));

huawei/squre.js

@@ -0,0 +1,56 @@
+
+const len = 3
+const square = [];
+arr = [
+    '8 1 6',
+    '3 5 7',
+    '4 99 2'
+]
+for (const item of arr) {
+    let lineArr = item.split(' ');
+    for (let i = 0; i < len; i++) {
+        lineArr[i] = parseInt(lineArr[i]);
+    }
+    square.push(lineArr);
+}
+
+const lineCount = [];
+const colCount = [];
+let lineError;
+let colError;
+let rightCount;
+
+for (let i = 0; i < len; i++) {
+    let lcount = 0;
+    let ccount = 0;
+    for (let j = 0; j < len; j++) {
+        lcount += square[i][j];
+        ccount += square[j][i];
+    }
+    lineCount.push(lcount);
+    colCount.push(ccount);
+}
+
+const lineCopy = [...lineCount];
+const colCopy = [...colCount];
+
+lineCopy.sort();
+if (lineCopy[0] !== lineCopy[1] && lineCopy[1] === lineCopy[2]) {
+    lineError = lineCopy[0];
+    rightCount = lineCopy[1];
+} else {
+    lineError = lineCopy[len - 1];
+    rightCount = lineCopy[0];
+}
+colCopy.sort();
+if (colCopy[0] !== colCopy[1] && colCopy[1] === colCopy[2]) {
+    colError = colCopy[0];
+} else {
+    colError = colCopy[len - 1];
+}
+const lineIndex = lineCount.indexOf(lineError);
+const colIndex = colCount.indexOf(colError);
+const rightNum = rightCount - lineError + square[lineIndex][colIndex];
+
+console.log(`${lineIndex + 1} ${colIndex + 1} ${rightNum}`);
+