leetcode#777. Swap Adjacent in LR String

leetcode#777. Swap Adjacent in LR String

Problem Description:

In a string composed of ‘L’, ‘R’, and ‘X’ characters, like “RXXLRXRXL”, a move consists of either replacing one occurrence of “XL” with “LX”, or replacing one occurrence of “RX” with “XR”. Given the starting string start and the ending string end, return True if and only if there exists a sequence of moves to transform one string to the other.

Solution:
This problem is similar to quotes match more or less. The transformation can’t exchange the relative positions between L and R and X is useless. So we can solve the problem by stack easily. We scan the start and end simultaneously. Each time we meet an L in end or a R in start, we push it into the stack. On the other hand, each time we meet an L in start or a R in end we pop it from the stack. The condition that there exists a sequence of moves to transform one string to the other is that if and only if the stack is empty after the scanning.

Code:

class Solution {
public:
    bool canTransform(string start, string end) {
        stack<int> s;
        for (int i=0; i<start.size(); i++) {
            if (end[i] == 'L') s.push(1);
            if (start[i] == 'L' && !s.empty()) {
                if (s.top() == 1) s.pop();
                else return false;
            }
            if (start[i] == 'R') s.push(2);
            if (end[i] == 'R' && !s.empty()) {
                if (s.top() == 2) s.pop();
                else return false;
            }
        }
        return s.empty();
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值