new_contents: My Submissions Question Solution 
  Rotate an array of n elements to the right by k steps.
  
  For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].
  
  Note:
  Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
  
  [show hint]
  
  Related problem: Reverse Words in a String II
  
  class Solution:
      # @param nums, a list of integer
      # @param k, num of steps
      # @return nothing, please modify the nums list in-place.
      def rotate_1(self, nums, k):
          n = len(nums)
          k = k % n
          nums[:] = nums[n-k:] + nums[:n-k]  # Important!!
      
      def rotate(self, nums, k):
          while k > 0:
              nums.insert(0, nums.pop())
              k -= 1
              
  # Reference:           
  # https://leetcode.com/discuss/28613/my-solution-by-using-python
  # https://leetcode.com/discuss/27387/summary-of-c-solutions
  
subject: Create Rotate_Array.py