Dude next time please look at your code for just one second...
This if else thing is just horrible. You could've just checked if it is not divisible by 2 and then append _ . There is no need for coding the same loop twice
@hobovsky Your comment is actually a little bit misleading. You need to calculate n! because it's not possible to rewrite the formula so it doesn't contain n!. What you can do is rewrite the formula in a way you can calculate the result more efficiently but you always have to calculate n!
issue not reproducible with the OP's C# code
haha that is exactly what I spoke out loud when I looked at this...
This comment is hidden because it contains spoiler information about the solution
Yeah, your right.
I did that in other languages translations, it is less boring to vary a bit...
holy shit...
Dude next time please look at your code for just one second...
This if else thing is just horrible. You could've just checked if it is not divisible by 2 and then append _ . There is no need for coding the same loop twice
This comment is hidden because it contains spoiler information about the solution
Of course.You are right!Thank you for your suggestion!
Done!
You need to show the entire class definition of
LinkedListNode<T>. What constructors do it have? How are fields accessed?This comment is hidden because it contains spoiler information about the solution
Just a waste of resources. Use a simple loop and 2 variables and you get O(n) time and O(1) space...
This is definitely not a best practice...
It looks handy and short but that's it.
@hobovsky Your comment is actually a little bit misleading. You need to calculate n! because it's not possible to rewrite the formula so it doesn't contain n!.
What you can do is rewrite the formula in a way you can calculate the result more efficiently but you always have to calculate n!
Loading more items...