input: Write a function to determine if it is possible to get a list of integers sorted in non-decreasing order by performing any number of left shift operations on the list. If it is possible return True else return False. If the list is empty then return True.
  def move_one_left(values):
      if not values:
          return True
      n = len(values)
      count = 0
      for i in range(1, n):
          if values[i-1] > values[i]:
              count += 1
      return count <= 1
  
  assert move_one_left([3, 4, 5, 1, 2])==True
  assert move_one_left([3, 5, 10, 1, 2])==True
  assert move_one_left([4, 3, 1, 2])==False
  assert move_one_left([3, 5, 4, 1, 2])==True
  assert move_one_left([])==True
output: def move_one_left(values):
      if not values:
          return True
      n = len(values)
      count = 0
      for i in range(1, n):
          if values[i-1] > values[i]:
              count += 1
      return count <= 1