国产xxxx99真实实拍_久久不雅视频_高清韩国a级特黄毛片_嗯老师别我我受不了了小说

資訊專欄INFORMATION COLUMN

[LeetCode] Rotate String

MonoLog / 944人閱讀

Problem

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.

Solution 
class Solution {
    public boolean rotateString(String A, String B) {
        // if (A == null) return B == null;
        // if (B == null) return A == null;
        if (A.length() == 0) return B.length() == 0;
        if (A.length() != B.length()) return false;
        String AA = new String(A+A);
        for (int i = 0; i < A.length(); i++) {
            if (AA.substring(i, i+A.length()).equals(B)) return true;
        }
        return false;
    }
}

文章版權(quán)歸作者所有，未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請注明本文地址：http://m.specialneedsforspecialkids.com/yun/76811.html

相關(guān)文章

  • [LintCode/LeetCode] Rotate Array

    Problem Given an array, rotate the array to the right by k steps, where k is non-negative. Example Example 1: Input: [1,2,3,4,5,6,7] and k = 3Output: [5,6,7,1,2,3,4]Explanation:rotate 1 steps to the r...

    chanthuang 評論0 收藏0

  • [LeetCode] 48. Rotate Image

    Problem You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in-place, which means you have to modify the input 2D mat...

    Warren 評論0 收藏0

  • LeetCode[48] Rotate Image

    LeetCode[48] Rotate Image You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up:Could you do this in-place? 復(fù)雜度O(N^2),O(1) 代碼 public void ro...

    sanyang 評論0 收藏0

  • LeetCode 189.Rotate Array

    摘要：問題描述解題思路使用數(shù)組自帶的方法和方法把數(shù)組最后一個取出來加入到頭部。使用數(shù)組的方法得到后個數(shù)，再用方法刪去后個數(shù)，最后用方法把得到的后個數(shù)添加到數(shù)組前面。 問題描述： 189.Rotate Array Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, t...

    leanote 評論0 收藏0

  • leetcode 48 Rotate Image

    摘要：題目詳情這道題目要求我們對一個正方形矩陣進行順時針度的翻轉(zhuǎn)。并且要求不聲明額外的空間，不能新建二維數(shù)組。輸入數(shù)組旋轉(zhuǎn)后的輸入數(shù)組想法這道題因為要求在位。所以我們需要找到一種解法，使得每次操作都是交換兩個元素的位置，最后實現(xiàn)整個矩陣的旋轉(zhuǎn)。 題目詳情 You are given an n x n 2D matrix representing an image.Rotate the ima...

    kgbook 評論0 收藏0

發(fā)表評論

0條評論

最新活動
閱讀需要支付1元查看
<