Longest Happy String LeetCode solution in JavaScript

1
var longestDiverseString = function (a, b, c) {
2
  let str = "",
3
    aCount = 0,
4
    bCount = 0,
5
    cCount = 0;
6
  let len = a + b + c;
7
  for (let i = 0; i < len; i++) {
8
    if (
9
      (a >= b && a >= c && aCount != 2) ||
10
      (bCount == 2 && a > 0) ||
11
      (cCount == 2 && a > 0)
12
    ) {
13
      adjustCounts("a", aCount + 1, 0, 0);
14
      a--;
15
    } else if (
16
      (b >= a && b >= c && bCount != 2) ||
17
      (aCount == 2 && b > 0) ||
18
      (cCount == 2 && b > 0)
19
    ) {
20
      adjustCounts("b", 0, bCount + 1, 0);
21
      b--;
22
    } else if (
23
      (c >= a && c >= b && cCount != 2) ||
24
      (bCount == 2 && c > 0) ||
25
      (aCount == 2 && c > 0)
26
    ) {
27
      adjustCounts("c", 0, 0, cCount + 1);
28
      c--;
29
    }
30
  }
31

32
  function adjustCounts(letter, newA, newB, newC) {
33
    aCount = newA;
34
    bCount = newB;
35
    cCount = newC;
36
    str += letter;
37
  }
38

39
  return str;
40
};