feat: add solutions to lc problem: No.1405

solution/1400-1499/1405.Longest Happy String/README.md

@@ -287,4 +287,76 @@ function longestDiverseString(a: number, b: number, c: number): string {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### 方法二：贪心 + 优先队列（另一种写法）
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function longestDiverseString(a: number, b: number, c: number): string {
+    let res = '';
+    let prev = { ch: '', c: 0 };
+    let last = { ch: '', c: 0 };
+    const pq = new MaxPriorityQueue({ priority: ({ c }) => c });
+
+    pq.enqueue({ ch: 'a', c: a });
+    pq.enqueue({ ch: 'b', c: b });
+    pq.enqueue({ ch: 'c', c });
+
+    while (pq.size()) {
+        const item = pq.dequeue().element;
+        let c = item.c < prev.c ? 1 : 2;
+
+        if (prev.c) pq.enqueue(prev);
+        if (last.ch !== item.ch && item.c) last = { ...item, c: 0 };
+
+        while (c-- && item.c && last.c++ < 2) {
+            item.c--;
+            res += item.ch;
+        }
+        prev = item;
+    }
+
+    return res;
+}
+```
+
+#### JavaScript
+
+```js
+function longestDiverseString(a, b, c) {
+    let res = '';
+    let prev = { ch: '', c: 0 };
+    let last = { ch: '', c: 0 };
+    const pq = new MaxPriorityQueue({ priority: ({ c }) => c });
+
+    pq.enqueue({ ch: 'a', c: a });
+    pq.enqueue({ ch: 'b', c: b });
+    pq.enqueue({ ch: 'c', c });
+
+    while (pq.size()) {
+        const item = pq.dequeue().element;
+        let c = item.c < prev.c ? 1 : 2;
+
+        if (prev.c) pq.enqueue(prev);
+        if (last.ch !== item.ch && item.c) last = { ...item, c: 0 };
+
+        while (c-- && item.c && last.c++ < 2) {
+            item.c--;
+            res += item.ch;
+        }
+        prev = item;
+    }
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1400-1499/1405.Longest Happy String/README_EN.md

@@ -284,4 +284,76 @@ function longestDiverseString(a: number, b: number, c: number): string {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Greedy + Priority Queue
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function longestDiverseString(a: number, b: number, c: number): string {
+    let res = '';
+    let prev = { ch: '', c: 0 };
+    let last = { ch: '', c: 0 };
+    const pq = new MaxPriorityQueue({ priority: ({ c }) => c });
+
+    pq.enqueue({ ch: 'a', c: a });
+    pq.enqueue({ ch: 'b', c: b });
+    pq.enqueue({ ch: 'c', c });
+
+    while (pq.size()) {
+        const item = pq.dequeue().element;
+        let c = item.c < prev.c ? 1 : 2;
+
+        if (prev.c) pq.enqueue(prev);
+        if (last.ch !== item.ch && item.c) last = { ...item, c: 0 };
+
+        while (c-- && item.c && last.c++ < 2) {
+            item.c--;
+            res += item.ch;
+        }
+        prev = item;
+    }
+
+    return res;
+}
+```
+
+#### JavaScript
+
+```js
+function longestDiverseString(a, b, c) {
+    let res = '';
+    let prev = { ch: '', c: 0 };
+    let last = { ch: '', c: 0 };
+    const pq = new MaxPriorityQueue({ priority: ({ c }) => c });
+
+    pq.enqueue({ ch: 'a', c: a });
+    pq.enqueue({ ch: 'b', c: b });
+    pq.enqueue({ ch: 'c', c });
+
+    while (pq.size()) {
+        const item = pq.dequeue().element;
+        let c = item.c < prev.c ? 1 : 2;
+
+        if (prev.c) pq.enqueue(prev);
+        if (last.ch !== item.ch && item.c) last = { ...item, c: 0 };
+
+        while (c-- && item.c && last.c++ < 2) {
+            item.c--;
+            res += item.ch;
+        }
+        prev = item;
+    }
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/1400-1499/1405.Longest Happy String/Solution2.js

@@ -0,0 +1,26 @@
+function longestDiverseString(a, b, c) {
+    let res = '';
+    let prev = { ch: '', c: 0 };
+    let last = { ch: '', c: 0 };
+    const pq = new MaxPriorityQueue({ priority: ({ c }) => c });
+
+    pq.enqueue({ ch: 'a', c: a });
+    pq.enqueue({ ch: 'b', c: b });
+    pq.enqueue({ ch: 'c', c });
+
+    while (pq.size()) {
+        const item = pq.dequeue().element;
+        let c = item.c < prev.c ? 1 : 2;
+
+        if (prev.c) pq.enqueue(prev);
+        if (last.ch !== item.ch && item.c) last = { ...item, c: 0 };
+
+        while (c-- && item.c && last.c++ < 2) {
+            item.c--;
+            res += item.ch;
+        }
+        prev = item;
+    }
+
+    return res;
+}

solution/1400-1499/1405.Longest Happy String/Solution2.ts

@@ -0,0 +1,26 @@
+function longestDiverseString(a: number, b: number, c: number): string {
+    let res = '';
+    let prev = { ch: '', c: 0 };
+    let last = { ch: '', c: 0 };
+    const pq = new MaxPriorityQueue({ priority: ({ c }) => c });
+
+    pq.enqueue({ ch: 'a', c: a });
+    pq.enqueue({ ch: 'b', c: b });
+    pq.enqueue({ ch: 'c', c });
+
+    while (pq.size()) {
+        const item = pq.dequeue().element;
+        let c = item.c < prev.c ? 1 : 2;
+
+        if (prev.c) pq.enqueue(prev);
+        if (last.ch !== item.ch && item.c) last = { ...item, c: 0 };
+
+        while (c-- && item.c && last.c++ < 2) {
+            item.c--;
+            res += item.ch;
+        }
+        prev = item;
+    }
+
+    return res;
+}