StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2018-03-02 10:55:46 +08:00
parent cac4195dd9
commit 3ad68241df
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notes/剑指 offer 题解.md
View File

@ -102,7 +102,7 @@
这种数组元素在 [0, n-1] 范围内的问题，可以将值为 i 的元素放到第 i 个位置上。 这种数组元素在 [0, n-1] 范围内的问题，可以将值为 i 的元素放到第 i 个位置上。
```java ```java
public boolean duplicate(int numbers[], int length, int[] duplication) { public boolean duplicate(int[] numbers, int length, int[] duplication) {
if(numbers == null || length <= 0) return false; if(numbers == null || length <= 0) return false;
for (int i = 0; i < length; i++) { for (int i = 0; i < length; i++) {
while (numbers[i] != i && numbers[i] != numbers[numbers[i]]) { while (numbers[i] != i && numbers[i] != numbers[numbers[i]]) {