leetcode942

2024-06-20 21:54:01

public class Solution{public int[] DiStringMatch(string S){var len = S.Length;var min = 0;var max = len;var list = new List<int>();foreach (var s in S){if (s == 'D'){list.Add(max);max--;}else{list.Add(min);min++;}}list.Add(min++);return list.ToArray();}}

转载于:https://www.cnblogs.com/asenyang/p/9978838.html

leetcode942相关推荐

leetcode942. DI String Match
题目链接这是一道Easy题目题目给定只含 "I"(增大)或 "D"(减小)的字符串 S ,令 N = S.length. 返回 [0, 1, -, N] 的 ...

最新文章

热门文章