计算一组Range所覆盖的不重复整数的个数，求 < O(n*n) 的算法。
def cover(rs: Range*):Int = ???
assert(cover(0 to 4, 1 to 5) == 6)
assert(cover(0 to 4, 1 to 3) == 5)
assert(cover(0 to 4, 6 to 7) == 7)
assert(cover(0 to 4, 6 to 7, 2 to 6) == 8)
Last active
August 29, 2015 14:20
-
-
Save Centaur/ce89f7e5c8ad8cb6b23e to your computer and use it in GitHub Desktop.
algorithm
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
@songfei1983 🆒 ❗