Scribd
Upload
35 views3 pages

Java FD - Lists

The document provides an overview of Java List operations and methods. It discusses how Lists can be initialized and elements added, removed, accessed, and sorted. It also describes common List methods like size(), add(), remove(), get(), and contains() and how they work. The document compares Lists to arrays and highlights some key differences in how elements are accessed and manipulated in each.

Uploaded by

Bernal Familia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
35 views3 pages

Java FD - Lists

The document provides an overview of Java List operations and methods. It discusses how Lists can be initialized and elements added, removed, accessed, and sorted. It also describes common List methods like size(), add(), remove(), get(), and contains() and how they work. The document compares Lists to arrays and highlights some key differences in how elements are accessed and manipulated in each.

Uploaded by

Bernal Familia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

LISTS<ELEMENT> - OVERVIEW

List<String> names = new ArrayList<>(); // <String> - moje da e Integer,Double..

[Link]("Kriss");
[Link]("George");
[Link]("Putin");
[Link]…

[Link](names); // [Kriss, George, Putin]

na Array se izchislqva duljinata primerno [Link] a na List e [Link]()

na Array za da vzemesh element/index e primerno names[i, 1, 0..] a na Lists e


[Link](I, 0, 1..) no get() samo vzima stoinosta a set() q zadava..

primerno ako iskame na index 0 da zadadem stoinost shte e taka:

Lists – [Link](0, “Shumi”);

Arrays – names[0] = “Shumi”;

Ne promenqme vida na lista samo elementa mu

Lista raboti po burzo ot masiva zashtoto zadelq predvaritelno dvoino poveche


mqsto za rabota !! 

List<Integer> numbers = new ArrayList<>();

[Link](20);
[Link](30);
[Link](100);
[Link](30);
[Link](30);

[Link](numbers); // [20, 30, 100, 30, 30]

[Link]([Link](30));

[Link](numbers); // [20, 100, 30, 30]

[Link] – triene po stoinost moje I [Link] I etc… no tova iztriva


purvoto chislo ot nachaloto 0 dokuto stigne chisloto I trie samo nego ne
vsichkite chisla koito sa 30 primerno a purvoto DO KOETO STIGNE 
get opciqta moje da se polzva taka:
List<Integer> numbers = new ArrayList<>();

[Link](20);
[Link](30);
[Link](100);

int firstNumber = [Link](0); // 20

Drugi operacii

Provides operations to add / insert / remove / find elements:

size() – number of elements in the List<E>

add(element) – adds an element to the List<E>

add(index, element) – inserts an element to given position

remove(element) – removes an element (returns true / false)

remove(index) – removes element at index

contains(element) – determines whether an element is in the list

set(index, item) – replaces the element at the given index

Sort method for lists..


[Link](name);

Sortira po red ot 1…10 ili po azbuka ot a…z

A za da gi oburnem v obraten red s posledovatelnost purvo:

[Link](name);

[Link](name);
[Link]() e komanda koqto moje da izpolzva primerno v while loop I
dokuto ne iztrie vsichki takiva chisla ne spira kakto na primera

while ([Link]([Link](input[1]))) {
[Link]([Link](input[1]));
}

[Link]…masiv

Shitty way to swap strings in list bez da znaesh poziciite

if (powers[0].equals("Swap")) {

String temp = powers[1];


String tempTwo = powers[2];

int position = 0;
int positionTwo = 0;
for (int i = 0; i < [Link](); i++) {

if ([Link](i).equals(temp)) {
position = i; // namirash poziciite kudeto se namirat
}
if ([Link](i).equals(tempTwo)) {
positionTwo = i; // namirash poziciite kudeto se namirat

}
}

[Link](positionTwo, powers[1]); // I sled tva gi obrustash/swap


[Link](position, powers[2]);
}

You might also like