string-rotation-lcci

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

本书是原谷歌资深面试官的经验之作，帮助了许多想要加入脸书、苹果、谷歌等 IT 名企的求职者拿到 Dream offer。本专题的 100+ 编程面试题是在原书基础上精心挑选出来的，帮助你轻松应战 IT 名企技术面试。

英文版：Cracking the Coding Interview，源自硅谷程序员的面试红宝书

LCCI

Given two strings, <code>s1</code>&nbsp;and <code>s2</code>, write code to check if <code>s2</code> is a rotation of <code>s1</code> (e.g.,&quot;waterbottle&quot; is a rotation of&quot;erbottlewat&quot;).&nbsp;Can you use&nbsp;only one call to the method that&nbsp;checks if one word is a substring of another?

Example 1:

<pre>
Input: s1 = &quot;waterbottle&quot;, s2 = &quot;erbottlewat&quot;
Output: True
</pre>

Example 2:

<pre>
Input: s1 = &quot;aa&quot;, s2 = &quot;aba&quot;
Output: False
</pre>

&nbsp;

Note:

<ol>
	<li><code>0 &lt;= s1.length, s2.length &lt;=&nbsp;100000</code></li>
</ol>

isFlipedString

String Rotation LCCI

String

String Matching

字符串轮转。给定两个字符串<code>s1</code>和<code>s2</code>，请编写代码检查<code>s2</code>是否为<code>s1</code>旋转而成（比如，<code>waterbottle</code>是<code>erbottlewat</code>旋转后的字符串）。

示例 1：

<pre>
 输入：s1 = "waterbottle", s2 = "erbottlewat"
 输出：True
</pre>

示例 2：

<pre>
 输入：s1 = "aa", s2 = "aba"
 输出：False
</pre>

<ol>
</ol>

提示：

<ol>
	<li>字符串长度在[0, 100000]范围内。</li>
</ol>

说明:

<ol>
	<li>你能只调用一次检查子串的方法吗？</li>
</ol>