leetcode

Solution to some Leetcode problems written in C++

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

2161.cpp (558B)

0 class Solution { 1 public: 2 vector<int> pivotArray(vector<int> &nums, int pivot) { 3 vector<int> tmp; 4 tmp.reserve(nums.size()); 5 int count = 0, idx = 0; 6 for (int num : nums) { 7 if (num == pivot) 8 count++; 9 else if (num > pivot) 10 tmp.push_back(num); 11 else 12 nums[idx++] = num; 13 } 14 15 for (int i = 0; i < count; i++) 16 nums[idx++] = pivot; 17 for (int num : tmp) 18 nums[idx++] = num; 19 return nums; 20 } 21 };