你必須很努力

Day22 - Codewars 刷題

2019/10/01
字數統計: 277閱讀時間: 1 min

出門前刷一波
讓自己不用一直惦記著鐵人賽還沒寫 xd

Codewars LV8x1、LV7x1


題目(Convert number to reversed array of digits)

1
2
3
4
5
6
7
8
9
Convert number to reversed array of digits
Given a random number:

C#: long;
C++: unsigned long;
You have to return the digits of this number within an array in reverse order.

Example:
348597 => [7,9,5,8,4,3]

1
2
3
4
5
def digitize(n)
#your code here
end

Test.assert_equals(digitize(35231),[1,3,2,5,3])

題目(Highest and Lowest)

1
2
3
4
5
6
7
8
9
10
11
12
In this little assignment you are given a string of space separated numbers, and have to return the highest and lowest number.

Example:

high_and_low("1 2 3 4 5") # return "5 1"
high_and_low("1 2 -3 4 5") # return "5 -3"
high_and_low("1 9 3 4 -5") # return "9 -5"
Notes:

All numbers are valid Int32, no need to validate them.
There will always be at least one number in the input string.
Output string must be two numbers separated by a single space, and highest number is first.

1
2
3
4
5
def high_and_low(numbers)
#your code here
end

Test.assert_equals(high_and_low("4 5 29 54 4 0 -214 542 -64 1 -3 6 -6"), "542 -214")


影片解題: Yes


答案:

1
2
3
4
5
6
7
8
9
10
11
12
# Convert number to reversed array of digits
def digitize(n)
n.to_s.chars.map{|x| x.to_i}.reverse
end


# Highest and Lowest
def high_and_low(numbers)
max = numbers.split.map{|x| x.to_i}.max
min = numbers.split.map{|x| x.to_i}.min
"#{max} #{min}"
end

本文同步發布於 小菜的 Blog https://riverye.com/

原文連結:https://riverye.com/2019/10/01/Day22-Codewars-刷題/

發表日期:2019-10-01

更新日期:2019-10-09

CATALOG