Solved

# rotate array rotateLeft3

Posted on 2015-02-12
104 Views
Hi,

I am working  below challenge

http://codingbat.com/prob/p185139

``````public int[] rotateLeft3(int[] nums) {
int num1=nums[0];
int num2=nums[1];
int num3=nums[2]

}
``````

i kind of started but not sure on the approach to follow. Please advise
0
Question by:gudii9
[X]
###### Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

• Help others & share knowledge
• Earn cash & points
• 5
• 4
• 3
• +1

LVL 84

Assisted Solution

ozo earned 200 total points
ID: 40606595
int array[]={nums[1],nums[2],nums[0]};
return array;
0

LVL 7

Author Comment

ID: 40606598
rotate left means what. Is it is not same as reversing?
i thought it shoud be like

int array[]={nums[2],nums[1],nums[0]};
return array;

0

LVL 84

Expert Comment

ID: 40606613
The word rotate is being used in this sense: http://en.wikipedia.org/wiki/Circular_shift#Example
0

LVL 27

Accepted Solution

dpearson earned 200 total points
ID: 40606742
Looks closely at the first example:
rotateLeft3({1, 2, 3}) â†’ {2, 3, 1}

to see how the numbers move.  Each goes one left and the first number goes to the end.

The solution ozo posted is perfectly fine here.  But if you want to think about this problem a bit more you might want to consider a solution like this which works for any length array (>= 1):

``````public int[] rotateLeft3(int[] nums) {
int len = nums.length ;
int first = nums[0] ;
for (int i = 0 ; i < len-1 ; i++) {
nums[i] = nums[i+1] ;
}
nums[len-1] = first ;
return nums ;
}
``````

Can you see how it moves everything left and then moves the first value to the end?

Doug
0

LVL 3

Assisted Solution

Nadia Sobnom earned 100 total points
ID: 40607319
The following solution does this without any extra variables :)
``````public int[] rotateLeft3(int[] nums) {
nums[0]^=nums[1];
nums[1]^=nums[0];
nums[0]^=nums[1];
nums[1]^=nums[2];
nums[2]^=nums[1];
nums[1]^=nums[2];
return nums;
}
``````

Let me try to explain how it works.
We can rotate the whole array by two steps
1. swap nums[0] and nums[1]
2. swap nums[1] and nums[2]

If you can see the XOR swap algorithm, two numbers a and b can be swapped by the following
``````a ^= b;
b ^= a;
a ^= b;
``````
That is exactly what I've done in first three lines to swap first two elements, similarly last three lines are swapping last two elements.
0

LVL 7

Author Comment

ID: 40608085
``````nums[0]^=nums[1];
nums[1]^=nums[0];
nums[0]^=nums[1];
nums[1]^=nums[2];
nums[2]^=nums[1];
nums[1]^=nums[2];
``````

can you please elaborate on this.

How ^ works. I have not used that much earlier.

``````public int[] rotateLeft3(int[] nums) {
int len = nums.length ;
int first = nums[0] ;
for (int i = 0 ; i < len-1 ; i++) {
nums[i] = nums[i+1] ;
}
nums[len-1] = first ;
return nums ;
}
``````
above also passed all tests
0

LVL 84

Expert Comment

ID: 40608105
0

LVL 7

Author Comment

ID: 40608152
basicaly it is circular movement(first is kept at last and other than placed at index subtracted by 1 to orignial) right?
0

LVL 84

Expert Comment

ID: 40609452
Yes, assuming that indexes are numbered left to right.
0

LVL 27

Expert Comment

ID: 40611208
The XOR (^) solution is clever - but not one you should be focusing on when learning the basics of the language.  You could go for many many years as a professional Java developer and never see that pattern again.

You should focus on loops, variable assignments etc. over the behavior of binary operators like XOR.  I think Nadia was just having some fun and pointing out there are many possible solutions here.

Did you figure out how this works and why it would work for rotating arrays of any length >= 1?

``````public int[] rotateLeft3(int[] nums) {
int len = nums.length ;
int first = nums[0] ;
for (int i = 0 ; i < len-1 ; i++) {
nums[i] = nums[i+1] ;
}
nums[len-1] = first ;
return nums ;
}
``````

Doug
0

LVL 84

Expert Comment

ID: 40611290
http://en.wikipedia.org/wiki/XOR_swap_algorithm#Reasons_for_avoidance_in_practice explains several reasons not to use the xor solution.
An additional reason in this application is that it uses 3*(n-1) operations instead of n+1 operations using a temporary.
0

LVL 7

Author Comment

ID: 40612864
Did you figure out how this works and why it would work for rotating arrays of any length >= 1?

yes I think  it is circular movement(first is kept at last and other than placed at index subtracted by 1 to orignial) right

``````public int[] rotateLeft3(int[] nums) {
int len = nums.length ;//find lengh of nums array
int first = nums[0] ;assign fist element of arrya to first int variable
for (int i = 0 ; i < len-1 ; i++) {//loop through till the end of the array lenth
nums[i] = nums[i+1] ;//assign right hand side element to left hand side element except first i think??
}
nums[len-1] = first ;//assign first to last elemt now
return nums ; return the nums array which is modified
}
``````

0

LVL 27

Expert Comment

ID: 40613302
Yep that's it exactly.

For these problems it's often good to solve the specific challenge they give you and also think about the wider set of similar problems.

Sounds like you've mastered this one.

Doug
0

## Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

### Suggested Solutions

web application structure 18 137
Tagging and Merging on Branch 1 70
listing all the respondents to a twitter feed - Java 5 49
Session in java desktop 5 39
How to remove superseded packages in windows w60 or w61 installation media (.wim) or online system to prevent unnecessary space. w60 means Windows Vista or Windows Server 2008. w61 means Windows 7 or Windows Server 2008 R2. There are various â€¦
In this post we will learn how to make Android Gesture Tutorial and give different functionality whenever a user Touch or Scroll android screen.
This theoretical tutorial explains exceptions, reasons for exceptions, different categories of exception and exception hierarchy.
The goal of the video will be to teach the user the concept of local variables and scope. An example of a locally defined variable will be given as well as an explanation of what scope is in C++. The local variable and concept of scope will be relatâ€¦
###### Suggested Courses
Course of the Month1 day, 19 hours left to enroll