题解 | #旋转数组#

# -*- coding: utf-8 -*-


#
# 旋转数组
# @param n int整型 数组长度
# @param m int整型 右移距离
# @param a int整型一维数组 给定数组
# @return int整型一维数组
#
class Solution:
    def solve(self , n , m , a ):
        # write code here
        if m==n:
            return a
        elif m>n:
            m=m-n
            return self.solve(n,m,a)
        res=[]
        data=list(range(1, m + 1))
        data.reverse()
        for i in data:
            res.append(a[-i])
        res=res+a[0:(n-m)]
        return res


s=Solution()
print(s.solve(6,2,[1,2,3,4,5,6]))
print(s.solve(6,7,[1,2,3,4,5,6]))
print(s.solve(1,5,[5]))