leetcode 每日一题 942. 增减字符串匹配
class Solution {
public int[] diStringMatch(String s) {
int[] arr = new int[s.length()+1];
int l = 0;
int r = s.length();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if(c == 'I'){
arr[i] = l++;
}else{
arr[i] = r--;
}
}
arr[arr.length-1] = r;
return arr;
}
}

class Solution {
public int[] diStringMatch(String s) {
int[] arr = new int[s.length()+1];
int l = 0;
int r = s.length();
char[] chars = s.toCharArray();
for (int i = 0; i < chars.length; i++) {
if(chars[i] == 'I'){
arr[i] = l++;
}else{
arr[i] = r--;
}
}
arr[arr.length-1] = r;
return arr;
}
}


浙公网安备 33010602011771号