Remove duplicates from the sorted array

//using 3 pointers  
fixDuplicatesInSortedArray(Integer\[\] a):  
    start = 0  
    end = 0  
    destination = 0  
  
    while(start < a.length):  
        while(end < a.length && a\[end\] == a\[start\]):  
            end++  
        end--  
         
        //copy the distinct element  
        a\[destination\] = a\[start\]  
        destination++  
         
        start = end + 1  
        end = start  
  
    //null out the rest  
    while destination < a.length:  
        a\[destination\] = null  
  
    return  

//using 2 pointers  
fixDuplicatesInSortedArray(Integer\[\] a):  
    prev = 0  
    curr = 1  
     
    while curr < a.length():  
        while curr < a.length && a\[curr\] == c\[prev\]:  
            curr++  
        if curr == a.length() break  
         
        prev++  
        a\[prev\] = a\[curr\]  
        curr++  
     
    //null out the rest  
    prev++  
    while prev < a.length:  
        a\[prev\] = null  
     
    return