ByteByteGo: Kth Largest Integer
β’ 100 words β’ 1 min β’ updated
ByteByteGo: Kth Largest Integer:
Sort with reverse=True:
python
from typing import List
def kth_largest_integer(nums: List[int], k: int) -> int:
s = sorted(set(nums), reverse=True)
if len(s) == 1:
return list(s)[0]
return list(s)[k - 1 % len(nums)]Sort with reversed:
python
from typing import List
def kth_largest_integer(nums: List[int], k: int) -> int:
s = list(reversed(list(sorted(set(nums)))))
if len(s) == 1:
return list(s)[0]
return list(s)[k - 1 % len(nums)]Forego reversion, index from the end of the list instead:
python
from typing import List
def kth_largest_integer(nums: List[int], k: int) -> int:
s = sorted(set(nums))
if len(s) == 1:
return list(s)[0]
return list(s)[len(nums) - k]