_1695.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashMap;
importjava.util.HashSet;
importjava.util.Map;
importjava.util.Set;

publicclass_1695 {
publicstaticclassSolution1 {
publicintmaximumUniqueSubarray(int[] nums) {
Set<Integer> set = newHashSet<>();
intmaxSum = 0;
intrunningSum = 0;
for (intright = 0, left = 0; right < nums.length; right++) {
if (set.add(nums[right])) {
runningSum += nums[right];
maxSum = Math.max(maxSum, runningSum);
 } else {
while (left < right && set.contains(nums[right])) {
set.remove(nums[left]);
runningSum -= nums[left];
left++;
 }
set.add(nums[right]);
runningSum += nums[right];
 }
 }
returnmaxSum;
 }
 }

publicstaticclassSolution2 {
/*
 * My completely original solution on 10/202/2021. Classic sliding window solution.
 */
publicintmaximumUniqueSubarray(int[] nums) {
Map<Integer, Integer> map = newHashMap<>();
intsum = 0;
intstart = 0;
intans = 0;
for (inti = 0; i < nums.length; i++) {
if (map.containsKey(nums[i])) {
IntegerlastIndex = map.get(nums[i]);
while (start <= lastIndex) {
sum -= nums[start];
start++;
 }
 }
sum += nums[i];
map.put(nums[i], i);
ans = Math.max(ans, sum);
 }
returnans;
 }
 }
}