feat: add solutions to lc problems: No.1691,1699

solution/1600-1699/1691.Maximum Height by Stacking Cuboids/README.md

@@ -128,7 +128,9 @@ class Solution {
 class Solution {
 public:
     int maxHeight(vector<vector<int>>& cuboids) {
-        for (auto& c : cuboids) sort(c.begin(), c.end());
+        for (auto& c : cuboids) {
+            sort(c.begin(), c.end());
+        }
         sort(cuboids.begin(), cuboids.end());
         int n = cuboids.size();
         vector<int> f(n);
@@ -168,6 +170,33 @@ func maxHeight(cuboids [][]int) int {
 }
 ```
 
+```ts
+function maxHeight(cuboids: number[][]): number {
+    for (const c of cuboids) {
+        c.sort((a, b) => a - b);
+    }
+    cuboids.sort((a, b) => {
+        if (a[0] !== b[0]) {
+            return a[0] - b[0];
+        }
+        if (a[1] !== b[1]) {
+            return a[1] - b[1];
+        }
+        return a[2] - b[2];
+    });
+    const n = cuboids.length;
+    const f = Array(n).fill(0);
+    for (let i = 0; i < n; ++i) {
+        for (let j = 0; j < i; ++j) {
+            const ok = cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2];
+            if (ok) f[i] = Math.max(f[i], f[j]);
+        }
+        f[i] += cuboids[i][2];
+    }
+    return Math.max(...f);
+}
+```
+
 ```js
 /**
  * @param {number[][]} cuboids
@@ -178,12 +207,16 @@ var maxHeight = function (cuboids) {
         c.sort((a, b) => a - b);
     }
     cuboids.sort((a, b) => {
-        if (a[0] != b[0]) return a[0] - b[0];
-        if (a[1] != b[1]) return a[1] - b[1];
+        if (a[0] !== b[0]) {
+            return a[0] - b[0];
+        }
+        if (a[1] !== b[1]) {
+            return a[1] - b[1];
+        }
         return a[2] - b[2];
     });
     const n = cuboids.length;
-    const f = new Array(n).fill(0);
+    const f = Array(n).fill(0);
     for (let i = 0; i < n; ++i) {
         for (let j = 0; j < i; ++j) {
             const ok = cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2];

solution/1600-1699/1691.Maximum Height by Stacking Cuboids/README_EN.md

@@ -124,7 +124,9 @@ class Solution {
 class Solution {
 public:
     int maxHeight(vector<vector<int>>& cuboids) {
-        for (auto& c : cuboids) sort(c.begin(), c.end());
+        for (auto& c : cuboids) {
+            sort(c.begin(), c.end());
+        }
         sort(cuboids.begin(), cuboids.end());
         int n = cuboids.size();
         vector<int> f(n);
@@ -164,6 +166,33 @@ func maxHeight(cuboids [][]int) int {
 }
 ```
 
+```ts
+function maxHeight(cuboids: number[][]): number {
+    for (const c of cuboids) {
+        c.sort((a, b) => a - b);
+    }
+    cuboids.sort((a, b) => {
+        if (a[0] !== b[0]) {
+            return a[0] - b[0];
+        }
+        if (a[1] !== b[1]) {
+            return a[1] - b[1];
+        }
+        return a[2] - b[2];
+    });
+    const n = cuboids.length;
+    const f = Array(n).fill(0);
+    for (let i = 0; i < n; ++i) {
+        for (let j = 0; j < i; ++j) {
+            const ok = cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2];
+            if (ok) f[i] = Math.max(f[i], f[j]);
+        }
+        f[i] += cuboids[i][2];
+    }
+    return Math.max(...f);
+}
+```
+
 ```js
 /**
  * @param {number[][]} cuboids
@@ -174,12 +203,16 @@ var maxHeight = function (cuboids) {
         c.sort((a, b) => a - b);
     }
     cuboids.sort((a, b) => {
-        if (a[0] != b[0]) return a[0] - b[0];
-        if (a[1] != b[1]) return a[1] - b[1];
+        if (a[0] !== b[0]) {
+            return a[0] - b[0];
+        }
+        if (a[1] !== b[1]) {
+            return a[1] - b[1];
+        }
         return a[2] - b[2];
     });
     const n = cuboids.length;
-    const f = new Array(n).fill(0);
+    const f = Array(n).fill(0);
     for (let i = 0; i < n; ++i) {
         for (let j = 0; j < i; ++j) {
             const ok = cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2];

solution/1600-1699/1691.Maximum Height by Stacking Cuboids/Solution.cpp

@@ -1,7 +1,9 @@
 class Solution {
 public:
     int maxHeight(vector<vector<int>>& cuboids) {
-        for (auto& c : cuboids) sort(c.begin(), c.end());
+        for (auto& c : cuboids) {
+            sort(c.begin(), c.end());
+        }
         sort(cuboids.begin(), cuboids.end());
         int n = cuboids.size();
         vector<int> f(n);

solution/1600-1699/1691.Maximum Height by Stacking Cuboids/Solution.js

@@ -7,12 +7,16 @@ var maxHeight = function (cuboids) {
         c.sort((a, b) => a - b);
     }
     cuboids.sort((a, b) => {
-        if (a[0] != b[0]) return a[0] - b[0];
-        if (a[1] != b[1]) return a[1] - b[1];
+        if (a[0] !== b[0]) {
+            return a[0] - b[0];
+        }
+        if (a[1] !== b[1]) {
+            return a[1] - b[1];
+        }
         return a[2] - b[2];
     });
     const n = cuboids.length;
-    const f = new Array(n).fill(0);
+    const f = Array(n).fill(0);
     for (let i = 0; i < n; ++i) {
         for (let j = 0; j < i; ++j) {
             const ok = cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2];

solution/1600-1699/1691.Maximum Height by Stacking Cuboids/Solution.ts

@@ -0,0 +1,24 @@
+function maxHeight(cuboids: number[][]): number {
+    for (const c of cuboids) {
+        c.sort((a, b) => a - b);
+    }
+    cuboids.sort((a, b) => {
+        if (a[0] !== b[0]) {
+            return a[0] - b[0];
+        }
+        if (a[1] !== b[1]) {
+            return a[1] - b[1];
+        }
+        return a[2] - b[2];
+    });
+    const n = cuboids.length;
+    const f = Array(n).fill(0);
+    for (let i = 0; i < n; ++i) {
+        for (let j = 0; j < i; ++j) {
+            const ok = cuboids[j][1] <= cuboids[i][1] && cuboids[j][2] <= cuboids[i][2];
+            if (ok) f[i] = Math.max(f[i], f[j]);
+        }
+        f[i] += cuboids[i][2];
+    }
+    return Math.max(...f);
+}