
class Solution {
public int findRepeatDocument(int[] documents) {
Arrays.sort(documents);
for(int i=1;i<documents.length;i++){
if(documents[i]==documents[i-1]){
return documents[i];
}
}
return 0;
}
}
class Solution(object):
def findRepeatDocument(self, documents):
documents.sort()
for i in range(1,len(documents)):
if documents[i]==documents[i-1]:
return documents[i]
return 0

被折叠的 条评论
为什么被折叠?



