class Solution:
def findSingleCowsII(self , nums: List[int]) -> List[int]:
# write code here
lt = [0 for i in range(len(nums))]
tp = 0
for i in range(len(nums)):
for j in range(i):
if nums[j] == nums[i]:
lt[i] += 1
lt[j] += 1
print(lt)
for i in range(len(lt)):
if lt[i] == 0:
tp += 1
res = [0 for i in range(tp)]
t = 0
for i in range(len(lt)):
if lt[i] == 0:
res[t] = nums[i]
t += 1
for i in range(1, len(res)):
if res[i-1] > res[i]:
temp = res[i-1]
res[i-1] = res[i]
res[i] = temp
return res