From 3ad68241dff11869587041c5cf66752d17b334b1 Mon Sep 17 00:00:00 2001
From: CyC2018 <1029579233@qq.com>
Date: Fri, 2 Mar 2018 10:55:46 +0800
Subject: [PATCH] auto commit

---
 notes/剑指 offer 题解.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/notes/剑指 offer 题解.md b/notes/剑指 offer 题解.md
index 838af76f..20896092 100644
--- a/notes/剑指 offer 题解.md	
+++ b/notes/剑指 offer 题解.md	
@@ -102,7 +102,7 @@
 这种数组元素在 [0, n-1] 范围内的问题，可以将值为 i 的元素放到第 i 个位置上。
 
 ```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;
     for (int i = 0; i < length; i++) {
         while (numbers[i] != i && numbers[i] != numbers[numbers[i]]) {