We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
No it isn't. (i + n) % a.length and (i + n%a.length) % a.length are the same thing. It's only useful for the case where n is close to int maximum so that i + n overflows.
Here's another slightly different solution. I'm assuming it would be less performant, since it uses List and then converts it to Array, but I'm not sure how much more so.
static int[] rotLeft(int[] a, int d) {
var result = new List<int>();
for (int i = d; i < (a.Length + d); i++)
{
result.Add(a[i%a.Length]);
}
return result.ToArray();
}
Arrays: Left Rotation
You are viewing a single comment's thread. Return to all comments →
modular arithmetic is cool. I solved that way too
Can you please explain how that works?
Hello, where did this solution from? what should I study to be able to come up with solutions like this?
I love your writing, so neat!
Good solution
Looks a lot like my C# solution:
Perfect solution. Thanks for sharing
Nice solution. You dont need:
This line usefull when n >= a.Length
No it isn't. (i + n) % a.length and (i + n%a.length) % a.length are the same thing. It's only useful for the case where n is close to int maximum so that i + n overflows.
Nice
Could you please explain your solution..?
Here's another slightly different solution. I'm assuming it would be less performant, since it uses List and then converts it to Array, but I'm not sure how much more so.
Awesome!
I agree modular arithmetic is awesome. But, simple list slicing as follows solves too ;)
def rotLeft(a, d): return a[d:]+a[:d]
I agree
Oh my goodness! You are the best!
Agreed