Changed package names for compatibility with Eclipse.

javadev · web-flow · commit c420dea4fad7 · 2021-10-27T18:17:32.000+03:00
diff --git a/src/main/java/com_github_leetcode/ListNode.java b/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 {
diff --git a/src/main/java/s0001_two_sum/Solution.java b/src/main/java/s0001_two_sum/Solution.java
@@ -1,4 +1,4 @@
-package s0001.two.sum;
+package s0001_two_sum;
 
 import java.util.Arrays;
 
diff --git a/src/main/java/s0002_add_two_numbers/Solution.java b/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.
diff --git a/src/main/java/s0003_longest_substring_without_repeating_characters/Solution.java b/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) {
diff --git a/src/main/java/s0004_median_of_two_sorted_arrays/Solution.java b/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;
diff --git a/src/main/java/s0005_longest_palindromic_substring/Solution.java b/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) {
diff --git a/src/main/java/s0006_zigzag_conversion/Solution.java b/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) {
diff --git a/src/main/java/s0007_reverse_integer/Solution.java b/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) {
diff --git a/src/main/java/s0008_string_to_integer_atoi/Solution.java b/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) {
diff --git a/src/main/java/s0009_palindrome_number/Solution.java b/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) {
diff --git a/src/main/java/s0010_regular_expression_matching/Solution.java b/src/main/java/s0010_regular_expression_matching/Solution.java
@@ -1,4 +1,4 @@
-package s0010.regular.expression.matching;
+package s0010_regular_expression_matching;
 
 public class Solution {
     public boolean isMatch(String s, String p) {
diff --git a/src/main/java/s0011_container_with_most_water/Solution.java b/src/main/java/s0011_container_with_most_water/Solution.java
@@ -1,4 +1,4 @@
-package s0011.container.with.most.water;
+package s0011_container_with_most_water;
 
 public class Solution {
     public int maxArea(int[] height) {
diff --git a/src/main/java/s0012_integer_to_roman/Solution.java b/src/main/java/s0012_integer_to_roman/Solution.java
@@ -1,4 +1,4 @@
-package s0012.integer.to.roman;
+package s0012_integer_to_roman;
 
 public class Solution {
     public String intToRoman(int num) {
diff --git a/src/main/java/s0013_roman_to_integer/Solution.java b/src/main/java/s0013_roman_to_integer/Solution.java
@@ -1,4 +1,4 @@
-package s0013.roman.to.integer;
+package s0013_roman_to_integer;
 
 public class Solution {
     public int romanToInt(String s) {
diff --git a/src/main/java/s0014_longest_common_prefix/Solution.java b/src/main/java/s0014_longest_common_prefix/Solution.java
@@ -1,4 +1,4 @@
-package s0014.longest.common.prefix;
+package s0014_longest_common_prefix;
 
 public class Solution {
     public String longestCommonPrefix(String[] strs) {
diff --git a/src/main/java/s0015_three_sum/Solution.java b/src/main/java/s0015_three_sum/Solution.java
@@ -1,4 +1,4 @@
-package s0015.three.sum;
+package s0015_three_sum;
 
 import java.util.ArrayList;
 import java.util.Arrays;
diff --git a/src/main/java/s0016_three_sum_closest/Solution.java b/src/main/java/s0016_three_sum_closest/Solution.java
@@ -1,4 +1,4 @@
-package s0016.three.sum.closest;
+package s0016_three_sum_closest;
 
 import java.util.Arrays;
 
diff --git a/src/main/java/s0017_letter_combinations_of_a_phone_number/Solution.java b/src/main/java/s0017_letter_combinations_of_a_phone_number/Solution.java
@@ -1,4 +1,4 @@
-package s0017.letter.combinations.of.a.phone.number;
+package s0017_letter_combinations_of_a_phone_number;
 
 import java.util.ArrayList;
 import java.util.Collections;
diff --git a/src/main/java/s0018_four_sum/Solution.java b/src/main/java/s0018_four_sum/Solution.java
@@ -1,4 +1,4 @@
-package s0018.four.sum;
+package s0018_four_sum;
 
 import java.util.ArrayList;
 import java.util.Arrays;
diff --git a/src/main/java/s0019_remove_nth_node_from_end_of_list/Solution.java b/src/main/java/s0019_remove_nth_node_from_end_of_list/Solution.java
@@ -1,6 +1,6 @@
-package s0019.remove.nth.node.from.end.of.list;
+package s0019_remove_nth_node_from_end_of_list;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 
 public class Solution {
     int n;
diff --git a/src/main/java/s0020_valid_parentheses/Solution.java b/src/main/java/s0020_valid_parentheses/Solution.java
@@ -1,4 +1,4 @@
-package s0020.valid.parentheses;
+package s0020_valid_parentheses;
 
 import java.util.Stack;
 
diff --git a/src/main/java/s0021_merge_two_sorted_lists/Solution.java b/src/main/java/s0021_merge_two_sorted_lists/Solution.java
@@ -1,6 +1,6 @@
-package s0021.merge.two.sorted.lists;
+package s0021_merge_two_sorted_lists;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 
 public class Solution {
     public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
diff --git a/src/main/java/s0022_generate_parentheses/Solution.java b/src/main/java/s0022_generate_parentheses/Solution.java
@@ -1,4 +1,4 @@
-package s0022.generate.parentheses;
+package s0022_generate_parentheses;
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/s0023_merge_k_sorted_lists/Solution.java b/src/main/java/s0023_merge_k_sorted_lists/Solution.java
@@ -1,6 +1,6 @@
-package s0023.merge.k.sorted.lists;
+package s0023_merge_k_sorted_lists;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 
 public class Solution {
     public ListNode mergeKLists(ListNode[] lists) {
diff --git a/src/main/java/s0024_swap_nodes_in_pairs/Solution.java b/src/main/java/s0024_swap_nodes_in_pairs/Solution.java
@@ -1,6 +1,6 @@
-package s0024.swap.nodes.in.pairs;
+package s0024_swap_nodes_in_pairs;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 
 public class Solution {
     public ListNode swapPairs(ListNode head) {
diff --git a/src/main/java/s0025_reverse_nodes_in_k_group/Solution.java b/src/main/java/s0025_reverse_nodes_in_k_group/Solution.java
@@ -1,6 +1,6 @@
-package s0025.reverse.nodes.in.k.group;
+package s0025_reverse_nodes_in_k_group;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 
 public class Solution {
     public ListNode reverseKGroup(ListNode head, int k) {
diff --git a/src/main/java/s0026_remove_duplicates_from_sorted_array/Solution.java b/src/main/java/s0026_remove_duplicates_from_sorted_array/Solution.java
@@ -1,4 +1,4 @@
-package s0026.remove.duplicates.from.sorted.array;
+package s0026_remove_duplicates_from_sorted_array;
 
 public class Solution {
     public int removeDuplicates(int[] nums) {
diff --git a/src/main/java/s0030_substring_with_concatenation_of_all_words/Solution.java b/src/main/java/s0030_substring_with_concatenation_of_all_words/Solution.java
@@ -1,4 +1,4 @@
-package s0030.substring.with.concatenation.of.all.words;
+package s0030_substring_with_concatenation_of_all_words;
 
 import java.util.*;
 
diff --git a/src/main/java/s0031_next_permutation/Solution.java b/src/main/java/s0031_next_permutation/Solution.java
@@ -1,4 +1,4 @@
-package s0031.next.permutation;
+package s0031_next_permutation;
 
 public class Solution {
     public void nextPermutation(int[] nums) {
diff --git a/src/main/java/s0273_integer_to_english_words/Solution.java b/src/main/java/s0273_integer_to_english_words/Solution.java
@@ -1,4 +1,4 @@
-package s0273.integer.to.english.words;
+package s0273_integer_to_english_words;
 
 public class Solution {
 
diff --git a/src/main/java/s0307_range_sum_query_mutable/NumArray.java b/src/main/java/s0307_range_sum_query_mutable/NumArray.java
@@ -1,4 +1,4 @@
-package s0307.range.sum.query.mutable;
+package s0307_range_sum_query_mutable;
 
 public class NumArray {
     private int[] nums;
diff --git a/src/test/java/s0001_two_sum/SolutionTest.java b/src/test/java/s0001_two_sum/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0001.two.sum;
+package s0001_two_sum;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0002_add_two_numbers/SolutionTest.java b/src/test/java/s0002_add_two_numbers/SolutionTest.java
@@ -1,9 +1,9 @@
-package s0002.add.two.numbers;
+package s0002_add_two_numbers;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 import org.junit.Test;
 
 public class SolutionTest {
diff --git a/src/test/java/s0003_longest_substring_without_repeating_characters/SolutionTest.java b/src/test/java/s0003_longest_substring_without_repeating_characters/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0003.longest.substring.without.repeating.characters;
+package s0003_longest_substring_without_repeating_characters;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0004_median_of_two_sorted_arrays/SolutionTest.java b/src/test/java/s0004_median_of_two_sorted_arrays/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0004.median.of.two.sorted.arrays;
+package s0004_median_of_two_sorted_arrays;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0005_longest_palindromic_substring/SolutionTest.java b/src/test/java/s0005_longest_palindromic_substring/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0005.longest.palindromic.substring;
+package s0005_longest_palindromic_substring;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0006_zigzag_conversion/SolutionTest.java b/src/test/java/s0006_zigzag_conversion/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0006.zigzag.conversion;
+package s0006_zigzag_conversion;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0007_reverse_integer/SolutionTest.java b/src/test/java/s0007_reverse_integer/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0007.reverse.integer;
+package s0007_reverse_integer;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0008_string_to_integer_atoi/SolutionTest.java b/src/test/java/s0008_string_to_integer_atoi/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0008.string.to.integer.atoi;
+package s0008_string_to_integer_atoi;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0009_palindrome_number/SolutionTest.java b/src/test/java/s0009_palindrome_number/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0009.palindrome.number;
+package s0009_palindrome_number;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0010_regular_expression_matching/SolutionTest.java b/src/test/java/s0010_regular_expression_matching/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0010.regular.expression.matching;
+package s0010_regular_expression_matching;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0011_container_with_most_water/SolutionTest.java b/src/test/java/s0011_container_with_most_water/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0011.container.with.most.water;
+package s0011_container_with_most_water;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0012_integer_to_roman/SolutionTest.java b/src/test/java/s0012_integer_to_roman/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0012.integer.to.roman;
+package s0012_integer_to_roman;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0013_roman_to_integer/SolutionTest.java b/src/test/java/s0013_roman_to_integer/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0013.roman.to.integer;
+package s0013_roman_to_integer;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0014_longest_common_prefix/SolutionTest.java b/src/test/java/s0014_longest_common_prefix/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0014.longest.common.prefix;
+package s0014_longest_common_prefix;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0015_three_sum/SolutionTest.java b/src/test/java/s0015_three_sum/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0015.three.sum;
+package s0015_three_sum;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0016_three_sum_closest/SolutionTest.java b/src/test/java/s0016_three_sum_closest/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0016.three.sum.closest;
+package s0016_three_sum_closest;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0017_letter_combinations_of_a_phone_number/SolutionTest.java b/src/test/java/s0017_letter_combinations_of_a_phone_number/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0017.letter.combinations.of.a.phone.number;
+package s0017_letter_combinations_of_a_phone_number;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0018_four_sum/SolutionTest.java b/src/test/java/s0018_four_sum/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0018.four.sum;
+package s0018_four_sum;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0019_remove_nth_node_from_end_of_list/SolutionTest.java b/src/test/java/s0019_remove_nth_node_from_end_of_list/SolutionTest.java
@@ -1,9 +1,9 @@
-package s0019.remove.nth.node.from.end.of.list;
+package s0019_remove_nth_node_from_end_of_list;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 import org.junit.Test;
 
 public class SolutionTest {
diff --git a/src/test/java/s0020_valid_parentheses/SolutionTest.java b/src/test/java/s0020_valid_parentheses/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0020.valid.parentheses;
+package s0020_valid_parentheses;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0021_merge_two_sorted_lists/SolutionTest.java b/src/test/java/s0021_merge_two_sorted_lists/SolutionTest.java
@@ -1,9 +1,9 @@
-package s0021.merge.two.sorted.lists;
+package s0021_merge_two_sorted_lists;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 import org.junit.Test;
 
 public class SolutionTest {
diff --git a/src/test/java/s0022_generate_parentheses/SolutionTest.java b/src/test/java/s0022_generate_parentheses/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0022.generate.parentheses;
+package s0022_generate_parentheses;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0023_merge_k_sorted_lists/SolutionTest.java b/src/test/java/s0023_merge_k_sorted_lists/SolutionTest.java
@@ -1,9 +1,9 @@
-package s0023.merge.k.sorted.lists;
+package s0023_merge_k_sorted_lists;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 import org.junit.Test;
 
 public class SolutionTest {
diff --git a/src/test/java/s0024_swap_nodes_in_pairs/SolutionTest.java b/src/test/java/s0024_swap_nodes_in_pairs/SolutionTest.java
@@ -1,9 +1,9 @@
-package s0024.swap.nodes.in.pairs;
+package s0024_swap_nodes_in_pairs;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 import org.junit.Test;
 
 public class SolutionTest {
diff --git a/src/test/java/s0025_reverse_nodes_in_k_group/SolutionTest.java b/src/test/java/s0025_reverse_nodes_in_k_group/SolutionTest.java
@@ -1,9 +1,9 @@
-package s0025.reverse.nodes.in.k.group;
+package s0025_reverse_nodes_in_k_group;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import com.github.leetcode.ListNode;
+import com_github_leetcode.ListNode;
 import org.junit.Test;
 
 public class SolutionTest {
diff --git a/src/test/java/s0026_remove_duplicates_from_sorted_array/SolutionTest.java b/src/test/java/s0026_remove_duplicates_from_sorted_array/SolutionTest.java
@@ -1,4 +1,4 @@
-package s0026.remove.duplicates.from.sorted.array;
+package s0026_remove_duplicates_from_sorted_array;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
diff --git a/src/test/java/s0030_substring_with_concatenation_of_all_words/SolutionTest.java b/src/test/java/s0030_substring_with_concatenation_of_all_words/SolutionTest.java
diff --git a/src/test/java/s0031_next_permutation/SolutionTest.java b/src/test/java/s0031_next_permutation/SolutionTest.java
diff --git a/src/test/java/s0273_integer_to_english_words/SolutionTest.java b/src/test/java/s0273_integer_to_english_words/SolutionTest.java
diff --git a/src/test/java/s0307_range_sum_query_mutable/NumArrayTest.java b/src/test/java/s0307_range_sum_query_mutable/NumArrayTest.java

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.github.leetcode;`
	`1`	`+package com_github_leetcode;`
`2`	`2`
`3`	`3`	`@SuppressWarnings("java:S1104")`
`4`	`4`	`public class ListNode {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0001.two.sum;`
	`1`	`+package s0001_two_sum;`
`2`	`2`
`3`	`3`	`import java.util.Arrays;`
`4`	`4`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0003.longest.substring.without.repeating.characters;`
	`1`	`+package s0003_longest_substring_without_repeating_characters;`
`2`	`2`
`3`	`3`	`public class Solution {`
`4`	`4`	`public int lengthOfLongestSubstring(String s) {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0004.median.of.two.sorted.arrays;`
	`1`	`+package s0004_median_of_two_sorted_arrays;`
`2`	`2`
`3`	`3`	`import java.util.ArrayList;`
`4`	`4`	`import java.util.Collections;`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0005.longest.palindromic.substring;`
	`1`	`+package s0005_longest_palindromic_substring;`
`2`	`2`
`3`	`3`	`public class Solution {`
`4`	`4`	`public String longestPalindrome(String s) {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0006.zigzag.conversion;`
	`1`	`+package s0006_zigzag_conversion;`
`2`	`2`
`3`	`3`	`public class Solution {`
`4`	`4`	`public String convert(String s, int numRows) {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0007.reverse.integer;`
	`1`	`+package s0007_reverse_integer;`
`2`	`2`
`3`	`3`	`public class Solution {`
`4`	`4`	`public int reverse(int x) {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0008.string.to.integer.atoi;`
	`1`	`+package s0008_string_to_integer_atoi;`
`2`	`2`
`3`	`3`	`public class Solution {`
`4`	`4`	`public int myAtoi(String str) {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0009.palindrome.number;`
	`1`	`+package s0009_palindrome_number;`
`2`	`2`
`3`	`3`	`public class Solution {`
`4`	`4`	`public boolean isPalindrome(int x) {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package s0010.regular.expression.matching;`
	`1`	`+package s0010_regular_expression_matching;`
`2`	`2`
`3`	`3`	`public class Solution {`
`4`	`4`	`public boolean isMatch(String s, String p) {`