LeetCode: 796. Rotate String

友情支持

如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

支付宝

有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

wx jikerizhi

公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

796. Rotate String

LeetCode - Rotate String

We are given two strings, A and B.

A shift on A` consists of taking string `A and moving the leftmost character to the rightmost position. For example, if A = 'abcde', then it will be 'bcdea' after one shift on A. Return True if and only if A can become B after some number of shifts on A.

Example 1:
Input: A = 'abcde', B = 'cdeab'
Output: true

Example 2:
Input: A = 'abcde', B = 'abced'
Output: false

Note:

A and B will have length at most 100.

思路分析

一刷

1
2
3
4
5
6
7
8
/**
 * @author D瓜哥 · https://www.diguage.com
 * @since 2024-09-21 20:48:24
 */
public boolean rotateString(String s, String goal) {
  return (s.length() == goal.length())
    && ((s + s).contains(goal));
}