Lintcode30 Insert Interval solution 題解

阿新 • • 發佈：2017-05-08

necessary solution start 記錄元素

題目描述】

Given a non-overlapping interval list which is sorted by start point.Insert a new interval into it, make sure the list is still in order and non-overlapping (merge intervals if necessary).

給出一個無重疊的按照區間起始端點排序的區間列表。在列表中插入一個新的區間，你要確保列表中的區間仍然有序且不重疊（如果有必要的話，可以合並區間）。

【題目鏈接】

http://www.lintcode.com/en/problem/insert-interval/

【題目解析】

用pos記錄newInterval應該插入的位置。順序遍歷intervals中的元素，若當前interval的end比newInterval的start還小，則將當前interval加入答案，同時pos＋1；若比newInterval大，則直接加入答案；若有overlap，則需要merge，newInterval的start取兩者間小的，end取兩者間大的。最後在pos的位置插入newInterval即可。

【參考答案】

http://www.jiuzhang.com/solutions/insert-interval/

Lintcode30 Insert Interval solution 題解

Lintcode30 Insert Interval solution 題解

necessary solution start 記錄元素題目描述】Given a non-overlapping interval list which is sorted by start point.Insert a new interval into it, make sure

Lintcode205 Interval Minimum Number solution 題解

簡書 calculate ray 描述 ger build calc dex nsh 【題目描述】 Given an integer array (index from 0 to n-1, where n is the size of this array),

Lintcode206 Interval Sum solution 題解

ref 以及 each segment suggest ron lint 給定一個整數數組 size 【題目描述】 Given an integer array (index from 0 to n-1, where n is the size of this

Lintcode207 Interval Sum II solution 題解

修改 sta sum 比較 ray 會有 .com suggest value 【題目描述】 Given an integer array in the construct method, implement two methods query(start, e

Lintcode28 Search a 2D Matrix solution 題解

efficient solution following matrix previous 【題目描述】Write an efficient algorithm that searches for a value in an m x n matrix.This matrix has the

Lintcode29 Interleaving String solution 題解

determine 參考答案 solution whether 字符串【題目描述】Given three strings: s1, s2, s3, determine whether s3 is formed by the interleaving of s1 and s2.給出三個字符

Lintcode31 Partition Array solution題解

lintcode題解【題目描述】Given an array nums of integers and an int k, partition the array (i.e move the elements in "nums") such that:All elements < k are moved

Lintcode32 Minimum Window Substring solution 題解

solution windows multiple contain minimum 【題目描述】Given a string source and a string target, find the minimum window in source which will contain a

Lintcode35 Reverse Linked List solution 題解

參考答案 linked solution 通用【題目描述】Reverse a linked list.翻轉一個鏈表【題目鏈接】http://www.lintcode.com/en/problem/reverse-linked-list/【題目解析】這題要求我們翻轉[m, n]區間之間的鏈表。

Lintcode40 Implement Queue by Two Stacks solution 題解

lintcode【題目描述】As the title described, you should only use two stacks to implement a queue‘s actions.The queue should support push(element), pop() and top()

leetCode 57.Insert Interval (插入區間) 解題思路和方法

use example ava article urn win time 例如 ont Insert Interval Given a set of non-overlapping intervals, insert a new interval into

LeetCode Insert Interval

dcl star pos clas res intervals efi result lines LeetCode解題之Insert Interval 原題給出多個不重合的數據區段，如今插入一個數據區段。有重合的區段要進行合並。註意點：

Lintcode55 Compare Strings solution 題解

lintcode題解【題目描述】Compare two strings A and B, determine whether A contains all of the characters in B.The characters in string A and B are all Upper Case le

57. Insert Interval

面試官 urn 條件 his pub got 代碼 result -o Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessa

Lintcode70 Binary Tree Level Order Traversal II solution 題解

題解【題目描述】Given a binary tree, return the bottom-up level order traversal of its nodes‘ values. (ie, from left to right, level by level from leaf to root).給出

leetcode 57. Insert Interval

sorted 尋找 into i+1 aps right i++ 最小 tor link Given a set of non-overlapping intervals, insert a new interval into the intervals (merge i

[LeetCode] 57. Insert Interval Java

style time ive ava insert 插入 spa str assume 題目： Given a set of non-overlapping intervals, insert a new interval into the intervals (merge

Lintcode185 Matrix Zigzag Traversal solution 題解

target row nts while 參考 columns lan ron clas 【題目描述】 Given a matrix ofmxnelements (mrows,ncolumns), return all elements of the matrix in

Lintcode190 Next Permutation II solution 題解

implement pos cal mut 返回 all lex http number 【題目描述】 Implement next permutation, which rearranges numbers into the lexicographically next

Lintcode202 Segment Tree Query solution 題解

roo where segment blog 之一 attribute 描述完成 con 【題目描述】 For an integer array (index from 0 to n-1, where n is the size of this array), in t