最快的稳定重复项删除算法
|
我有一个数组，我需要离开它，不能重复。我必须将那些具有最小顺序的唯一元素留在原始数组中。那大概是我的意思
NoDuplicate(A, value)
for int i = 0 to i < A.length
if A[i] == value
return true
i++
return false
StableRemoveAlgo(A)
for int i = 0 to i < A.length
if NoDuplicate(result, A[i])
result.append(A[i])
return result
A[i] == A[j] and i < j
A[j]
没有找到相关结果
已邀请:
4 个回复
董碘奴星
好按紊叉
嘘崇蔡对
墩瓣茅械
sort(array) // use a stable sorting algorithm of your choice. i = 0 //how many unique elements we have already spotted j = 0 //how many array elements we have checked while(j < arr.length){ //found a new value: array[i] = array[j]; //find next value in array that is different while(j < arr.length && array[i] == array[j]){ j++; } } arr.length = i;