Skip to content

Homework #1 #100

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
RamazanovSham wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Homework #1 #100

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f8fec81
Update fizzbuzz.kt
RamazanovSham Dec 21, 2025
e72f92e
Update sumoftwo.kt
RamazanovSham Dec 21, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 15 additions & 2 deletions src/main/kotlin/ru/otus/homework/fizzbuzz.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,5 +2,18 @@ package ru.otus.homework


fun fizzbuzz(n: Int): Array<String> {
TODO("Выполните задание")
}

val list = mutableListOf<String>()

for(i in 0..n - 1){
if ( i % 3 == 0 && i % 5 == 0)
list.add("FizzBuzz")
else if ( i % 3 == 0 )
list.add("Fizz")
else if ( i % 5 == 0)
list.add("Buzz")
else
list.add(i.toString())
}
return list.toTypedArray()
}
11 changes: 9 additions & 2 deletions src/main/kotlin/ru/otus/homework/sumoftwo.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,5 +2,12 @@ package ru.otus.homework


fun sumOfTwo(numbers: IntArray, target: Int): IntArray {
TODO("Выполните задание")
}
val n = numbers.size
for (i in 0..n-1){
Copy link

@Lufavetskaya Lufavetskaya Dec 28, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Тут можно использовать until для полуоткрытых интервалов: 0 until n и i+1 until n вместо 0..n-1 и i+1..n-1
until явно показывает, что конец не включается. Это стандартная практика в Kotlin для итерации по индексам.

for ( j in i+1..n-1){
if( numbers[i] + numbers[j] == target)
return intArrayOf(i, j)
}
}
throw IllegalArgumentException()
Copy link

@Lufavetskaya Lufavetskaya Dec 28, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Исключение выбрасывается, если пара не найдена. Можно еще добавить сообщение типа: IllegalArgumentException("No two numbers sum to target")

}