feat: add ts solution to lc problem: No.0826

Author: rain84

solution/0800-0899/0826.Most Profit Assigning Work/README.md

@@ -190,4 +190,35 @@ function maxProfitAssignment(difficulty: number[], profit: number[], worker: num
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Memoization
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function maxProfitAssignment(difficulty: number[], profit: number[], worker: number[]): number {
+    const wMax = Math.max(...worker);
+    const jobs = Array(wMax + 1).fill(0);
+    const n = profit.length;
+
+    for (let i = 0; i < n; i++) {
+        const d = difficulty[i];
+        if (d <= wMax) jobs[d] = Math.max(jobs[d], profit[i]);
+    }
+
+    for (let i = 1, x = 0; i <= wMax; i++) {
+        jobs[i] = Math.max(jobs[i], jobs[i - 1]);
+    }
+
+    return worker.reduce((acc, w) => acc + jobs[w], 0);
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0800-0899/0826.Most Profit Assigning Work/README_EN.md

@@ -190,4 +190,35 @@ function maxProfitAssignment(difficulty: number[], profit: number[], worker: num
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Memoization
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function maxProfitAssignment(difficulty: number[], profit: number[], worker: number[]): number {
+    const wMax = Math.max(...worker);
+    const jobs = Array(wMax + 1).fill(0);
+    const n = profit.length;
+
+    for (let i = 0; i < n; i++) {
+        const d = difficulty[i];
+        if (d <= wMax) jobs[d] = Math.max(jobs[d], profit[i]);
+    }
+
+    for (let i = 1, x = 0; i <= wMax; i++) {
+        jobs[i] = Math.max(jobs[i], jobs[i - 1]);
+    }
+
+    return worker.reduce((acc, w) => acc + jobs[w], 0);
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0800-0899/0826.Most Profit Assigning Work/Solution2.ts

@@ -0,0 +1,16 @@
+function maxProfitAssignment(difficulty: number[], profit: number[], worker: number[]): number {
+    const wMax = Math.max(...worker);
+    const jobs = Array(wMax + 1).fill(0);
+    const n = profit.length;
+
+    for (let i = 0; i < n; i++) {
+        const d = difficulty[i];
+        if (d <= wMax) jobs[d] = Math.max(jobs[d], profit[i]);
+    }
+
+    for (let i = 1, x = 0; i <= wMax; i++) {
+        jobs[i] = Math.max(jobs[i], jobs[i - 1]);
+    }
+
+    return worker.reduce((acc, w) => acc + jobs[w], 0);
+}