LintCode 839 - Merge Two Sorted Interval Lists


https://www.lintcode.com/en/old/problem/merge-two-sorted-interval-lists/
Merge two sorted (ascending) lists of interval and return it as a new sorted list. The new sorted list should be made by splicing together the intervals of the two lists and sorted in ascending order.
 Notice
  • The intervals in the given list do not overlap.
  • The intervals in different lists may overlap.
Example
Given list1 = [(1,2),(3,4)] and list2 = [(2,3),(5,6)], return [(1,4),(5,6)]
https://www.jiuzhang.com/solution/merge-two-sorted-interval-lists/
  public List<Interval> mergeTwoInterval(List<Interval> list1, List<Interval> list2) {
    List<Interval> results = new ArrayList<>();
    if (list1 == null || list2 == null) {
      return results;
    }

    Interval last = null, curt = null;
    int i = 0, j = 0;
    while (i < list1.size() && j < list2.size()) {
      if (list1.get(i).start < list2.get(j).start) {
        curt = list1.get(i);
        i++;
      } else {
        curt = list2.get(j);
        j++;
      }

      last = merge(results, last, curt);
    }

    while (i < list1.size()) {
      last = merge(results, last, list1.get(i));
      i++;
    }

    while (j < list2.size()) {
      last = merge(results, last, list2.get(j));
      j++;
    }

    if (last != null) {
      results.add(last);
    }
    return results;
  }

  private Interval merge(List<Interval> results, Interval last, Interval curt) {
    if (last == null) {
      return curt;
    }

    if (curt.start > last.end) {
      results.add(last);
      return curt;
    }

    last.end = Math.max(last.end, curt.end);
    return last;

  }
https://blog.csdn.net/roufoo/article/details/82703034
    vector<Interval> mergeTwoInterval(vector<Interval> &list1, vector<Interval> &list2) {
        if (list1.size() == 0) return list2;
        else if (list2.size() == 0) return list1;

        vector<Interval> result;

        int p1 = 0, p2 = 0;
        Interval itv;
        if (list1[p1].start < list2[p2].start)
            itv = Interval(list1[p1].start, list1[p1].end);
        else
            itv = Interval(list2[p2].start, list2[p2].end);

        while ((p1 < list1.size()) || (p2 < list2.size())) {

            if (p1 < list1.size() && isOverlapping(list1[p1], itv)) {
                itv = merging(list1[p1], itv);
                p1++;
            } else if (p2 < list2.size() && isOverlapping(list2[p2], itv)) {
                itv = merging(list2[p2], itv);
                p2++;
            } else {
                result.push_back(itv);
                if (p1 < list1.size() && p2 < list2.size()) {
                    if (list1[p1].start < list2[p2].start)
                        itv = Interval(list1[p1].start, list1[p1].end);
                    else
                        itv = Interval(list2[p2].start, list2[p2].end);
                } else if (p1 < list1.size())
                    itv = Interval(list1[p1]);
                else
                    itv = Interval(list2[p2]);
            }
        }

        result.push_back(itv);

        return result;
    }

private:
    bool isOverlapping(Interval const & itv1, Interval const & itv2) {
        if ((itv1.end >= itv2.start) && (itv1.end <= itv2.end))  return true;
        if ((itv2.end >= itv1.start) && (itv2.end <= itv1.end))  return true;
        return false;
    }

    Interval merging(Interval const & itv1, Interval const & itv2) {
        return Interval(min(itv1.start, itv2.start), max(itv1.end, itv2.end));
    }
https://github.com/jiadaizhao/LintCode/blob/master/0839-Merge%20Two%20Sorted%20Interval%20Lists/0839-Merge%20Two%20Sorted%20Interval%20Lists.cpp
    vector<Interval> mergeTwoInterval(vector<Interval> &list1, vector<Interval> &list2) {
        // write your code here
        vector<Interval> result;
        int i = 0, j = 0;
        while (i < list1.size() || j < list2.size()) {
            if (j == list2.size() || (i < list1.size() && list1[i].start <= list2[j].start)) {
                if (result.size() && list1[i].start <= result.back().end) {
                    result.back().end = max(result.back().end, list1[i].end);
                }
                else {
                    result.push_back(list1[i]);
                }
                ++i;
            }
            else {
                if (result.size() && list2[j].start <= result.back().end) {
                    result.back().end = max(result.back().end, list2[j].end);
                }
                else {
                    result.push_back(list2[j]);
                }
                ++j;
            }
        }
        return result;

    }

https://github.com/mission-peace/interview/blob/master/src/com/interview/misc/AddingTwoSetOfIntervals.java
    public List<Pair> combineInterval(Pair[] arr1, Pair[] arr2){
        Arrays.sort(arr1);
        Arrays.sort(arr2);
     
        List<Pair> result = new ArrayList<Pair>();
        int i=0;
        int j=0;
        Pair current = new Pair(Integer.MIN_VALUE,Integer.MIN_VALUE+1);
        while(i < arr1.length && j < arr2.length){
            if(arr1[i].low <= arr2[j].low){
                if(arr1[i].low <= current.high){
                    current.high = Math.max(arr1[i].high,current.high);
                }else{
                    current = arr1[i];
                    result.add(current);
                }
                i++;
            }
            else{
                if(arr2[j].low <= current.high){
                    current.high = Math.max(arr2[j].high,current.high);
                }else{
                    current = arr2[j];
                    result.add(current);
                }
                j++;
            }
        }
        while(i < arr1.length){
            if(arr1[i].low <= current.high){
                current.high = Math.max(current.high,arr1[i].high);
            }else{
                current = arr1[i];
                result.add(current);
            }
            i++;
        }
        while(j < arr2.length){
            if(arr2[j].low <= current.high){
                current.high = Math.max(current.high, arr2[j].high);
            }else{
                current = arr2[j];
                result.add(current);
            }
            j++;
        }
     
        return result;
    }
X. https://www.jianshu.com/p/4ec67ce48833
  public List<Interval> mergeTwoInterval(List<Interval> list1, List<Interval> list2) {
    list1.addAll(list2);
    Collections.sort(list1, new Comparator<Interval>() {
      @Override
      public int compare(Interval o1, Interval o2) {
        return o1.start - o2.start;
      }
    });
    for (int i = 0; i < list1.size() - 1; i++) {
      Interval first = list1.get(i);
      Interval next = list1.get(i + 1);
      if (first.end < next.start) {
        continue;
      } else {
        first.end = Math.max(next.end, first.end);
        list1.remove(i + 1);
        i--;
      }
    }
    return list1;

  }

Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts