leetcode

Solution to some Leetcode problems written in C++

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

2672.cpp (845B)

0 class Solution { 1 public: 2 vector<int> colorTheArray(const int n, const vector<vector<int>> &queries) const { 3 static int nums[100002]; 4 memset(nums, 0x00, sizeof(nums)); 5 6 const int m = size(queries); 7 vector<int> res(m); 8 9 int crnt = 0; 10 for (int i = 0; i < m; i++) { 11 const int idx = queries[i][0] + 1; 12 const int color = queries[i][1]; 13 if (nums[idx] != color) { 14 if (nums[idx]) { 15 if (nums[idx] == nums[idx - 1]) crnt--; 16 if (nums[idx] == nums[idx + 1]) crnt--; 17 } 18 nums[idx] = color; 19 if (nums[idx] == nums[idx - 1]) crnt++; 20 if (nums[idx] == nums[idx + 1]) crnt++; 21 } 22 res[i] = crnt; 23 } 24 25 return res; 26 } 27 };