合并区间

问题：给定一个去见几个，合并里面重叠的区间，并返回新的不含重叠区间的集合。

时间复杂度O(nlogn)的 OC算法实现：

PS：区间定义同插入区间

//
//  MergeInterval.h
//  Algorithm
//
//  Created by han shuai on 2016/9/24.
//  Copyright © 2016年 han shuai. All rights reserved.
//

/**
 8
 */
#import <Foundation/Foundation.h>

@interface MergeInterval : NSObject

- (NSMutableArray *)mergeInterval:(NSMutableArray *)intervals;

@end

//
//  MergeInterval.m
//  Algorithm
//
//  Created by han shuai on 2016/9/24.
//  Copyright © 2016年 han shuai. All rights reserved.
//

#import "MergeInterval.h"
#import "Interval.h"
#import "IntervalPoint.h"
#include <math.h>

@implementation MergeInterval

- (NSMutableArray *)mergeInterval:(NSMutableArray *)intervals
{
    //对无序区间排序
    NSArray *sortedIntervals = [intervals sortedArrayUsingComparator:^NSComparisonResult(id  _Nonnull obj1, id  _Nonnull obj2) {
        Interval *interval1 = (Interval *)obj1;
        Interval *interval2 = (Interval *)obj2;
        
        if (interval1.startPoint.value > interval2.startPoint.value) {
            return NSOrderedDescending;
        }
        else if (interval1.startPoint.value < interval2.startPoint.value)
        {
            return NSOrderedAscending;
        }
        else
        {
            if (interval1.endPoint.value > interval2.endPoint.value) {
                return NSOrderedDescending;
            }
            else if (interval1.endPoint.value < interval2.endPoint.value)
            {
                return NSOrderedAscending;
            }
            else
            {
                return NSOrderedSame;
            }
        }
    }];
    
    //区间不重叠则插入到结果集
    //区间重叠更改结果集最后一个区间的值
    NSMutableArray *res = [NSMutableArray array];
    for (int i = 0; i < sortedIntervals.count; i++) {
        if (res.count == 0) {
            [res addObject:sortedIntervals[i]];
        }
        else
        {
            Interval *currentInterval = sortedIntervals[i];
            Interval *lastInterval = [res lastObject];
            if (lastInterval.endPoint.value >= currentInterval.startPoint.value) {
                lastInterval.endPoint.value = MAX(lastInterval.endPoint.value, currentInterval.endPoint.value);
            }
            else
            {
                [res addObject:currentInterval];
            }
        }
    }
    return res;
}

@end