LintCode 139. Subarray Sum Closest (经典题)

139. Subarray Sum Closest

Given an integer array, find a subarray with sum closest to zero. Return the indexes of the first number and last number.

Example
Given [-3, 1, 1, -3, 5], return [0, 2], [1, 3], [1, 1], [2, 2] or [0, 4].

Challenge
O(nlogn) time

思路：先求presums，然后排序(记得用datatype保留原数据的index)，然后每个data跟前面的比较绝对值差，更新绝对值差最小的那个。
注意：
1）sort和定义priority_queue都可以用struct cmp，但sort的compare必须是具体的instance，而priority_queue是直接用class name。

代码如下：

struct DataType {
    int sum;
    int index;
    DataType(int s = 0, int id = 0) : sum(s), index(id) {}
};

struct cmp{
    bool operator()(DataType &a, DataType & b) {
        if (a.sum < b.sum) return true;
        else return false;
    }
} compare;

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> subarraySumClosest(vector<int> &nums) {
        int n = nums.size();
        if (n == 0) return vector<int>();
        vector<DataType> data(n);
        data[0].sum = nums[0];
        data[0].index = 0;
        for (int i = 1; i < n; ++i) {
            data[i].sum += data[i - 1].sum + nums[i];
            data[i].index = i;
        }
        
        sort(data.begin(), data.end(), compare);
        
        int minDiff = INT_MAX;
        int minStartIndex = 0, minEndIndex = 0;
        
        for (int i = 1; i < n; ++i) {
            int diff = data[i].sum - data[i - 1].sum;
            if (abs(minDiff) > abs(diff)) {
                minDiff = diff;
                minStartIndex = min(data[i - 1].index, data[i].index) + 1;
                minEndIndex = max(data[i - 1].index, data[i].index);
            }
        }
        
        return vector<int>{minStartIndex, minEndIndex};
    }
};