input: Write a function to find the largest three numbers in a list. If the list has fewer than three numbers, return all the numbers in descending order.
  def find_largest_three(nums):
      if len(nums) < 3:
          return sorted(nums, reverse=True)
      return sorted(nums)[-3:]
  assert find_largest_three([1, 6, 3, 8, 7, 4])==[6, 7, 8]
  assert find_largest_three([5, 2, 9])==[5, 2, 9]
  assert find_largest_three([10, 1])==[1, 10]
  assert find_largest_three([7])==[7]
  assert find_largest_three([])==[]
output: def find_largest_three(nums):
      if len(nums) < 3:
          return sorted(nums, reverse=True)
      return sorted(nums, reverse=True)[:3]