Improved tasks 1017, 1019, 1026.

Author: javadev

src.save/main/java/g1001_1100/s1017_convert_to_base_2/Solution.java

@@ -1,6 +1,6 @@
 package g1001_1100.s1017_convert_to_base_2;
 
-// #Medium #Math #2022_02_25_Time_2_ms_(34.15%)_Space_41.8_MB_(11.58%)
+// #Medium #Math #2022_05_02_Time_1_ms_(89.45%)_Space_39.8_MB_(84.40%)
 
 public class Solution {
  public String baseNeg2(int n) {

src.save/main/java/g1001_1100/s1019_next_greater_node_in_linked_list/Solution.java

@@ -5,6 +5,16 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode() {}
+ * ListNode(int val) { this.val = val; }
+ * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
 public class Solution {
  public int[] nextLargerNodes(ListNode head) {
  int len = length(head);

src.save/main/java/g1001_1100/s1026_maximum_difference_between_node_and_ancestor/Solution.java

@@ -32,12 +32,10 @@ private void traverse(TreeNode root, int maxAncestor, int minAncestor) {
  if (root == null) {
  return;
  }
-
  if (maxAncestor == -1) {
  traverse(root.left, root.val, root.val);
  traverse(root.right, root.val, root.val);
  }
-
  if (maxAncestor != -1) {
  max = Math.max(max, Math.abs(maxAncestor - root.val));
  max = Math.max(max, Math.abs(minAncestor - root.val));