---

1.力扣 寻找数组的中心索引

力扣参考答案

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

我的答案

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

2.二分查找STL

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
      return lower_bou...