org.masx200

masx200 · masx200 · commit 5ff9e538c5da · 2022-10-17T08:01:41.000+08:00
diff --git a/add-two-integers/index.kt b/add-two-integers/index.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.add_two_integers
+package org.masx200.leetcode_test.add_two_integers
 
 class Solution {
     fun sum(num1: Int, num2: Int): Int {
diff --git a/design-skiplist/index.kt b/design-skiplist/index.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.design_skiplist
+package org.masx200.leetcode_test.design_skiplist
 
 class Skiplist {
     private val storage = hashMapOf<Int, Int>()
diff --git a/insert-into-a-binary-search-tree/TreeNode.kt b/insert-into-a-binary-search-tree/TreeNode.kt
@@ -1,3 +1,3 @@
-package masx200.leetcode_test.insert_into_a_binary_search_tree
+package org.masx200.leetcode_test.insert_into_a_binary_search_tree
 
 class TreeNode(var `val`: Int = 0, var left: TreeNode? = null, var right: TreeNode? = null)
diff --git a/insert-into-a-binary-search-tree/index.kt b/insert-into-a-binary-search-tree/index.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.insert_into_a_binary_search_tree
+package org.masx200.leetcode_test.insert_into_a_binary_search_tree
 
 class Solution {
     fun insertIntoBST(root: TreeNode?, `val`: Int): TreeNode {
diff --git a/leetcode-test.iml b/leetcode-test.iml
@@ -39,14 +39,14 @@
     <output-test url="file://$MODULE_DIR$/target/test-classes" />
     <content url="file://$MODULE_DIR$">
       <sourceFolder url="file://$MODULE_DIR$/add-two-integers" isTestSource="false" />
-      <sourceFolder url="file://$MODULE_DIR$/design-skiplist" isTestSource="false" packagePrefix="masx200.leetcode_test.design_skiplist" />
-      <sourceFolder url="file://$MODULE_DIR$/insert-into-a-binary-search-tree" isTestSource="false" packagePrefix="masx200.leetcode_test.insert_into_a_binary_search_tree" />
-      <sourceFolder url="file://$MODULE_DIR$/min-cost-to-connect-all-points" isTestSource="false" packagePrefix="masx200.leetcode_test.min_cost_to_connect_all_points" />
-      <sourceFolder url="file://$MODULE_DIR$/possible-bipartition" isTestSource="false" packagePrefix="masx200.leetcode_test.possible_bipartition" />
-      <sourceFolder url="file://$MODULE_DIR$/reveal-cards-in-increasing-order" isTestSource="false" packagePrefix="masx200.leetcode_test.reveal_cards_in_increasing_order" />
-      <sourceFolder url="file://$MODULE_DIR$/serialize-and-deserialize-binary-tree" isTestSource="false" packagePrefix="masx200.leetcode_test.serialize_and_deserialize_binary_tree" />
+      <sourceFolder url="file://$MODULE_DIR$/design-skiplist" isTestSource="false" packagePrefix="org.masx200.leetcode_test.design_skiplist" />
+      <sourceFolder url="file://$MODULE_DIR$/insert-into-a-binary-search-tree" isTestSource="false" packagePrefix="org.masx200.leetcode_test.insert_into_a_binary_search_tree" />
+      <sourceFolder url="file://$MODULE_DIR$/min-cost-to-connect-all-points" isTestSource="false" packagePrefix="org.masx200.leetcode_test.min_cost_to_connect_all_points" />
+      <sourceFolder url="file://$MODULE_DIR$/possible-bipartition" isTestSource="false" packagePrefix="org.masx200.leetcode_test.possible_bipartition" />
+      <sourceFolder url="file://$MODULE_DIR$/reveal-cards-in-increasing-order" isTestSource="false" packagePrefix="org.masx200.leetcode_test.reveal_cards_in_increasing_order" />
+      <sourceFolder url="file://$MODULE_DIR$/serialize-and-deserialize-binary-tree" isTestSource="false" packagePrefix="org.masx200.leetcode_test.serialize_and_deserialize_binary_tree" />
       <sourceFolder url="file://$MODULE_DIR$/test" isTestSource="true" />
-      <sourceFolder url="file://$MODULE_DIR$/three-in-one-lcci" isTestSource="false" packagePrefix="masx200.leetcode_test.three_in_one_lcci" />
+      <sourceFolder url="file://$MODULE_DIR$/three-in-one-lcci" isTestSource="false" packagePrefix="org.masx200.leetcode_test.three_in_one_lcci" />
       <excludeFolder url="file://$MODULE_DIR$/target" />
     </content>
     <orderEntry type="inheritedJdk" />
diff --git a/min-cost-to-connect-all-points/index.kt b/min-cost-to-connect-all-points/index.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.min_cost_to_connect_all_points
+package org.masx200.leetcode_test.min_cost_to_connect_all_points
 
 import kotlin.math.abs
 import kotlin.math.min
diff --git a/possible-bipartition/UnionFind.kt b/possible-bipartition/UnionFind.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.possible_bipartition
+package org.masx200.leetcode_test.possible_bipartition
 
 class UnionFind<T> {
     fun union(a: T, b: T) {
diff --git a/possible-bipartition/index.kt b/possible-bipartition/index.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.possible_bipartition
+package org.masx200.leetcode_test.possible_bipartition
 
 class Solution {
     fun possibleBipartition(n: Int, dislikes: Array<IntArray>): Boolean {
diff --git a/reveal-cards-in-increasing-order/index.kt b/reveal-cards-in-increasing-order/index.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.reveal_cards_in_increasing_order
+package org.masx200.leetcode_test.reveal_cards_in_increasing_order
 
 import java.util.*
 
diff --git a/serialize-and-deserialize-binary-tree/index.kt b/serialize-and-deserialize-binary-tree/index.kt
@@ -1,6 +1,6 @@
-package masx200.leetcode_test.serialize_and_deserialize_binary_tree
+package org.masx200.leetcode_test.serialize_and_deserialize_binary_tree
 
-import masx200.leetcode_test.insert_into_a_binary_search_tree.TreeNode
+import org.masx200.leetcode_test.insert_into_a_binary_search_tree.TreeNode
 
 class Codec {
 
diff --git a/test/add_two_integers/SolutionTest.kt b/test/add_two_integers/SolutionTest.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.add_two_integers
+package org.masx200.leetcode_test.add_two_integers
 
 import org.junit.jupiter.api.Assertions.assertEquals
 import org.junit.jupiter.api.Assertions.assertNotEquals
@@ -12,6 +12,6 @@ internal class SolutionTest {
 
         assertNotEquals(Solution().sum(111, 555), 6626)
         assertEquals(Solution().sum(1111, 555), 1666)
-//        println("masx200.leetcode_test.add_two_integers")
+//        println("org.masx200.leetcode_test.add_two_integers")
     }
 }
diff --git a/test/design_skiplist/TestSkiplistTest.kt b/test/design_skiplist/TestSkiplistTest.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.design_skiplist
+package org.masx200.leetcode_test.design_skiplist
 
 
 import kotlin.test.Test
@@ -19,7 +19,7 @@ class TestSkiplistTest {
         assertEquals(true, skiplist.erase(1)) // 返回 true
         assertEquals(false, skiplist.search(1)) // 返回 false，1 已被擦除
         //
-        //        println("masx200.leetcode_test.design_skiplist")
+        //        println("org.masx200.leetcode_test.design_skiplist")
         skiplist.add(4)
         skiplist.add(4)
         assertEquals(true, skiplist.erase(4))
diff --git a/test/possible_bipartition/SolutionTest.kt b/test/possible_bipartition/SolutionTest.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.possible_bipartition
+package org.masx200.leetcode_test.possible_bipartition
 
 import kotlinx.serialization.decodeFromString
 import kotlinx.serialization.json.Json
diff --git a/test/serialize_and_deserialize_binary_tree/CodecTest.kt b/test/serialize_and_deserialize_binary_tree/CodecTest.kt
@@ -1,13 +1,13 @@
-package masx200.leetcode_test.serialize_and_deserialize_binary_tree
+package org.masx200.leetcode_test.serialize_and_deserialize_binary_tree
 
-import masx200.leetcode_test.insert_into_a_binary_search_tree.TreeNode
+import org.masx200.leetcode_test.insert_into_a_binary_search_tree.TreeNode
 import org.junit.jupiter.api.Assertions.assertEquals
 import org.junit.jupiter.api.Test
 
 internal class CodecTest {
     @Test
     fun serialize() {
-        // println("masx200.leetcode_test.serialize_and_deserialize_binary_tree")
+        // println("org.masx200.leetcode_test.serialize_and_deserialize_binary_tree")
         assertEquals(
             "[100,[-200,null,null],[300,[100,[20,null,null],[300,null,null]],null]]",
             Codec().serialize(
diff --git a/test/three_in_one_lcci/TripleInOneTest.kt b/test/three_in_one_lcci/TripleInOneTest.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.three_in_one_lcci
+package org.masx200.leetcode_test.three_in_one_lcci
 
 import org.junit.jupiter.api.Assertions.assertEquals
 import org.junit.jupiter.api.Test
diff --git a/three-in-one-lcci/index.kt b/three-in-one-lcci/index.kt
@@ -1,4 +1,4 @@
-package masx200.leetcode_test.three_in_one_lcci
+package org.masx200.leetcode_test.three_in_one_lcci
 
 class TripleInOne(stackSize: Int) {
     private val stack: IntArray

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package masx200.leetcode_test.add_two_integers`
	`1`	`+package org.masx200.leetcode_test.add_two_integers`
`2`	`2`
`3`	`3`	`class Solution {`
`4`	`4`	`fun sum(num1: Int, num2: Int): Int {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package masx200.leetcode_test.design_skiplist`
	`1`	`+package org.masx200.leetcode_test.design_skiplist`
`2`	`2`
`3`	`3`	`class Skiplist {`
`4`	`4`	`private val storage = hashMapOf<Int, Int>()`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,3 @@`
`1`		`-package masx200.leetcode_test.insert_into_a_binary_search_tree`
	`1`	`+package org.masx200.leetcode_test.insert_into_a_binary_search_tree`
`2`	`2`
`3`	`3`	class TreeNode(var `val`: Int = 0, var left: TreeNode? = null, var right: TreeNode? = null)
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package masx200.leetcode_test.min_cost_to_connect_all_points`
	`1`	`+package org.masx200.leetcode_test.min_cost_to_connect_all_points`
`2`	`2`
`3`	`3`	`import kotlin.math.abs`
`4`	`4`	`import kotlin.math.min`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package masx200.leetcode_test.possible_bipartition`
	`1`	`+package org.masx200.leetcode_test.possible_bipartition`
`2`	`2`
`3`	`3`	`class UnionFind<T> {`
`4`	`4`	`fun union(a: T, b: T) {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package masx200.leetcode_test.reveal_cards_in_increasing_order`
	`1`	`+package org.masx200.leetcode_test.reveal_cards_in_increasing_order`
`2`	`2`
`3`	`3`	`import java.util.*`
`4`	`4`