input: Write a function to find the largest three numbers in a list. If the list has fewer than three elements, return the list sorted in descending order. If the list is empty, return an empty list.
  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])==[10]
  assert find_largest_three([])==[]
output: def find_largest_three(nums):
      if len(nums) < 3:
          return sorted(nums, reverse=True)
      return sorted(nums)[-3:]