给定只含 "I"
(增大)或 "D"
(减小)的字符串 S
,令 N = S.length
。
返回 [0, 1, ..., N]
的任意排列 A
使得对于所有 i = 0, ..., N-1
,都有:
- 如果
S[i] == "I"
,那么A[i] < A[i+1]
- 如果
S[i] == "D"
,那么A[i] > A[i+1]
示例 1:
输入:"IDID" 输出:[0,4,1,3,2]
示例 2:
输入:"III" 输出:[0,1,2,3]
示例 3:
输入:"DDI" 输出:[3,2,0,1]
提示:
1 <= S.length <= 10000
S
只包含字符"I"
或"D"
。
import java.util.Arrays;
public class Solution941 {
public int[] diStringMatch(String S) {
int[] out = new int[S.length() + 1];
int temp = 0;
for (int i = 0; i < out.length; i++) {
out[i] = i;
}
// System.out.println(Arrays.toString(out));
for (int i = 0; i < S.length(); i++) {
if (S.charAt(i) == 'I') {
Arrays.sort(out, i, out.length);
// System.out.println(Arrays.toString(out));
}
if (S.charAt(i) == 'D') {
temp = out[i];
out[i] = out[out.length - 1];
out[out.length - 1] = temp;
// System.out.println(Arrays.toString(out));
Arrays.sort(out, i + 1, out.length);
}
}
return out;
}
public static void main(String[] args) {
Solution941 sol = new Solution941();
String S = "III";
// [0,4,1,3,2]
System.out.println(Arrays.toString(sol.diStringMatch(S)));
}
}