merge interval leetcode java

来源：互联网发布：java messagedigest 编辑：程序博客网时间：2024/06/04 18:13
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;    }}
0 0