seeing your solution makes me want to refactor mine(which is pretty inefficent. I didn't have an idea nor the time to write a better one), but I want to precieve my development. and thanks for the magnifecent idea, never thought of using a Map, am really lacking in terms of algorithmic thinking.
I always like reading code with streams, though am still not used to them. Can you explain why creating n double arrays is faster than using a for loop?
You have given me hope.
How do you delete this.
I came to the discussions beacause of this issue. Turns am just an idiot, and many people asked this too. Is this beehive mind in play?!!
don't prioritize line count over performance.
seeing your solution makes me want to refactor mine(which is pretty inefficent. I didn't have an idea nor the time to write a better one), but I want to precieve my development. and thanks for the magnifecent idea, never thought of using a Map, am really lacking in terms of algorithmic thinking.
I always like reading code with streams, though am still not used to them. Can you explain why creating n double arrays is faster than using a for loop?
s
can you explain your solution, that's a bitwise or(xor) operator right?
can you explain your solution, that's a bitwise or(xor) operator right?
can you explain your solution, that's a bitwise or(xor) operator right?
what does x ^= i mean ? can't seem to find anything in google(or i just suck at searching).