It seems pretty solid to me and even runs fairly quick with very large numbers on my IDE. Sorry if it's really obvious, I'm still learning.

```
public class Solution {
public void rotate(int[] nums, int k) {
k = k%nums.length;
for (int i = 0; i < k; i++) {
int tmp = nums[nums.length-1];
for (int j = nums.length-1; j > 0; j--)
nums[j] = nums[j-1];
nums[0] = tmp;
}
}
}
```