1750. Minimum Length of String After Deleting Similar Ends

發表於 | 分類於

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
    int minimumLength(string s) {
        int n = s.size();
        int l = 0, r = n-1;
        bool flag = true;
        while( s[l] == s[r] && l!=r ){
            while(l<r && s[l] == s[r] && s[l] ==s[l+1]) l++;
            while(l<r && s[l] == s[r] && s[r] == s[r-1]) r--;
            if(l!=r){
                flag = true;
                l++;
                r--;
            }
            else flag = false;
        }
        if(l==r ) {
            if(flag) return 1;
            else return 0;
        }
        else return r-l+1;
    }
};

analysis

  • time complexity O(1)
  • space complexity O(1)