package ru.job4j.array;
import java.util.Arrays;
/**
* RotateArray.
*
* @author Sergey Indyukov (onl.ont@mail.ru)
* @version $Id$
* @since 0.1
*/
public class ArrayDuplicate {
/**
* Method remove.
* @param array первый аргумент
* @return array
*/
	public int[] remove(String[] array) {
		int c = 0; //переменная счетчик количество повторяемых слов
			for (int i = 0; i < array.length / 2; i++) {
				for (int j = 1; i < array.length; j++) {
					if (array[i] == array[j]) {
						for (int k = 1; k < array.length; k++) {
							array[j + k - 1] = array[j + k];
						}
						c++;
						j--;
					}
				}
			}
		return Arrays.copyOf(array, array.length - c);
	}
}
@@ -486,17 +486,17 @@
 int k = 
-1
+j
 ; k %3C ar
@@ -505,16 +505,20 @@
 y.length
+ - 1
 ; k++) %7B
@@ -535,17 +535,9 @@
 ray%5B
-j + k - 1
+k
 %5D = 
@@ -546,13 +546,13 @@
 ray%5B
-j + k
+k + 1
 %5D;%0A%09
@@ -647,12 +647,59 @@
 h - c);%0A
-
 %09%7D
+ //%7B%22%D0%9F%D1%80%D0%B8%D0%B2%D0%B5%D1%82%22, %22%D0%9C%D0%B8%D1%80%22, %22%D0%9F%D1%80%D0%B8%D0%B2%D0%B5%D1%82%22, %22%D0%A1%D1%83%D0%BF%D0%B5%D1%80%22, %22%D0%9C%D0%B8%D1%80%22%7D;
 %0A%7D

task 225