LeetCode 777. Swap Adjacent in LR String (Medium)

Acknowledgement:

感谢大神 shenweihai
原题解链接:https://leetcode.com/problems/swap-adjacent-in-lr-string/discuss/217070/Python-using-corresponding-position-

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.

Example:
Input: start = "RXXLRXRXL", end = "XRLXXRRLX"
Output: True
Explanation:
We can transform start to end following these steps:
RXXLRXRXL ->
XRXLRXRXL ->
XRLXRXRXL ->
XRLXXRRXL ->
XRLXXRRLX
Note:
  1. 1 <= len(start) = len(end) <= 10000.
  2. Both start and end will only consist of characters in {‘L’, ‘R’, ‘X’}.

Analysis:

在这里插入图片描述


Code:
class Solution {
    public boolean canTransform(String start, String end) {
        List<Record> list1 = getRecords(start);
        List<Record> list2 = getRecords(end);
        
        if(list1.size() != list2.size()) {
            return false;
        }
        
        for(int i = 0; i < list1.size(); i++) {
            Record record1 = list1.get(i), record2 = list2.get(i);
            char ch1 = record1.getCh(), ch2 = record2.getCh();
            int index1 = record1.getIndex(), index2 = record2.getIndex();
            if(ch1 != ch2) {
                return false;
            }else {
                if(ch1 == 'L' && index1 < index2) {
                    return false;
                }else if(ch1 == 'R' && index1 > index2) {
                    return false;
                }
            }
        }
            
        return true;  
    }
    
    public List<Record> getRecords(String s) {
        List<Record> list = new ArrayList<>();
        char[] ch = s.toCharArray();
        for(int i = 0; i < ch.length; i++) {
            if(ch[i] == 'L' || ch[i] == 'R') {
                list.add(new Record(i, ch[i]));
            }
        }
        return list;
    }
}

class Record {
    int index;
    char ch;
    
    public Record(int index, char ch) {
        this.index = index;
        this.ch = ch;
    }
    
    public int getIndex() {
        return index;
    }
    
    public char getCh() {
        return ch;
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值