ME

Number of Rotated Sorted Arrays

Given two sorted arrays nums1 and nums2, return the number of rotated sorted arrays that can be formed by concatenating nums1 and nums2. A sorted array is considered rotated if it can be obtained by rotating any of the previous sorted arrays.

Example 1:

Input:nums1 = [1, 2, 3], nums2 = [4, 5, 6]

Output:3

Example 2:

Input:nums1 = [3, 4, 5], nums2 = [1, 2, 3]

Output:2

Example 3:

Input:nums1 = [1, 2, 3], nums2 = [3, 4, 5]

Output:2

Constraints:

The length of both nums1 and nums2 will not exceed 100.
The input arrays are guaranteed to be sorted in ascending order.

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Number of Rotated Sorted Arrays

MediumMed•526 views

Given two sorted arrays nums1 and nums2, return the number of rotated sorted arrays that can be formed by concatenating nums1 and nums2. A sorted array is considered rotated if it can be obtained by rotating any of the previous sorted arrays.