Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    796 - Rotate String.

    Easy

    Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s.

    A shift on s consists of moving the leftmost character of s to the rightmost position.

    • For example, if s = "abcde", then it will be "bcdea" after one shift.

    Example 1:

    Input: s = "abcde", goal = "cdeab"

    Output: true

    Example 2:

    Input: s = "abcde", goal = "abced"

    Output: false

    Constraints:

    • 1 <= s.length, goal.length <= 100

    • s and goal consist of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Boolean rotateString(String s, String goal)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait