原谅这个问题的简单性.我正在学习TDD并且有以下陈述.
def test_equilateral_triangles_have_equal_sides
assert_equal :equilateral, triangle(2, 2, 2)
assert_equal :equilateral, triangle(10, 10, 10)
end
def test_isosceles_triangles_have_exactly_two_sides_equal
assert_equal :isosceles, triangle(3, 4, 4)
assert_equal :isosceles, triangle(4, 3, 4)
assert_equal :isosceles, triangle(4, 4, 3)
assert_equal :isosceles, triangle(10, 10, 2)
end
def test_scalene_triangles_have_no_equal_sides
assert_equal :scalene, triangle(3, 4, 5)
assert_equal :scalene, triangle(10, 11, 12)
assert_equal :scalene, triangle(5, 4, 2)
end
Run Code Online (Sandbox Code Playgroud)
我为这个问题提出了一个非常基本的解决方案,并希望从更有经验的程序员那里获得有关替代解决方
我的代码:
def triangle(a, b, c)
if (a == b) && (a == c) && (b == c)
:equilateral
elsif (a == b) && ((a || b) != c)
:isosceles
elsif (a == c) && ((a || c) != b)
:isosceles
elsif (b == c) && ((b || c) != a)
:isosceles
else
:scalene
end
Run Code Online (Sandbox Code Playgroud)
您可以通过对边进行排序来简化条件检查
sides = [a, b, c].sort
return :equilateral if sides[0] == sides[2]
return :isosceles if sides[0] == sides[1] || sides[1] == sides[2]
return :scalene
Run Code Online (Sandbox Code Playgroud)
或者更简单的方法是计算使用的唯一边数 .uniq
sides = [a, b, c].uniq
type = case sides.length
when 1 then :equilateral
when 2 then :isosceles
when 3 then :scalene
end
Run Code Online (Sandbox Code Playgroud)
| 归档时间: |
|
| 查看次数: |
401 次 |
| 最近记录: |