merge interval leetcode java

最新推荐文章于 2019-03-02 11:16:54 发布
最新推荐文章于 2019-03-02 11:16:54 发布
阅读量214 收藏
点赞数
文章标签： merge interval leetc
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/lingjing66/article/details/49555755
版权 
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}
import java.util.ArrayDeque;
import java.util.Deque;


public class MaxSlidingWindow {
	public static void main(String[] args) {
		//int[] nums={1,3,-1,-3,5,3,6,7};
		int[] nums={1,2,3,4,5,6,7};
		int[] ret= maxSlidingWindow(nums, 3) ;
		for(int c:ret)
		System.out.print(c);
	}
	public static int[] maxSlidingWindow(int[] a, int k) {     
        if (a == null || k <= 0) {
            return null;
        }
        int n = a.length;
        int[] r = new int[n-k+1];
        int ri = 0;
        // store index
        Deque<Integer> q = new ArrayDeque<>();
        for (int i = 0; i < a.length; i++) {
            // remove numbers out of range k
            while (!q.isEmpty() && q.peek() < i - k + 1) {
                q.poll();
            }
            // remove smaller numbers in k range as they are useless
            while (!q.isEmpty() && a[q.peekLast()] < a[i]) {
                q.pollLast();
            }
            // q contains index... r contains content
            q.offer(i);
            if (i >= k - 1) {
                r[ri++] = a[q.peek()];
            }
        }
        return r;
    }
}

lingjing66
关注
merge interval
算法，时空数据挖掘
11-22 852
常规做法，排序然后合并。 import java.util.*; public class Solution { class IntervalComp implements Comparator{ @Override public int compare(Interval inte1, Interval inte2) { if(inte1
Insert Interval（Leetcode57）
James_bobo的博客
11-04 232
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times. Example 1: Input: intervals = [[1,3],[6,9]], newInterval = [2,
java实现Merge Intervals
zhang434的专栏
07-02 2011
Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18].
LeetCode—insert-interval（插入间隔）—java
Lynn_Baby的博客
07-05 508
题目描述：Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Exam...
56. Merge Intervals(合并区间)（Java）
God_Mood的博客
03-02 355
原题链接：https://leetcode.com/problems/merge-intervals/ 思路很简单，首先对List进行排序（从小到大）， 然后用st 保存当前连续左端最小值 ed保存当前连续右端最大值。 AC 10ms 95% Java: /** * Definition for an interval. * public class Interval { * ...
做了30分钟。。Merge Interval
Lost in the Bay Area
04-30 537
Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18].
LeetCode题解（java语言实现）.pdf
04-22
LeetCode题解（java语言实现） 本资源提供了LeetCode题解的Java语言实现，涵盖了多种算法和数据结构，包括数组、链表、树、图、动态规划、贪心算法等。该资源共包含71个LeetCode题解，涵盖了多个难度级别的题目，...
LeetCode题解 - Java语言实现-181页.pdf
06-04
LeetCode题解 - Java语言实现 LeetCode是一个非常流行的编程挑战平台，为程序员和开发者提供了大量的编程挑战题目，以帮助他们提高编程技能和解决问题的能力。本文档为LeetCode题解的Java语言实现，涵盖了181页的...
Insert Interval Leetcode #57 题解[Python]
Wayne_Mai的博客
05-12 1386
题目来源 https://leetcode.com/problems/insert-interval/description/ 题目描述 Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume tha...
LeetCode之Merge Interval
Struggler的专栏
03-04 559
/*这个问题可以直接采用Insert Interval问题中采用的方法，创建一个Interval集合，不断的将旧集合中的 Interval合并进来，最终完成Merge Interval功能。 解决Insert Interval问题的链接：http://blog.csdn.net/shiyimin1/article/details/44066195*/ class Solution { privat
【LeetCode】Merge Intervals 解题报告
跳出温水的青蛙
04-06 5864
【题目】 Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. 【解析】 题意：有很多个区间，把有重叠的区间合并。 思路：先排序，然后检查相邻两
LeetCode merge interval 和 insert interval
qq_31837563的博客
05-15 140
1. merge interval有很多个区间。判断相邻区间是否有重叠并合并重叠的区间。这个题因为没有说明坚哥是否为有序的，所以我们要进行排序，但是由于interval对象是自己定义的，所以需要重写comparator 接口，定义排序方法，然后比较前后两个坚哥是否重叠，如果重叠则创建一个新的interval对象，然后更新对象的start以及end属性。import java.util.*; pub...
[leetcode] 区间合并问题 Merge Interval
jiyanfeng1的专栏
11-30 2897
Given a collection of intervals, merge all overlapping intervals. 类似问题1：区间覆盖问题 相关问题2：Rectangle Area II For example, given[1,3],[2,6],[8,10],[15,18],return[1,6],[8,10],[15,18]. 来源：leetcode 思路：用...
合并区间（Merge Intervals）java
下雨了_简的博客
08-24 5703
合并区间（Merge Intervals）java 题干 给出一个区间的集合，请合并所有重叠的区间。 示例 1: 输入: [[1,3],[2,6],[8,10],[15,18]] 输出: [[1,6],[8,10],[15,18]] 解释: 区间 [1,3] 和 [2,6] 重叠, 将它们合并为 [1,6]. 示例 2: 输入: [[1,4],[4,5]] 输出: [[1,5...
区间合并问题 Merge Interval
John Will的博客
04-09 889
题目描述Given a collection of intervals, merge all overlapping intervals. For example, Given[1,3],[2,6],[8,10],[15,18], return[1,6],[8,10],[15,18]. 思路：我们首先要做的就是给区间集排序，由于我们要排序的是个结构体，所以我们要定义自己的comparator...
LeetCode—merge-intervals（合并重叠的间隔）—java
Lynn_Baby的博客
07-05 1087
题目描述：Given a collection of intervals, merge all overlapping intervals.For example,Given[1,3],[2,6],[8,10],[15,18],return[1,6],[8,10],[15,18].思路解析：题意：将重叠的数组合并起来我们首先要做的就是给区间集排序，由于我们要排序的是个结构体，所以我们要定义自己的c...
Java Merge Intervals(合并间隔)
Hello Eclipse Plugin 黑夜
07-17 2633
Problem: Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. Thoughts of This Problem The key to solve th
KKобтьу╬kkx.net.url
最新发布
09-14
KKобтьу╬kkx.net.url
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值