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.
Solutionclass 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; } }
文章版權歸作者所有,未經允許請勿轉載,若此文章存在違規行為,您可以聯系管理員刪除。
轉載請注明本文地址:http://specialneedsforspecialkids.com/yun/76811.html
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...
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...
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? 復雜度O(N^2),O(1) 代碼 public void ro...
摘要:問題描述解題思路使用數組自帶的方法和方法把數組最后一個取出來加入到頭部。使用數組的方法得到后個數,再用方法刪去后個數,最后用方法把得到的后個數添加到數組前面。 問題描述: 189.Rotate Array Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, t...
摘要:題目詳情這道題目要求我們對一個正方形矩陣進行順時針度的翻轉。并且要求不聲明額外的空間,不能新建二維數組。輸入數組旋轉后的輸入數組想法這道題因為要求在位。所以我們需要找到一種解法,使得每次操作都是交換兩個元素的位置,最后實現整個矩陣的旋轉。 題目詳情 You are given an n x n 2D matrix representing an image.Rotate the ima...
閱讀 2538·2021-11-24 10:20
閱讀 2385·2021-09-10 10:51
閱讀 3370·2021-09-06 15:02
閱讀 3105·2019-08-30 15:55
閱讀 2835·2019-08-29 18:34
閱讀 3071·2019-08-29 12:14
閱讀 1206·2019-08-26 13:53
閱讀 2918·2019-08-26 13:43