This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#it's not very good to do that... | |
class String | |
def palindrome? | |
self == self.reverse | |
end | |
end | |
input = gets.chomp | |
puts input.palindrome? ? true : false |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def find_words_number(string) | |
string.split.size | |
end | |
puts "Enter Your string:" | |
string = gets.chomp | |
puts "Words Number ---> #{find_words_number(string)}" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
array = [] | |
rand(20..30).times { array << rand(0..40)} | |
puts "Original array #{ array.join(" ") }" | |
puts "Result array #{ array.sort.join(" ") }" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дана строка. Необходимо проверить, является ли она палиндромом. | |
str = "kazask" | |
if str == str.reverse | |
puts "#{str} является палиндромом" | |
else | |
puts "#{str} не является палиндромом" | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дана строка в которой записаны слова через пробел. Необходимо посчитать количество слов. | |
str = "one two three four five" | |
puts str.split.size |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дана строка в которой записаны слова через пробел. Необходимо упорядочить слова по количеству букв в каждом слове. | |
str = "Alexander Yan Dasha Mari 1 s 123 1231 2124" | |
array = str.split.sort_by(&:length).join " " | |
puts array |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дан целочисленный массив. Упорядочить его по возрастанию. | |
numbers = [4, 1, 5, 6, 2, 41, 23] | |
numbers = numbers.sort | |
puts numbers |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дан целочисленный массив. Преобразовать его, вставив перед каждым положительным элементом нулевой элемент | |
number_array = [1, -2, -1, 4] | |
sort_array = number_array.each_with_object([]) do |item , sort_array | | |
sort_array << 0 if item.positive? | |
sort_array << item | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дан целочисленный массив. Осуществить циклический сдвиг элементов массива влево на одну позицию | |
number_array = [1, 2, 3, 4, 5] | |
puts "before : #{ array }" | |
puts "after shift : #{ array.push( array.shift ) }" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дан целочисленный массив. Заменить все положительные элементы на значение минимального. | |
number_array = [-1, 4, 5, -2, -5, 4] | |
min_value_from_array = number_array.min | |
number_array = number_array.map { |e| e > 0 ? e = min_value_from_array : e } | |
puts number_array |
NewerOlder