力扣：我的日程安排表I

package com.算法专练.力扣.我的日程安排表I;

import java.util.ArrayList;
import java.util.List;

/**
 * @author xnl
 * @Description:
 * @date: 2022/7/5   21:35
 */
public class Solution {
    public static void main(String[] args) {
        Solution solution = new Solution();

    }


}

/**
 * 直接遍历，找区间
 */
class MyCalendar {

    List<int[]> list = new ArrayList<>();
    public MyCalendar() {
        list = new ArrayList<>();
    }

    /**
     * 加入的区间不能在任意一个区间里面
     * @param start
     * @param end
     * @return
     */
    public boolean book(int start, int end) {
        for (int i = 0; i < list.size(); i++){
            int[] ints = list.get(i);
            if (start > ints[0] && end > ints[1]){
                return false;
            }
        }
        list.add(new int[]{start, end});
        return true;
    }
}

/**
 * 线段树，CV博主的额答案，线段树不会写
 */
class MyCalendar2 {

    class Node {
        // ls 和 rs 分别代表当前节点的左右子节点在 tr 的下标
        // val 代表当前节点有多少数
        // add 为懒标记
        int ls, rs, add, val;
    }

    int N = (int)1e9, M = 120010, cnt = 1;
    Node[] tr = new Node[M];

    private void update (int treeIndex, int left, int right, int l, int r, int v){
        if (left >= l && right <= r){
            tr[treeIndex].val += (right - left + 1) * v;
            tr[treeIndex].add += v;
            return;
        }
        lazyCreate(treeIndex);
        pushdown(treeIndex, right - left + 1);
        int mid = (left + right) >> 1;
        if (l <= mid){
            update(tr[treeIndex].ls, left,mid , l, r, v);
        }

        if (r > mid){
            update(tr[treeIndex].rs, mid + 1, right, l ,r ,v);
        }
        pushup(treeIndex);
    }

    private int query(int treeIndex, int left, int right, int l, int r){
        if (left >= l &&  r >= right){
            return tr[treeIndex].val;
        }
        lazyCreate(treeIndex);
        pushdown(treeIndex, right - left + 1);
        int mid = left + right >> 1, ans = 0;
        if (l <= mid){
            ans += query(tr[treeIndex].ls, left, mid, l, r);
        }
        if (r > mid){
            ans += query(tr[treeIndex].rs, mid + 1, right, l, r);
        }
        return ans;
    }

    void lazyCreate(int treeIndex) {
        if (tr[treeIndex] == null){
            tr[treeIndex] = new Node();
        }

        if (tr[treeIndex].ls == 0){
            tr[treeIndex].ls = ++cnt;
            tr[tr[treeIndex].ls] = new Node();
        }

        if (tr[treeIndex].rs == 0){
            tr[treeIndex].rs = ++cnt;
            tr[tr[treeIndex].rs] = new Node();
        }
    }

    void pushdown(int treeIndex, int len){
        tr[tr[treeIndex].ls].add += tr[treeIndex].add;
        tr[tr[treeIndex].rs].add += tr[treeIndex].add;

        tr[tr[treeIndex].ls].val += (len -len / 2) * tr[treeIndex].add;
        tr[tr[treeIndex].rs].val += (len / 2) * tr[treeIndex].add;
        tr[treeIndex].add = 0;
    }

    void pushup(int u) {
        tr[u].val = tr[tr[u].ls].val + tr[tr[u].rs].val;
    }

    public boolean book(int start, int end) {
        if (query(1, 1, N + 1, start + 1, end) > 0){
            return false;
        }
        update(1,1, N + 1, start + 1, end, 1);
        return true;
    }
}