c

class Solution {public:    /**     * @param nums: A list of integers     * @return: A list of integers includes the index of the first number      *          and the index of the last number     */    vector<int> subarraySum(vector<int> nums){        // write your code here        vector<int> v1;                for (auto i = 0; i < nums.size(); i++) {            if (nums[i] == 0) {            v1.push_back(i);            v1.push_back(i);            return v1;        }            int sum = nums[i];            for (auto j = i+1; j < nums.size(); j++) {                sum = sum + nums[j] ;                if (sum == 0) {                    v1.push_back(i);                    v1.push_back(j);                    return v1;                }            }        }        return v1;    }}; auto smallest = std::min_element(std::begin(v), std::end(v));      std::cout << "min element is " << *smallest<< " at position " << std::distance(std::begin(v), smallest) << std::endl;