Skip to content

Commit f63e212

Browse files
javadevjavadev
committed
Added tags
1 parent 8cdabe7 commit f63e212

File tree

8 files changed

+20
-18
lines changed

8 files changed

+20
-18
lines changed

‎src/main/kotlin/g3101_3200/s3127_make_a_square_with_the_same_color/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3101_3200.s3127_make_a_square_with_the_same_color
22

3-
// #Easy #Array #Matrix #Enumeration #2024_05_02_Time_0_ms_(100.00%)_Space_41.7_MB_(64.59%)
3+
// #Easy #Array #Matrix #Enumeration #2024_05_02_Time_149_ms_(80.00%)_Space_35.1_MB_(40.00%)
44

55
class Solution {
66
fun canMakeSquare(grid: Array<CharArray>): Boolean {

‎src/main/kotlin/g3101_3200/s3128_right_triangles/Solution.kt

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
1-
package g3101_3200.s3128_right_triangles // #Medium #Array #Hash_Table #Math #Counting #Combinatorics
2-
// #2024_05_02_Time_6_ms_(100.00%)_Space_145.9_MB_(90.67%)
1+
package g3101_3200.s3128_right_triangles
2+
3+
// #Medium #Array #Hash_Table #Math #Counting #Combinatorics
4+
// #2024_05_02_Time_975_ms_(40.63%)_Space_217.6_MB_(56.25%)
35

46
class Solution {
57
fun numberOfRightTriangles(grid: Array<IntArray>): Long {

‎src/main/kotlin/g3101_3200/s3129_find_all_possible_stable_binary_arrays_i/Solution.kt

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,11 @@
11
package g3101_3200.s3129_find_all_possible_stable_binary_arrays_i
22

3+
// #Medium #Dynamic_Programming #Prefix_Sum #2024_05_02_Time_169_ms_(92.86%)_Space_36.3_MB_(100.00%)
4+
35
import kotlin.math.abs
46
import kotlin.math.max
57
import kotlin.math.min
68

7-
// #Medium #Dynamic_Programming #Prefix_Sum #2024_05_02_Time_3_ms_(100.00%)_Space_44.1_MB_(98.38%)
8-
99
class Solution {
1010
private fun add(x: Int, y: Int): Int {
1111
return (x + y) % MODULUS
@@ -21,10 +21,10 @@ class Solution {
2121

2222
fun numberOfStableArrays(zero: Int, one: Int, limit: Int): Int {
2323
if (limit == 1) {
24-
return max((2 - abs((zero - one).toDouble())).toDouble(), 0.0).toInt()
24+
return max((2 - abs((zero - one))), 0)
2525
}
26-
val max = max(zero.toDouble(), one.toDouble()).toInt()
27-
val min = min(zero.toDouble(), one.toDouble()).toInt()
26+
val max = max(zero, one)
27+
val min = min(zero, one)
2828
val lcn = Array(max + 1) { IntArray(max + 1) }
2929
var row0 = lcn[0]
3030
var row1: IntArray

‎src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3101_3200.s3130_find_all_possible_stable_binary_arrays_ii
22

3-
// #Hard #Dynamic_Programming #Prefix_Sum #2024_05_02_Time_3_ms_(100.00%)_Space_40.6_MB_(100.00%)
3+
// #Hard #Dynamic_Programming #Prefix_Sum #2024_05_02_Time_242_ms_(100.00%)_Space_36.7_MB_(100.00%)
44

55
import kotlin.math.max
66
import kotlin.math.min
@@ -24,9 +24,9 @@ class Solution {
2424
}
2525
var ans: Long = 0
2626
val s = LongArray(one + 1)
27-
val n = (min(zero.toDouble(), one.toDouble()) + 1).toInt()
27+
val n = (min(zero, one) + 1).toInt()
2828
for (
29-
groups0 in (zero + limit - 1) / limit..min(zero.toDouble(), n.toDouble())
29+
groups0 in (zero + limit - 1) / limit..min(zero, n)
3030
.toInt()
3131
) {
3232
val s0 = calc(groups0, zero, limit)

‎src/main/kotlin/g3101_3200/s3131_find_the_integer_added_to_array_i/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3101_3200.s3131_find_the_integer_added_to_array_i
22

3-
// #Easy #Array #2024_05_02_Time_0_ms_(100.00%)_Space_43_MB_(75.29%)
3+
// #Easy #Array #2024_05_02_Time_162_ms_(98.15%)_Space_36.3_MB_(100.00%)
44

55
class Solution {
66
fun addedInteger(nums1: IntArray, nums2: IntArray): Int {

‎src/main/kotlin/g3101_3200/s3132_find_the_integer_added_to_array_ii/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g3101_3200.s3132_find_the_integer_added_to_array_ii
22

33
// #Medium #Array #Sorting #Two_Pointers #Enumeration
4-
// #2024_05_02_Time_2_ms_(100.00%)_Space_42.3_MB_(96.46%)
4+
// #2024_05_02_Time_189_ms_(84.85%)_Space_40.2_MB_(57.58%)
55

66
@Suppress("NAME_SHADOWING")
77
class Solution {

‎src/main/kotlin/g3101_3200/s3133_minimum_array_end/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3101_3200.s3133_minimum_array_end
22

3-
// #Medium #Bit_Manipulation #2024_05_02_Time_1_ms_(92.38%)_Space_40.8_MB_(58.58%)
3+
// #Medium #Bit_Manipulation #2024_05_02_Time_131_ms_(90.91%)_Space_33.9_MB_(59.09%)
44

55
@Suppress("NAME_SHADOWING")
66
class Solution {

‎src/main/kotlin/g3101_3200/s3134_find_the_median_of_the_uniqueness_array/Solution.kt

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,15 +1,15 @@
11
package g3101_3200.s3134_find_the_median_of_the_uniqueness_array
22

3-
import kotlin.math.max
4-
53
// #Hard #Array #Hash_Table #Binary_Search #Sliding_Window
6-
// #2024_05_02_Time_47_ms_(100.00%)_Space_56.8_MB_(91.38%)
4+
// #2024_05_02_Time_733_ms_(100.00%)_Space_75.5_MB_(16.67%)
5+
6+
import kotlin.math.max
77

88
class Solution {
99
fun medianOfUniquenessArray(nums: IntArray): Int {
1010
var max = 0
1111
for (x in nums) {
12-
max = max(max.toDouble(), x.toDouble()).toInt()
12+
max = max(max, x)
1313
}
1414
val n = nums.size
1515
val k = (n.toLong() * (n + 1) / 2 + 1) / 2

0 commit comments

Comments
 (0)