//Thử thứ này đi...
$array = array[2,3,2,[1],3,2,[0],3,2,0,11,7,9,[2]];
$array_u = array_unique[$array];
sort[$array_u];
print_r[$array_u];
Đầu ra mẫu
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Viết một chương trình PHP để loại bỏ các bản sao khỏi danh sách được sắp xếp. Đầu vào: [1,1,2,2,3,4,5,5] Đầu ra: [1,2,3,4,5] Giải pháp mẫu: -- Mã PHP: Đầu ra mẫu: Sơ đồ:
Trình chỉnh sửa mã PHP: Có một cách khác để giải quyết giải pháp này? Đóng góp mã của bạn [và nhận xét] thông qua Disqus. Trước đây: Viết chương trình PHP để kiểm tra xem các bit của hai vị trí đã cho của một số có giống nhau hay không. Write a PHP program to check if the bits of the two given positions of a
number are same or not.PHP: Tập thể dục-35 với giải pháp
Output: [1,2,3,4,5]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
Next: Write a PHP program to test if a given string occurs at the end of another given string.
Mức độ khó của bài tập này là gì?
Kiểm tra kỹ năng lập trình của bạn với bài kiểm tra của W3Resource.
PHP: Lời khuyên trong ngày
PHP: Làm thế nào để ghi vào bảng điều khiển trong PHP?
Firefox
Trên Firefox, bạn có thể sử dụng một tiện ích mở rộng có tên FIREPHP cho phép ghi nhật ký và bỏ thông tin từ các ứng dụng PHP của bạn vào bảng điều khiển. Đây là một addon cho phần mở rộng phát triển web tuyệt vời Firebug.
- //www.studytrails.com/blog/using-firephp-in-firefox-to-debug-php/
Trình duyệt Chrome
Tuy nhiên, nếu bạn đang sử dụng Chrome, có một công cụ gỡ lỗi PHP có tên Chrome Logger hoặc Webug [Webug có vấn đề với thứ tự nhật ký].
Gần đây, Clockwork đang phát triển tích cực, mở rộng các công cụ nhà phát triển bằng cách thêm một bảng điều khiển mới để cung cấp thông tin gỡ lỗi và định hình hữu ích. Nó cung cấp từ hỗ trợ hộp cho Laravel 4 và Slim 2 và hỗ trợ có thể được thêm vào thông qua API mở rộng của nó.
Sử dụng XDebug
Một cách tốt hơn để gỡ lỗi PHP của bạn sẽ là thông qua XDebug. Hầu hết các trình duyệt cung cấp các tiện ích mở rộng trợ giúp để giúp bạn vượt qua chuỗi cookie/truy vấn cần thiết để khởi tạo quá trình gỡ lỗi.
- Chrome - Người trợ giúp Xdebug
- Firefox - xdebug dễ nhất
- Opera - Xdebug
- Safari - Xdebug Toggler
Tham khảo: //bit.ly/3ck9rfg
- Bài tập: Top 16 chủ đề phổ biến nhất hàng tuần
- Bài tập SQL, Thực hành, Giải pháp - Tham gia
- Bài tập SQL, Thực hành, Giải pháp - Quan sát phụ
- JavaScript Basic - Bài tập, Thực hành, Giải pháp
- Java Array: Bài tập, Thực hành, Giải pháp
- C Bài tập lập trình, Thực hành, Giải pháp: Tuyên bố có điều kiện
- Cơ sở dữ liệu nhân sự - Sắp xếp bộ lọc: Bài tập, Thực hành, Giải pháp
- C Bài tập lập trình, Thực hành, Giải pháp: Chuỗi
- Các loại dữ liệu Python: Từ điển - Bài tập, Thực hành, Giải pháp
- Câu đố lập trình Python - Bài tập, Thực hành, Giải pháp
- Mảng C ++: Bài tập, Thực hành, Giải pháp
- Báo cáo và vòng lặp có điều kiện JavaScript - Bài tập, Thực hành, Giải pháp
- Thuật toán cơ bản C# Sharp: Bài tập, Thực hành, Giải pháp
- Python Lambda - Bài tập, Thực hành, Giải pháp
- Python Pandas DataFrame: Bài tập, Thực hành, Giải pháp
- Công cụ chuyển đổi
- JavaScript: HTML Mẫu xác thực
0
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1
0 Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
89Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
67Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 28
69Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
93Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
8 Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 33
69Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
98Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
0
#include 39
69Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
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 = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 51
0
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1
0 Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
89Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
67Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 28
69Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
93Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
8 Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 33
69Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
98Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
0
#include 39
69Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
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 = " "]
Examples:
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 5
7Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
20
55 Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
22
#include 51 [Using extra space]
0
0Array [ [0] => 0 [1] => 1 [2] => 2 [3] => 3 [4] => 7 [5] => 9 [6] => 11 ]#include56
69Array [ [0] => 0 [1] => 1 [2] => 2 [3] => 3 [4] => 7 [5] => 9 [6] => 11 ]
30
31
30__231
30
35
30
37
30
37____230____
37____- Mảng đầu vào Traverse và một lần sao chép các phần tử duy nhất của ARR [] thành TEMP []. Cũng theo dõi số lượng của các yếu tố độc đáo. Hãy để số này là j.j.
- Sao chép các phần tử J từ temp [] sang mảng [] và trả lại jj elements from temp[] to arr[] and return j
C++
#include
using namespace std;
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
3
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
6Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
8Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 50Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 55
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 57Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 0#include 1#include 2#include 1#include 4Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 6Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using1
using3using4using5Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using8
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# 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
namespace0
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
3
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
6Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
8Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 50Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 55
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 57Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 0#include 1#include 2#include 1#include 4Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 6Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using1
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using8
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# 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
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Java
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
Các
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using5Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
8
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 57Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 6
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
using4
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Python3
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using5Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0229303Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
05
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
08
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
10Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
11Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
13Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
15
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
17Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
11
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
15
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
26Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
03Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
29Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
11
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
42
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
44
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
46Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
49Các
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
73Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
74
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
77C#
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
82Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
84 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
86Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
87Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
88
using4Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
93Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
95Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 514Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
3Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 528Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
8
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 532
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 55Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 57
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 549Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 554
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 557
#include 6
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using1Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 566using4
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
JavaScript
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 572Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 573 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
77Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 578
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583 Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 584Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 586Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583 Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 594
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 528Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
8Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 532Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 57Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 6Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
using4
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Độ phức tạp về thời gian: O [n] & nbsp; không gian phụ trợ: O [n]
Auxiliary Space : O[n]
Phương pháp 2: [không gian thêm không gian] [Constant extra space]
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.
Implementation:
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 = " "]
using namespace std;
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 578
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583 Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 584Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 586Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 528Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[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 = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 583
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 6Độ phức tạp về thời gian: O [n] & nbsp; không gian phụ trợ: O [n]
using3using4using5Phương pháp 2: [không gian thêm không gian]
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.
using namespace std;
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 0#include 1#include 2#include 1#include 4Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using8Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Java
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
#include 6Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
#include 87#include 88using4
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
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.
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#
using namespace std;
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
3Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
using28Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using8Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 549Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 554using44using45
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 557
#include 6
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using1Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 566using4
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
JavaScript
Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 572Input : arr[] = {2, 2, 2, 2, 2}
Output : arr[] = {2}
new size = 1
Input : arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5}
Output : arr[] = {1, 2, 3, 4, 5}
new size = 573 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
77Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
0 Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
1Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
using28Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
using8Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Java
#include 6Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
# Python3 program to remove
# duplicate elements
# This function returns new
# size of modified array
def removeDuplicates[arr, n]:
if n == 0 or n == 1:
return n
# To store index of next
# unique element
j = 0
# Doing same as done
# in Method 1 Just
# maintaining another
# updated index i.e. j
for i in range[0, n-1]:
if arr[i] != arr[i+1]:
arr[j] = arr[i]
j += 1
arr[j] = arr[n-1]
j += 1
return j
# Driver code
arr = [1, 2, 2, 3, 4, 4, 4, 5, 5]
n = len[arr]
# removeDuplicates[] returns
# new size of array.
n = removeDuplicates[arr, n]
# Print updated array
for i in range[0, n]:
print [" %d "%[arr[i]], end = " "]
Array
[
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
]
7namespace03using4
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
0
8 Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
66Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
67 Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
68Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
69Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
70Array
[
[0] => 0
[1] => 1
[2] => 2
[3] => 3
[4] => 7
[5] => 9
[6] => 11
]
Auxiliary Space : O[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 viết bằng Write.GeekSforGeek.org hoặc gửi bài viết của bạn.Xem bài viết của bạn xuất hiện trên trang chính của GeekSforGeek và giúp các chuyên viên máy tính khác. & NBSP;Sahil Chhabra. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to . See your article appearing on the GeeksforGeeks main page and help other Geeks.