【LeetCode】942. DI String Match

最新推荐文章于 2022-05-29 09:55:42 发布

笨笨De蜗牛

最新推荐文章于 2022-05-29 09:55:42 发布

阅读量246

点赞数

分类专栏： LEETCODE 笔试编程题

本文链接：https://blog.csdn.net/a342500329a/article/details/84837126

版权

LEETCODE 同时被 2 个专栏收录

155 篇文章 0 订阅

订阅专栏

笔试编程题

21 篇文章 0 订阅

订阅专栏

Given a string S that only contains “I” (increase) or “D” (decrease), let N = S.length.

Return any permutation A of [0, 1, …, N] such that for all i = 0, …, N-1:

If S[i] == “I”, then A[i] < A[i+1]
If S[i] == “D”, then A[i] > A[i+1]

Example 1:

Input: “IDID”
Output: [0,4,1,3,2]
Example 2:

Input: “III”
Output: [0,1,2,3]
Example 3:

Input: “DDI”
Output: [3,2,0,1]
应该是贪心的思想吧，比较简单。
JAVA:

class Solution {
    public int[] diStringMatch(String S) {
        int t=0,len=S.length();
        int [] ans=new int[len+1];
        if(len<1)return ans;
        for(int i=0;i<len;i++){
            if(S.charAt(i)=='I')ans[i]=t++;
        }
        ans[len]=t++;
        for(int i=len-1;i>=0;i--){
            if(S.charAt(i)=='D')ans[i]=t++;
        }
        return ans;
    }
}