Fixed idea warnings, added common ListNode class.

Author: javadev

SECURITY.md

@@ -11,4 +11,4 @@
 
 In case you have found a vulnerability, please open a public issue in the repository. This will help developers to address the problem and solve.
 
-If you have evidence of a zero day exploit, please directly contact to project owner with exploit details.
+If you have evidence of a zero-day exploit, please directly contact to project owner with exploit details.

pom.xml

@@ -140,7 +140,7 @@
         <dependency>
             <groupId>junit</groupId>
             <artifactId>junit</artifactId>
-            <version>4.13.1</version>
+            <version>[4.13.2,)</version>
             <scope>test</scope>
         </dependency>
     </dependencies>

src/main/java/com.github.leetcode/ListNode.java

@@ -0,0 +1,35 @@
+package com.github.leetcode;
+
+@SuppressWarnings("java:S1104")
+public class ListNode {
+    public int val;
+    public ListNode next;
+
+    public ListNode() {}
+
+    public ListNode(int val) {
+        this.val = val;
+    }
+
+    public ListNode(int val, ListNode next) {
+        this.val = val;
+        this.next = next;
+    }
+
+    public String toString() {
+        StringBuilder result = new StringBuilder("" + val);
+        if (next.next != null) {
+            result.append(", ");
+        }
+        ListNode current = next;
+        while (current.next != null) {
+            result.append(current.val);
+            if (current.next != null) {
+                result.append(", ");
+            }
+            current = current.next;
+        }
+        result.append(current.val);
+        return result.toString();
+    }
+}

src/main/java/s0001.two.sum/Solution.java

@@ -2,7 +2,6 @@
 
 import java.util.Arrays;
 
-@SuppressWarnings("java:S1598")
 public class Solution {
     public int[] twoSum(int[] nums, int target) {
         if (nums == null || nums.length <= 1) {

src/main/java/s0002.add.two.numbers/ListNode.java

@@ -1,5 +1,7 @@
 package s0002.add.two.numbers;
 
+import com.github.leetcode.ListNode;
+
 /*
  * Definition for singly-linked list.
  * public class ListNode {

src/main/java/s0002.add.two.numbers/Solution.java

@@ -2,15 +2,14 @@
 
 public class Solution {
     public int lengthOfLongestSubstring(String s) {
-        int lastIndices[] = new int[256];
+        int[] lastIndices = new int[256];
         for (int i = 0; i < 256; i++) {
             lastIndices[i] = -1;
         }
 
         int maxLen = 0;
         int curLen = 0;
         int start = 0;
-        int bestStart = 0;
         for (int i = 0; i < s.length(); i++) {
             char cur = s.charAt(i);
             if (lastIndices[cur] < start) {
@@ -25,7 +24,6 @@ public int lengthOfLongestSubstring(String s) {
 
             if (curLen > maxLen) {
                 maxLen = curLen;
-                bestStart = start;
             }
         }
 

src/main/java/s0003.longest.substring.without.repeating.characters/Solution.java

@@ -6,10 +6,10 @@
 
 public class Solution {
     public double findMedianSortedArrays(int[] nums1, int[] nums2) {
-        List<Integer> l = new ArrayList<Integer>();
+        List<Integer> l = new ArrayList<>();
         double f;
-        for (int i = 0; i < nums1.length; i++) l.add(nums1[i]);
-        for (int j = 0; j < nums2.length; j++) l.add(nums2[j]);
+        for (int j : nums1) l.add(j);
+        for (int i : nums2) l.add(i);
         Collections.sort(l);
         int k = l.size();
         if (k % 2 == 0) f = (double) ((l.get(k / 2 - 1)) + (l.get(k / 2))) / 2;

src/main/java/s0004.median.of.two.sorted.arrays/Solution.java

@@ -3,7 +3,7 @@
 public class Solution {
     public String convert(String s, int numRows) {
         if (s == null || s.length() <= numRows || numRows == 1) return s;
-        char letters[] = new char[s.length()];
+        char[] letters = new char[s.length()];
         for (int i = 0, k = 0; i < numRows; i++) {
             if (i == 0 || i == numRows - 1) {
                 for (int j = i; j < s.length(); j += 2 * numRows - 2) {

src/main/java/s0006.zigzag.conversion/Solution.java

@@ -2,11 +2,11 @@
 
 public class Solution {
     public boolean isMatch(String s, String p) {
-        Boolean dp[][] = new Boolean[s.length() + 1][p.length() + 1];
+        Boolean[][] dp = new Boolean[s.length() + 1][p.length() + 1];
         return isMatch(s, p, 0, 0, dp);
     }
 
-    public boolean isMatch(String s, String p, int i, int j, Boolean dp[][]) {
+    public boolean isMatch(String s, String p, int i, int j, Boolean[][] dp) {
         if (i == s.length() && j == p.length()) {
             return true;
         }