在O(n)的时间复杂度空间复杂度为(1)的条件下删除有序数组的多余字符

原题以下:javascript Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.java Do not allocate extra space for another array, you must do t

>>阅读原文<<