input: Write a function to determine if a given array can be converted into a sorted non-decreasing order by performing a single left shift operation. If it is possible, return True; otherwise, return False. If the array is empty, return True.
  assert move_one_left_shift([3, 4, 5, 1, 2])==True
  assert move_one_left_shift([3, 5, 10, 1, 2])==False
  assert move_one_left_shift([4, 3, 1, 2])==False
  assert move_one_left_shift([3, 5, 4, 1, 2])==True
  assert move_one_left_shift([])==True
output: def move_one_left_shift(arr):
      if not arr:
          return True
      count = 0
      for i in range(1, len(arr)):
          if arr[i] < arr[i - 1]:
              count += 1
              if count > 1:
                  return False
      return count == 1