Code
Hub
Workspaces
Connect
Indexed graphs
Engine
MCP
copy
hub
/
github.com/doocs/leetcode
/ reverse
Method
reverse
solution/0400-0499/0484.Find Permutation/Solution.java:20–26 ·
view source on GitHub ↗
(int[] arr, int i, int j)
Source
from the content-addressed store, hash-verified
18
}
19
20
private
void
reverse(
int
[] arr,
int
i,
int
j) {
21
for
(; i < j; ++i, --j) {
22
int
t = arr[i];
23
arr[i] = arr[j];
24
arr[j] = t;
25
}
26
}
27
}
Callers
11
findPermutation
Method · 0.95
addStrings
Function · 0.45
subStrings
Function · 0.45
addStrings
Function · 0.45
subStrings
Function · 0.45
addStrings
Method · 0.45
subStrings
Method · 0.45
findDiagonalOrder
Method · 0.45
nextGreaterElement
Function · 0.45
nextGreaterElement
Function · 0.45
toHex
Method · 0.45
Calls
no outgoing calls
Tested by
no test coverage detected