trailing spaces

Author: andavid

vscode/1.two-sum.java

@@ -1,5 +1,3 @@
-import java.util.HashMap;
-
 /*
  * @lc app=leetcode id=1 lang=java
  *
@@ -15,21 +13,21 @@
  *
  * Given an array of integers, return indices of the two numbers such that they
  * add up to a specific target.
- * 
+ *
  * You may assume that each input would have exactly one solution, and you may
  * not use the same element twice.
- * 
+ *
  * Example:
- * 
- * 
+ *
+ *
  * Given nums = [2, 7, 11, 15], target = 9,
- * 
+ *
  * Because nums[0] + nums[1] = 2 + 7 = 9,
  * return [0, 1].
- * 
- * 
- * 
- * 
+ *
+ *
+ *
+ *
  */
 class Solution {
   public int[] twoSum(int[] nums, int target) {

vscode/101.symmetric-tree.java

@@ -13,32 +13,32 @@
  *
  * Given a binary tree, check whether it is a mirror of itself (ie, symmetric
  * around its center).
- * 
- * 
+ *
+ *
  * For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
- * 
+ *
  * ⁠   1
  * ⁠  / \
  * ⁠ 2   2
  * ⁠/ \ / \
  * 3  4 4  3
- * 
- * 
- * 
+ *
+ *
+ *
  * But the following [1,2,2,null,3,null,3]  is not:
- * 
+ *
  * ⁠   1
  * ⁠  / \
  * ⁠ 2   2
  * ⁠  \   \
  * ⁠  3    3
- * 
- * 
- * 
- * 
+ *
+ *
+ *
+ *
  * Note:
  * Bonus points if you could solve it both recursively and iteratively.
- * 
+ *
  */
 /**
  * Definition for a binary tree node.

vscode/102.binary-tree-level-order-traversal.java

@@ -13,28 +13,28 @@
  *
  * Given a binary tree, return the level order traversal of its nodes' values.
  * (ie, from left to right, level by level).
- * 
- * 
+ *
+ *
  * For example:
  * Given binary tree [3,9,20,null,null,15,7],
- * 
+ *
  * ⁠   3
  * ⁠  / \
  * ⁠ 9  20
  * ⁠   /  \
  * ⁠  15   7
- * 
- * 
- * 
+ *
+ *
+ *
  * return its level order traversal as:
- * 
+ *
  * [
  * ⁠ [3],
  * ⁠ [9,20],
  * ⁠ [15,7]
  * ]
- * 
- * 
+ *
+ *
  */
 /**
  * Definition for a binary tree node.
@@ -54,7 +54,7 @@ public List<List<Integer>> levelOrder(TreeNode root) {
 
     Queue<TreeNode> queue = new LinkedList<>();
     queue.offer(root);
-    
+
     while (!queue.isEmpty()) {
       List<Integer> level = new ArrayList<>();
       int size = queue.size();
@@ -70,7 +70,7 @@ public List<List<Integer>> levelOrder(TreeNode root) {
       }
       result.add(level);
     }
-    
+
     return result;
   }
 }

vscode/104.maximum-depth-of-binary-tree.java

@@ -12,25 +12,25 @@
  * Testcase Example:  '[3,9,20,null,null,15,7]'
  *
  * Given a binary tree, find its maximum depth.
- * 
+ *
  * The maximum depth is the number of nodes along the longest path from the
  * root node down to the farthest leaf node.
- * 
+ *
  * Note: A leaf is a node with no children.
- * 
+ *
  * Example:
- * 
+ *
  * Given binary tree [3,9,20,null,null,15,7],
- * 
- * 
+ *
+ *
  * ⁠   3
  * ⁠  / \
  * ⁠ 9  20
  * ⁠   /  \
  * ⁠  15   7
- * 
+ *
  * return its depth = 3.
- * 
+ *
  */
 /**
  * Definition for a binary tree node.

vscode/108.convert-sorted-array-to-binary-search-tree.java

@@ -13,26 +13,26 @@
  *
  * Given an array where elements are sorted in ascending order, convert it to a
  * height balanced BST.
- * 
+ *
  * For this problem, a height-balanced binary tree is defined as a binary tree
  * in which the depth of the two subtrees of every node never differ by more
  * than 1.
- * 
+ *
  * Example:
- * 
- * 
+ *
+ *
  * Given the sorted array: [-10,-3,0,5,9],
- * 
+ *
  * One possible answer is: [0,-3,9,-10,null,5], which represents the following
  * height balanced BST:
- * 
+ *
  * ⁠     0
  * ⁠    / \
  * ⁠  -3   9
  * ⁠  /   /
  * ⁠-10  5
- * 
- * 
+ *
+ *
  */
 /**
  * Definition for a binary tree node.

vscode/110.balanced-binary-tree.java

@@ -12,43 +12,43 @@
  * Testcase Example:  '[3,9,20,null,null,15,7]'
  *
  * Given a binary tree, determine if it is height-balanced.
- * 
+ *
  * For this problem, a height-balanced binary tree is defined as:
- * 
- * 
+ *
+ *
  * a binary tree in which the depth of the two subtrees of every node never
  * differ by more than 1.
- * 
- * 
+ *
+ *
  * Example 1:
- * 
+ *
  * Given the following tree [3,9,20,null,null,15,7]:
- * 
- * 
+ *
+ *
  * ⁠   3
  * ⁠  / \
  * ⁠ 9  20
  * ⁠   /  \
  * ⁠  15   7
- * 
+ *
  * Return true.
- * 
+ *
  * Example 2:
- * 
+ *
  * Given the following tree [1,2,2,3,3,null,null,4,4]:
- * 
- * 
+ *
+ *
  * ⁠      1
  * ⁠     / \
  * ⁠    2   2
  * ⁠   / \
  * ⁠  3   3
  * ⁠ / \
  * ⁠4   4
- * 
- * 
+ *
+ *
  * Return false.
- * 
+ *
  */
 /**
  * Definition for a binary tree node.
@@ -61,7 +61,7 @@
  */
 class Solution {
   private boolean isBalanced = true;
-  
+
   public boolean isBalanced(TreeNode root) {
     getDepth(root);
     return isBalanced;

vscode/111.minimum-depth-of-binary-tree.java

@@ -12,25 +12,25 @@
  * Testcase Example:  '[3,9,20,null,null,15,7]'
  *
  * Given a binary tree, find its minimum depth.
- * 
+ *
  * The minimum depth is the number of nodes along the shortest path from the
  * root node down to the nearest leaf node.
- * 
+ *
  * Note: A leaf is a node with no children.
- * 
+ *
  * Example:
- * 
+ *
  * Given binary tree [3,9,20,null,null,15,7],
- * 
- * 
+ *
+ *
  * ⁠   3
  * ⁠  / \
  * ⁠ 9  20
  * ⁠   /  \
  * ⁠  15   7
- * 
+ *
  * return its minimum depth = 2.
- * 
+ *
  */
 /**
  * Definition for a binary tree node.

vscode/125.valid-palindrome.java

@@ -13,24 +13,24 @@
  *
  * Given a string, determine if it is a palindrome, considering only
  * alphanumeric characters and ignoring cases.
- * 
+ *
  * Note: For the purpose of this problem, we define empty string as valid
  * palindrome.
- * 
+ *
  * Example 1:
- * 
- * 
+ *
+ *
  * Input: "A man, a plan, a canal: Panama"
  * Output: true
- * 
- * 
+ *
+ *
  * Example 2:
- * 
- * 
+ *
+ *
  * Input: "race a car"
  * Output: false
- * 
- * 
+ *
+ *
  */
 class Solution {
   public boolean isPalindrome(String s) {