线段覆盖 （Java代码）

解题思路:

注意事项:

参考代码:

import java.util.ArrayDeque;

import java.util.Deque;

import java.util.Scanner;

import java.util.Stack;

class Node{

int l,r,c;

public Node(int l, int r, int c) {

this.l = l;

this.r = r;

this.c = c;

}

}

public class Main{

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

Stack<Node> stack = new Stack<Node>();

int n = sc.nextInt();

int m = sc.nextInt();

for(int i=0; i<m; i++){

stack.add(new Node(sc.nextInt(), sc.nextInt(), sc.nextInt()));

}

int x = sc.nextInt();

while(!stack.isEmpty()){

Node t = stack.pop();

if(x>=t.l && x<=t.r){

System.out.println(t.c);

return;

}

}

System.out.println(0);

}

}