input: Write a function to find the largest set of numbers such that the difference between any two consecutive numbers is more than one.
  assert greedy_solution([1, 2, 2, 3, 3, 5, 6, 8, 9, 10]) == [1, 3, 5, 8, 10]
  assert greedy_solution([4, 7, 2, 1, 5, 3]) == [1, 3, 5, 7]
  assert greedy_solution([10, 9, 8, 7, 6, 5, 4, 3, 2, 1]) == [1, 3, 5, 7, 9]
  assert greedy_solution([1, 3, 5, 7, 9, 11]) == [1, 3, 5, 7, 9, 11]
  assert greedy_solution([]) == []
output: def greedy_solution(nums):
      if not nums:
          return []
      nums.sort()
      result = [nums[0]]
      for num in nums[1:]:
          if num > result[-1] + 1:
              result.append(num)
      return result