modify code

Author: algorithmzuo

src/class166/Code01_SegmentTreeDivideAndConquer1.java

@@ -65,9 +65,6 @@ public static void undo() {
 	}
 
 	public static void add(int jobl, int jobr, int jobv, int l, int r, int i) {
-		if (jobl > r || jobr < l) {
-			return;
-		}
 		if (jobl <= l && r <= jobr) {
 			addEdge(i, jobv);
 		} else {

src/class166/Code02_MinimumMexTree1.java

@@ -66,9 +66,6 @@ public static void undo() {
 	}
 
 	public static void add(int jobl, int jobr, int jobv, int l, int r, int i) {
-		if (jobl > r || jobr < l) {
-			return;
-		}
 		if (jobl <= l && r <= jobr) {
 			addEdge(i, jobv);
 		} else {
@@ -128,7 +125,9 @@ public static void main(String[] args) throws IOException {
 			siz[i] = 1;
 		}
 		for (int i = 1; i <= m; i++) {
-			add(0, w[i] - 1, i, 0, v, 1);
+			if (w[i] > 0) {
+				add(0, w[i] - 1, i, 0, v, 1);
+			}
 			add(w[i] + 1, v, i, 0, v, 1);
 		}
 		part = n;