Python3 程序在数组的 K 次右旋转后查找第 M 个元素

Python3

# Python3 program to implement
# the above approach
  
# Function to return Mth element of
# array after k right rotations
def getFirstElement(a, N, K, M):
  
    # The array comes to original state
    # after N rotations
    K %= N
  
    # If K is greater or equal to M
    if (K >= M):
  
        # Mth element after k right
        # rotations is (N-K)+(M-1) th
        # element of the array
        index = (N - K) + (M - 1)
  
    # Otherwise
    else:
  
        # (M - K - 1) th element
        # of the array
        index = (M - K - 1)
  
    result = a[index]
  
    # Return the result
    return result
  
# Driver Code
if __name__ == "__main__":
      
    a = [ 1, 2, 3, 4, 5 ]
    N = len(a)
  
    K , M = 3, 2
  
    print( getFirstElement(a, N, K, M))
  
# This code is contributed by chitranayal

有关详细信息，请参阅关于数组的 K 次右旋转后第 M 个元素的完整文章！