From 2fa0295ff18852da9ee846491444a236b9f84211 Mon Sep 17 00:00:00 2001
From: Matej Focko <me@mfocko.xyz>
Date: Sat, 12 Apr 2025 11:41:24 +0200
Subject: [PATCH] =?UTF-8?q?kt:=20refactor=20=C2=AB3272.=20Find=20the=20Cou?=
=?UTF-8?q?nt=20of=20Good=20Integers=C2=BB?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Signed-off-by: Matej Focko <me@mfocko.xyz>
---
kt/find-the-count-of-good-integers.kt | 16 ++++++++--------
1 file changed, 8 insertions(+), 8 deletions(-)
diff --git a/kt/find-the-count-of-good-integers.kt b/kt/find-the-count-of-good-integers.kt
index 20da07e..5cc37af 100644
--- a/kt/find-the-count-of-good-integers.kt
+++ b/kt/find-the-count-of-good-integers.kt
@@ -22,17 +22,17 @@ class Solution {
val base = (1..(n - 1) / 2).fold(1) { acc, _ -> acc * 10 }
val skip = n.and(1)
- for (i in base..10 * base - 1) {
- var s = i.toString()
- s += StringBuilder(s).reverse().substring(skip)
-
- val palindrome = s.toLong()
- if (palindrome % k == 0L) {
- val chars = s.toCharArray()
+ (base..10 * base - 1)
+ .map { i ->
+ var s = i.toString()
+ s += StringBuilder(s).reverse().substring(skip)
+ s to s.toLong()
+ }.filter { (_, it) -> it % k == 0L }
+ .forEach { (it, _) ->
+ val chars = it.toCharArray()
chars.sort()
add(String(chars))
}
- }
}
fun countGoodIntegers(