Leetcode 1133. Largest Unique Number

Given an array of integers nums, return the largest integer that only occurs once. If no integer occurs once, return -1. Solving this problem actually requires solving two problems. The first problem is finding out which values only occur once. The second problem is finding the maximum value of those values. URL: https://leetcode.com/problems/largest-unique-number/solution/ My solution: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 class Solution { public int largestUniqueNumber(int[] nums) { ...

Submit