|1033|[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java)||Easy|Math|

|1030|[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1030.java)||Easy|

|1029|[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1029.java)||Easy|

|1026|[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1026.java)||Medium|Tree, DFS, Binary Tree|

|1025|[Divisor Game](https://leetcode.com/problems/divisor-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1025.java)||Easy|Math, DP, Brainteaser, Game Theory|

|1024|[Video Stitching](https://leetcode.com/problems/video-stitching/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1024.java)||Medium|Array, DP, Greedy|

|1022|[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1022.java)||Easy|

packagecom.fishercoder.solutions;

importcom.fishercoder.common.classes.TreeNode;

publicclass_1026 {

publicstaticclassSolution1 {

intmaxDiff =0;

publicintmaxAncestorDiff(TreeNoderoot) {

dfs(root);

returnmaxDiff;

}

privatevoiddfs(TreeNoderoot) {

if (root ==null) {

return;

}

int[]minmax =newint[]{root.val,root.val};

findMinMax(root,minmax);

maxDiff =Math.max(maxDiff,Math.max(Math.abs(root.val -minmax[0]),Math.abs(minmax[1] -root.val)));

dfs(root.left);

dfs(root.right);

}

privatevoidfindMinMax(TreeNoderoot,int[]minmax) {

if (root ==null) {

return;

}

if (root.left !=null) {

minmax[0] =Math.min(root.left.val,minmax[0]);

minmax[1] =Math.max(root.left.val,minmax[1]);

}

if (root.right !=null) {

minmax[0] =Math.min(root.right.val,minmax[0]);

minmax[1] =Math.max(root.right.val,minmax[1]);

}

findMinMax(root.left,minmax);

findMinMax(root.right,minmax);

}

}

}

packagecom.fishercoder;

importcom.fishercoder.common.classes.TreeNode;

importcom.fishercoder.common.utils.TreeUtils;

importcom.fishercoder.solutions._1026;

importorg.junit.Test;

importjava.util.Arrays;

importstaticorg.junit.Assert.assertEquals;

publicclass_1026Test {

privatestatic_1026.Solution1solution1;

privatestaticTreeNoderoot;

publicvoidtest1() {

solution1 =new_1026.Solution1();

root =TreeUtils.constructBinaryTree(Arrays.asList(8,3,10,1,6,null,14,null,null,4,7,13));

assertEquals(7,solution1.maxAncestorDiff(root));

}

publicvoidtest2() {

solution1 =new_1026.Solution1();

root =TreeUtils.constructBinaryTree(Arrays.asList(1,null,2,null,0,3));

assertEquals(3,solution1.maxAncestorDiff(root));

}

}