leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1695.cpp (500B)

0 class Solution { 1 public: 2 int maximumUniqueSubarray(const vector<int> &nums) const { 3 static bool seen[10001]; 4 memset(seen, 0x00, sizeof(seen)); 5 int res = 0, sum = 0, i = 0; 6 for (int j = 0; j < nums.size(); j++) { 7 while (seen[nums[j]]) { 8 seen[nums[i]] = 0; 9 sum -= nums[i++]; 10 } 11 seen[nums[j]] = 1; 12 sum += nums[j]; 13 res = max(res, sum); 14 } 15 return res; 16 } 17 };