双指针：求解《942. 增减字符串匹配》

var diStringMatch = function(s) {
  const n = max = s.length, r = new Uint32Array(n + 1)
  let min = 0, i = -1
  while (i++ < n) r[i] = s[i] === 'I' ? min++ : max--
  return r
};

function diStringMatch(s: string): number[] {
  const n = s.length, r = new Array(n + 1)
  let i = -1, min = 0, max = n
  while (i++ < n) r[i] = s[i] === 'I' ? min++ : max--
  return r
};

func diStringMatch(s string) []int {
  n := len(s)
  r := make([]int, n + 1)
  min, max := 0, n
  for i := 0; i <= n; i++ {
    if i < n && s[i] == 'I' {
      r[i] = min
      min++
    } else {
      r[i] = max
      max--
    }
  }
  return r
}

class Solution {
  function diStringMatch($s) {
    $n = strlen($s);
    $r = array_fill(0, $n, 0);
    $min = 0;
    $max = $n;
    for ($i = 0;  $i <= $n; $i++) {
      $r[$i] = $s[$i] === 'I' ? $min++ : $max--;
    }
    return $r;
  }
}

class Solution:
    def diStringMatch(self, s: str) -> List[int]:
        n = len(s)
        r = [0] * (n + 1)
        min, max = 0, n
        for i in range(n):
            if s[i] == 'I':
                r[i] = min
                min += 1
            else:
                r[i] = max
                max -= 1
        r[n] = max
        return r

class Solution {
    public int[] diStringMatch(String s) {
        int n = s.length(), min = 0, max = n;
        int[] r = new int[n + 1];
        for (int i = 0; i < n; i++) {
            r[i] = s.charAt(i) == 'I' ? min++ : max--;
        }
        r[n] = max;
        return r;
    }
}