![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/04e32369a43dd01837e97de7f2b2ef9a.png)
实现代码
public static int[] diStringMatch(String S) {
int N = S.length();
int low = 0, hig = N;
int[] arr= new int[N + 1];//定义数组
for (int i = 0; i < N; ++i) {
if (S.charAt(i) == 'I')
arr[i] = low++;
else
arr[i] = hig--;
}
arr[N] = low;//最后一个元素
return arr;
}