class Solution {
public:
int pivotIndex(vector<int>& nums) {
int len = nums.size();
int right = 0;
int left = 0;
for (int i : nums){
right += i;
}
for (int j=0; j < len; j++){
right -=nums[j];
if(left==right)
return j;
left += nums[j];
}
return -1;
}
};
题目:代码class Solution {public: int pivotIndex(vector<int>& nums) { int len = nums.size(); int right = 0; int left = 0; for (int i : nums){ r...