Changed package names for compatibility with Eclipse.

Author: javadev

src/main/java/com.github.leetcode/ListNode.java renamed to src/main/java/com_github_leetcode/ListNode.java

@@ -1,4 +1,4 @@
-package com.github.leetcode;
+package com_github_leetcode;
 
 @SuppressWarnings("java:S1104")
 public class ListNode {

src/main/java/s0001.two.sum/Solution.java renamed to src/main/java/s0001_two_sum/Solution.java

@@ -1,4 +1,4 @@
-package s0001.two.sum;
+package s0001_two_sum;
 
 import java.util.Arrays;
 

src/main/java/s0002.add.two.numbers/Solution.java renamed to src/main/java/s0002_add_two_numbers/Solution.java

@@ -1,6 +1,6 @@
-package s0002.add.two.numbers;
+package s0002_add_two_numbers;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 
 /*
  * Definition for singly-linked list.

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

@@ -1,4 +1,4 @@
-package s0003.longest.substring.without.repeating.characters;
+package s0003_longest_substring_without_repeating_characters;
 
 public class Solution {
     public int lengthOfLongestSubstring(String s) {

src/main/java/s0004.median.of.two.sorted/Solution.java renamed to src/main/java/s0004_median_of_two_sorted_arrays/Solution.java

@@ -1,4 +1,4 @@
-package s0004.median.of.two.sorted.arrays;
+package s0004_median_of_two_sorted_arrays;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/s0005.longest.palindromic.substring/Solution.java renamed to src/main/java/s0005_longest_palindromic_substring/Solution.java

@@ -1,4 +1,4 @@
-package s0005.longest.palindromic.substring;
+package s0005_longest_palindromic_substring;
 
 public class Solution {
     public String longestPalindrome(String s) {

src/main/java/s0006.zigzag.conversion/Solution.java renamed to src/main/java/s0006_zigzag_conversion/Solution.java

@@ -1,4 +1,4 @@
-package s0006.zigzag.conversion;
+package s0006_zigzag_conversion;
 
 public class Solution {
     public String convert(String s, int numRows) {

src/main/java/s0007.reverse.integer/Solution.java renamed to src/main/java/s0007_reverse_integer/Solution.java

@@ -1,4 +1,4 @@
-package s0007.reverse.integer;
+package s0007_reverse_integer;
 
 public class Solution {
     public int reverse(int x) {

src/main/java/s0008.string.to.integer.atoi/Solution.java renamed to src/main/java/s0008_string_to_integer_atoi/Solution.java

@@ -1,4 +1,4 @@
-package s0008.string.to.integer.atoi;
+package s0008_string_to_integer_atoi;
 
 public class Solution {
     public int myAtoi(String str) {

src/main/java/s0009.palindrome.number/Solution.java renamed to src/main/java/s0009_palindrome_number/Solution.java

@@ -1,4 +1,4 @@
-package s0009.palindrome.number;
+package s0009_palindrome_number;
 
 public class Solution {
     public boolean isPalindrome(int x) {