力扣905. 按奇偶排序数组；力扣724. 寻找数组的中心索引

class Solution {
public:
    vector<int> sortArrayByParity(vector<int>& A) {
        int i = 0;
        int j = A.size() - 1;
        while(i < j)
        {
            if(A[i] % 2 == 1)
            {
                swap(A[i],A[j]);
                --j;
            }
            else if(A[i] % 2 == 0)
            {
                ++i;
            }
        }
        return A;
    }
};

class Solution {
public:
    int pivotIndex(vector<int>& nums) {
        if(nums.size() == 0)
            return -1;
        int sum = 0;
        int count = 0;
        size_t  size = nums.size();
        for(int i = 0; i < size;++i)
        {
            sum += nums[i];
        }
        for(int i = 0; i < size;++i)
        {
            if(count * 2  + nums[i] == sum)
                return i;
            count += nums[i];
        }
        return -1;
    }
};