package dataStructures;
import [Link];
import [Link];
import [Link].*;
import utilities.*;
import [Link];
public class MyArrayLinearList extends ArrayLinearList {
@Override
public boolean contains(Object currentElement) {
for (int i = 0; i < size; i++) {
if ([Link](get(i))) {
return true;
}
}
return false;
}
public MyArrayLinearList unique() {
MyArrayLinearList uniqueList = new MyArrayLinearList();
for (int i = 0; i < size; i++) {
Object currentElement = get(i);
// Check if the element is not already in the uniqueList
if () {
[Link](i, currentElement);
}
}
return uniqueList;
}
public void reverse() {
int left = 0;
int right = size - 1;
while (left < right) {
// Swap the elements at the left and right indices
Object temp = element[left];
element[left] = element[right];
element[right] = temp;
// Move the indices towards the center
left++;
right--;
}
}
public Object max() {
Object maxElement = null;
for (int i = 0; i < size; i++) {
Object currentElement = get(i);
if (currentElement instanceof Integer) {
Integer currentInteger = (Integer) currentElement;
if (maxElement == null || currentInteger > (Integer) maxElement)
{
maxElement = currentInteger;
}
}
}
return maxElement;
}
public Object min() {
Object minElement = null;
for (int i = 0; i < size; i++) {
Object currentElement = get(i);
if (currentElement instanceof Integer) {
Integer currentInteger = (Integer) currentElement;
if (minElement == null || currentInteger < (Integer) minElement)
{
minElement = currentInteger;
}
}
}
return minElement;
}
public int sum() {
int sum = 0;
for (int i = 0; i < size; i++) {
Object currentElement = get(i);
if (currentElement instanceof Integer) {
int currentInteger = (Integer) currentElement;
[Link]("Элемент: " + currentInteger);
sum += currentInteger;
}
}
return sum;
}
public double average() {
return 1.0*sum()/size();
}
public void sort() {
[Link](element, 0, size);
}
public void display() {
for (int i = 0; i < size; i++) {
[Link](element[i] + " ");
}
[Link]();
}
public static void main(String arg[]) {
Scanner scanner = new Scanner([Link]);
MyArrayLinearList x= new MyArrayLinearList();
[Link](0, new Integer(2));
[Link](1, new Integer(6));
[Link](2, new Integer(1));
[Link](3, new Integer(4));
[Link](4,new Integer(6));
while (true) {
[Link](x);
[Link]("Дараах үйлдлүүдээс сонгоно уу:");
[Link]("1. Max утгыг олох");
[Link]("2. Min утгыг олох");
[Link]("3. Нийлбэр олох");
[Link]("4. Дундаж утгыг олох");
[Link]("5. Сортлогч");
[Link]("6. Unique - Давхардсан утгыг устгах");
[Link]("7. Reverse");
[Link]("8. Гарлаа.");
[Link]("Сонголт: ");
int choice = [Link]();
switch (choice) {
case 1:
[Link]("Max утга: " + [Link]());
break;
case 2:
[Link]("Min утга: " + [Link]());
break;
case 3:
[Link]("Нийлбэр: " + [Link]());
break;
case 4:
[Link]("Дундаж утга: " + [Link]());
break;
case 5:
[Link]();
[Link]("Жагсаалт сортлогдлоо." );
[Link]();
break;
case 6:
MyArrayLinearList uniqueList = [Link]();
[Link]("Давхардсан утгууд:");
[Link]();
break;
case 7:
[Link]();
[Link]("Жагсаалт эсрэгээрээ эрэмбэлэгдлээ.");
[Link]();
break;
case 8:
[Link]("Гарлаа.");
[Link]();
[Link](0);
default:
[Link]("Та буруу сонголт хийсэн байна. Дахин
оролдоно уу.");
}
}
}
