programming php

Xóa các bản sao khỏi mảng được sắp xếp PHP

Đưa ra một mảng được sắp xếp 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
31, loại bỏ các phần trùng lặp tại chỗ sao cho mỗi phần tử chỉ xuất hiện một lần và trả về độ dài mới

Không phân bổ thêm không gian cho một mảng khác, bạn phải thực hiện việc này bằng cách sửa đổi mảng đầu vào tại chỗ với bộ nhớ bổ sung O[1]

Làm rõ. Nhầm lẫn tại sao giá trị trả về là một số nguyên nhưng câu trả lời của bạn là một mảng?

Trong nội bộ bạn có thể nghĩ về điều này

// nums is passed in by reference. [i.e., without making a copy]
int len = removeDuplicates[nums];

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for [int i = 0; i < len; i++] {
    print[nums[i]];
}

Hạn chế

  • 0 ≤ 
    
# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
    32 ≤ 3 × 104
  • -104 ≤ 
    
# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
    33 ≤ 104
  • 
# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
    31 được sắp xếp theo thứ tự tăng dần

ví dụ

ví dụ 1

Input: nums = [1,1,2]
Output: 2, nums = [1,2]
Explanation: Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the returned length.

ví dụ 2

Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4]
Explanation: Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively. It doesn't matter what values are set beyond the returned length.

Phân tích

Vấn đề này đơn giản như mô tả của nó 😃. Chúng tôi sẽ được cung cấp một mảng được sắp xếp có chứa các bản sao và chúng tôi chỉ cần giữ một phiên bản duy nhất của mỗi phần tử. Ngoài ra, chúng ta cần cập nhật mảng tại chỗ, nghĩa là chúng ta phải thực hiện tất cả các thao tác trong cùng một mảng mà không sử dụng bất kỳ cấu trúc dữ liệu nào

Cuối cùng, chúng ta phải trả về độ dài của mảng đã cập nhật

Cách tiếp cận

Một điều quan trọng trong câu hỏi là mảng được sắp xếp. Điều này có nghĩa là tất cả các phần tử trùng lặp sẽ liền kề nhau. cho e. g. , trong mảng 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
35 ta thấy tất cả các phần tử trùng đều nằm liền kề nhau

Chúng ta có thể sử dụng thuộc tính này của mảng được sắp xếp có chứa các bản sao để giải quyết câu hỏi này bằng các bước sau -

  1. Kiểm tra xem phần tử hiện tại và phần tử tiếp theo có bằng nhau không
  2. Nếu có, chúng tôi sẽ bỏ qua phần tử tiếp theo và sẽ tiếp tục quy trình miễn là chúng tôi gặp phải các bản sao
  3. Nếu các phần tử không trùng lặp, chúng ta sẽ đặt phần tử tiếp theo [khác] bên cạnh phần tử hiện tại

Chúng tôi đang quét mảng một lần, do đó độ phức tạp về thời gian sẽ là O[n]

Độ phức tạp không gian

Vì chúng tôi bị cấm sử dụng cấu trúc dữ liệu bên ngoài [và chúng tôi không sử dụng nó 😛], nên độ phức tạp của không gian sẽ là O[1]

Java

con trăn

JavaScript

Kotlin

Hoàn thành mã

Sự kết luận

Chúc mừng 👏. Trong bài đăng này, chúng tôi đã giải quyết một vấn đề dễ dàng từ LeetCode liên quan đến mảng

Tôi hy vọng bạn thích bài viết này. Hãy chia sẻ suy nghĩ của bạn về điều này

Bạn có thể tìm thấy mã nguồn hoàn chỉnh trên kho lưu trữ GitHub của tôi. Nếu bạn thích những gì mình học được, hãy thoải mái rẽ nhánh 🔪 và gắn dấu sao ⭐ cho nó


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
36


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
37


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
38


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
39


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
40


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
41


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
42


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
43


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
44


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
41____324

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
457


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
48

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
24

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
50

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
52


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
54


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
56


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
59____326

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
61


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
62____5469

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5521


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5523


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
69

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
71

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5527


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
48

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
24

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
80

_______5468____5584

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
587

1 2 3 4 5
8____5588

 

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
89 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
08 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
91 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
92

1 2 3 4 5
8
1 2 3 4 5
7


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
97

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
00

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
00

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
04

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
12

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
12 
1 2 3 4 5
15


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 
1 2 3 4 5
18

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5616

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5618


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
48

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
24
1 2 3 4 5
29

_______5468____431____5456

1 2 3 4 5
33

1 2 3 4 5
8____5588


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
588

 

1 2 3 4 5
02

Python3




1 2 3 4 5
38

1 2 3 4 5
39

1 2 3 4 5
40

1 2 3 4 5
41

 

1 2 3 4 5
42

1 2 3 4 5
43

1 2 3 4 5
44

1 2 3 4 5
45 
1 2 3 4 5
46

 

1 2 3 4 5
8
1 2 3 4 5
48

1 2 3 4 5
8
1 2 3 4 5
50

1 2 3 4 5
8
1 2 3 4 5
52

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 
1 2 3 4 5
55
1 2 3 4 5
56
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
24 
1 2 3 4 5
59 
1 2 3 4 5
55
1 2 3 4 5
56
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26
1 2 3 4 5
64


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 
1 2 3 4 5
55

 

1 2 3 4 5
8
1 2 3 4 5
69____456 
1 2 3 4 5
71

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
73____474

 

1 2 3 4 5
8
1 2 3 4 5
76

1 2 3 4 5
8
1 2 3 4 5
78
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
24

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
457

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 
1 2 3 4 5
84
1 2 3 4 5
85 
1 2 3 4 5
73

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462____324
1 2 3 4 5
89
1 2 3 4 5
90

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26
1 2 3 4 5
92

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
94


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
96


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
98


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____54600


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4603
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4605

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4606

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4608


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4610
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4612


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468
1 2 3 4 5
78____54606
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

 

1 2 3 4 5
8____54619

1 2 3 4 5
8____54621

1 2 3 4 5
8____54623

1 2 3 4 5
8____54625

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4610
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4629
1 2 3 4 5
90

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4632

1 2 3 4 5
8
1 2 3 4 5
78____54606
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

1 2 3 4 5
8

_______48____54640

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 
1 2 3 4 5
84
1 2 3 4 5
85 
1 2 3 4 5
73

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462____324

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4648


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4612
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4652

 

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 
1 2 3 4 5
78

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4656


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4657
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4659

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
00

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
00

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
04

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
12

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
12

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4632

1 2 3 4 5
55
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4680

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4681

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4682


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4683

1 2 3 4 5
55
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4686

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4687


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 
1 2 3 4 5
84
1 2 3 4 5
85 
1 2 3 4 5
73

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4692

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4694 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4696

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4697

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4698
1 2 3 4 5
56 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
456

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
27

 

_______48____55203

C#





# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5204


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5205


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
58 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5207

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
01 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5209

1 2 3 4 5
8

_______48____55212

_______48____55214

_______48____55216

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
08 
1 2 3 4 5
1 
1 2 3 4 5
2
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5222
1 2 3 4 5
1 
1 2 3 4 5
6

1 2 3 4 5
8
1 2 3 4 5
7


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55229


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55231


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
7

1 2 3 4 5
8


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5241

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
34 
1 2 3 4 5
1

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
36


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
2


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 
1 2 3 4 5
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
464


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468____55259


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5261


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468____55263


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5266


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
62____5469


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55271


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55273


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55275


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55277


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55279


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5527


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
582

_______5468____5584

1 2 3 4 5
8


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
587

1 2 3 4 5
8____5588

1 2 3 4 5
8

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
89 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
08 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
91 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5801

1 2 3 4 5
8
1 2 3 4 5
7


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5806


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5809


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5616

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5618


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
453

_______5468____55821____5456

1 2 3 4 5
33

1 2 3 4 5
8____5588


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
588

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5827

Javascript





# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5828

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5829


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5205

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5831


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5832


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5833


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5834 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4686

1 2 3 4 5
7

1 2 3 4 5
8____55229

_______48____55231

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5843


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
7

 

1 2 3 4 5
8____55848 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5849

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
34 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5851

 

1 2 3 4 5
8
1 2 3 4 5
2

1 2 3 4 5
8____55848 
1 2 3 4 5
5

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5848 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5861

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55259


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55261


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55263


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5266


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
469

 

1 2 3 4 5
8____55874

1 2 3 4 5
8____55876

1 2 3 4 5
8____55277

1 2 3 4 5
8____55279

 

1 2 3 4 5
8____5527

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5848 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5887


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5584

 

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
587


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
588

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5848 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5895

1 2 3 4 5
8____55848 
1 2 3 4 5
18

 

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0800

1 2 3 4 5
8____55833

_______48____5616

 

1 2 3 4 5
8____5618

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5848 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0811


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0812

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0813

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
456
1 2 3 4 5
33

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0816

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0817

Đầu ra

1 2 3 4 5

Độ phức tạp về thời gian. O[n] 
Không gian phụ. O[n]

Phương pháp 2. [Không gian thêm không đổi]

Chỉ cần duy trì một chỉ mục riêng cho cùng một mảng như được duy trì cho các mảng khác nhau trong Phương pháp 1

Thực hiện

C++





# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0818


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0819


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
58 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
08 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
61

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5831


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5832


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5833

1 2 3 4 5
1 
1 2 3 4 5
2
1 2 3 4 5
1 
1 2 3 4 5
4
1 2 3 4 5
1 
1 2 3 4 5
6

1 2 3 4 5
7

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5843


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
7

 

_______48____70840

1 2 3 4 5
8
1 2 3 4 5
1 
1 2 3 4 5
5

 

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0845

_______48____70847

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0852


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5266


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0857

 

_______48____70859

 

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
587


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
588

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
589

1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
081

1 2 3 4 5
7

1 2 3 4 5
8
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0870

1 2 3 4 5
8
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
088

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
089

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
610

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
089

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
612

 

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0800

1 2 3 4 5
8____55833

_______48____5616

 

1 2 3 4 5
8____5618

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0811


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
455

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
456

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
457

 

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 
1 2 3 4 5
00


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
588

Java





# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0899


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5205

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
01 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6102

1 2 3 4 5
7

_______48____55831

1 2 3 4 5
8____55832

1 2 3 4 5
8____55833

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
08 
1 2 3 4 5
1 
1 2 3 4 5
2
1 2 3 4 5
1 
1 2 3 4 5
4
1 2 3 4 5
1 
1 2 3 4 5
6

1 2 3 4 5
8
1 2 3 4 5
7


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
23

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
24 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
25

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
27


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
7


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6130


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0840


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
41____324

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
457


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6130


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0845


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____70847


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
48

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
24

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6149

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
52


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6154

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
61


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
62

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0857


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6130


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____56161____326

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
71


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6130


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
587

1 2 3 4 5
8____5588

1 2 3 4 5
8

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
89 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
08 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
91 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6175

1 2 3 4 5
8
1 2 3 4 5
7


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
97

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
26

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
00

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
00

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
04

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
06

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
12

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
99
1 2 3 4 5
12
1 2 3 4 5
15


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 
1 2 3 4 5
18


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5616


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4505


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5618


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4512

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
24____54514


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4515

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4516______5456
1 2 3 4 5
33

1 2 3 4 5
8____5588


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
588

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4522

Python3


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]


C#





# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4523


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5205


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
58 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5207

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
01 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4528

1 2 3 4 5
8

_______48____55212

_______48____55214

_______48____55216

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
08 
1 2 3 4 5
1 
1 2 3 4 5
2
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5222
1 2 3 4 5
1 
1 2 3 4 5
6

1 2 3 4 5
8
1 2 3 4 5
7


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
7

1 2 3 4 5
8


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____54555


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____54557


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 
1 2 3 4 5
5

1 2 3 4 5
8


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0845


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____54565


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____54567


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
464


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
467


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
62

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0857

1 2 3 4 5
8


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____54580

1 2 3 4 5
8


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
587

1 2 3 4 5
8____5588

1 2 3 4 5
8

1 2 3 4 5
8

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
89 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
08 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
91 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5801

1 2 3 4 5
8
1 2 3 4 5
7


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4597


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4598____54599


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5809


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5616

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5618


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
462
1 2 3 4 5
1 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
453

_______5468____55821____5456

1 2 3 4 5
33

1 2 3 4 5
8____5588


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
588

 

1 2 3 4 5
020

Javascript





# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5828

1 2 3 4 5
022


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5205

 

_______48____55831

1 2 3 4 5
8____55832

1 2 3 4 5
8____55833

1 2 3 4 5
8____55834 
1 2 3 4 5
032


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
4


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
7

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0840


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55848 
1 2 3 4 5
5

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0845


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____70847


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 
1 2 3 4 5
050


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
468

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
3 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
467


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
62

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0857

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____54580

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
6 

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
587

1 2 3 4 5
8____5588

 

1 2 3 4 5
8


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55848 
1 2 3 4 5
066


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____55848 
1 2 3 4 5
18

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5616

 


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5____5618


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
5

# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
461 
1 2 3 4 5
076

_______5468____4078____5456

1 2 3 4 5
33

 

1 2 3 4 5
081


# Python3 program to remove
# duplicate elements

# This function returns new 
# size of modified array
def removeDuplicates[arr, n]:
    if n == 0 or n == 1:
        return n

    # To store index of next
    # unique element
    j = 0

    # Doing same as done
    # in Method 1 Just
    # maintaining another 
    # updated index i.e. j
    for i in range[0, n-1]:
        if arr[i] != arr[i+1]:
            arr[j] = arr[i]
            j += 1

    arr[j] = arr[n-1]
    j += 1
    return j

# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]

# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]

# Print updated array
for i in range[0, n]:
    print ["%d"%[arr[i]], end = " "]
0817

Đầu ra

1 2 3 4 5

Độ phức tạp về thời gian. O[n] 
Không gian phụ. Ô[1]

Bài viết này được đóng góp bởi Sahil Chhabra. Nếu bạn thích GeeksforGeeks và muốn đóng góp, bạn cũng có thể viết một bài báo bằng cách sử dụng write. chuyên viên máy tính. org hoặc gửi bài viết của bạn tới review-team@geeksforgeeks. tổ chức. Xem bài viết của bạn xuất hiện trên trang chính của GeeksforGeeks và trợ giúp các Geeks khác.  

Bài Viết Liên Quan

Python vs js cho phụ trợ
Xe future mới nhất 2023
Lập trình với JavaScript Meta Coursera
XOR trong danh sách Python
Là trang blog wordpress
Nhập html Excel
Viết javascript để tìm số bát phân nhị phân và số thập lục phân của số thập phân đã cho
Có bất kỳ thay đổi nào đối với Subaru Crosstrek 2023 không?
Php lấy ngày trong tháng từ ngày
Tài liệu tham khảo mdn css
Triệu lệ dĩnh bao nhiêu tuổi
Webview đánh giájavascript
Thực hành thao tác dữ liệu Python
Các tệp php được lưu trữ trong mac ở đâu?
Giai đoạn của Tour 2023 ngày
Cài đặt WordPress trên Windows Server 2022
Cắt ngắn ngày python
Làm cách nào để bạn tự động chèn ngắt dòng trong trang tính google?
Kết xuất json định dạng python
2023 Kia Forte problems

Toplist mới

#1
Top 9 review kem chống nắng cho bà bầu 2023
7 tháng trước
#2
Top 5 tiếng anh lớp 2 unit 7 trang 46 2023
7 tháng trước
#3
Top 10 tải: mẫu the nhân viên trên excel 2023
7 tháng trước
#4
Top 7 tuyển dụng nhân viên chốt đơn tại nhà 2023
7 tháng trước
#5
Top 7 mẫu nhà 2 tầng chữ l 100m2 mái bằng 2023
7 tháng trước
#6
Top 4 truyện ngắn về quê hương lớp 2 2023
7 tháng trước
#7
Top 6 sơ đồ bộ máy nhà nước thời hồ 2023
7 tháng trước
#8
Top 8 trước việc nhật đảo chính pháp, đảng ta có chủ trương gì mới 2023
7 tháng trước
#9
Top 7 dân số đông đã đem đến cho nước ta 2023
7 tháng trước

Bài mới nhất

Castlevania lords of shadow 2 việt hóa fshare năm 2024
Đặt bàn thờ ông táo như thế nào năm 2024
Cach fix lỗi ko vào trân dc lol năm 2024
Bài tập tiếng anh lưu hoằng trí lớp 8 violet năm 2024
Bị lỗi không thành hoa trong word 2023 năm 2024
Nên dùng biện pháp tránh thai nào sau sinh năm 2024
Lỗi không đang nhập được đồng bộ hóa coccoc năm 2024
Tìm lỗi sai eggs are taken to the mảket fridays năm 2024
Bột diệp lục unicity được sản xuất như thế nào năm 2024
Giải bài tập vật lý 8 bài 21 năm 2024

Chủ Đề

Toplist programming Địa Điểm Hay Hỏi Đáp Là gì Mẹo Hay Nghĩa của từ Học Tốt Công Nghệ mẹo hay Khỏe Đẹp bao nhiêu Top List Bao nhiêu Sản phẩm tốt Bài Tập Xây Đựng Ngôn ngữ đánh giá Tiếng anh Bài tập So Sánh Ở đâu So sánh Hướng dẫn Dịch bao nhieu Tại sao Đại học hướng dẫn Thế nào Máy tính Vì sao Bao lâu Khoa Học Hà Nội