Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings
This repository was archived by the owner on Nov 25, 2022. It is now read-only.

Latest commit

 

History

History
History
21 lines (20 loc) · 501 Bytes

File metadata and controls

21 lines (20 loc) · 501 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import java.util.*;
public class Array_TwoSum {
public void rotate(int[] nums, int k) {
if(k>= nums.length) {
k = k-nums.length;
}
int [] arr = new int[nums.length];
for(int i=0;i< nums.length;i++) {
if(i<k) {
arr[i] = nums[nums.length-k+i];
}
else {
arr[i] = nums[i-k];
}
}
for(int i=0;i<nums.length;i++) {
nums[i] = arr[i];
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.