 Code

package Test_lap1;

import java.util.*;

class Node {
int data;
Node next;

Node(int x) {
data = x;
next = null;
}

Node(int x, Node t) {
data = x;
next = t;
}

public String toString() {

String t = " " + data + " ->";
return t;
}
}

public class MySLL {

Scanner obj = new Scanner(System.in);
Node head;

void addRandomNumber() {
int n;
Random rd = new Random();
System.out.print("Nhap so luong phan tu muon them vao danh sach :
");
n = obj.nextInt();
for (int i = 0; i < n; i++) {
int rdNumber = rd.nextInt(99) + 1;
addLast(rdNumber);
}
}

void addLast(int x) {
Node p = head;
Node t = new Node(x);
if (head == null) {
head = t;
} else {
while (p.next != null) {
p = p.next;
}
p.next = t;
}
}

void sum() {
 Node p = head;
int sum = 0;
while (p != null) {
sum = sum + p.data;
p = p.next;
}
System.out.println("Tong cac phan tu trong danh sach la : " +
sum);

void countOddElements() {
Node p = head;
int count = 0;
while (p != null) {
if (p.data % 2 != 0) {
count++;
}
p = p.next;
}
System.out.println("\nSo phan tu le trong danh sach : " + count);
}

void printLastElement() {
Node p = head;
if (head == null) {
System.out.print("Danh sach rong ");

} else {
while (p != null) {
p = p.next;
}
System.out.println("Gia tri cuoi trong danh sach : " +
p.data);

}
}

void swap() {
if (head == null) {
System.out.println("Danh sach rong.");
return;
}
if (head.next == null) {
System.out.println("\nChi co 1 phan tu trong danh sach khong du
dieu kien.");
return;
}
Node temp = head;
head = head.next;
temp.next = head.next;
head.next = temp;
}

void insert(int x, int k) {

Node p = head;
if (k < 1) {
 System.out.println("\nVi tri chen khong hop le ");
return;
}
if (k == 1) {
Node newNode = new Node(x);
newNode.next = head;
head = newNode;
return;
}
int vt = 1;
while (p != null && vt < k - 1) {
vt++;
p = p.next;
}
if (p == null) {
System.out.println("\nVi tri chen khong hop le ");
} else {
Node t = new Node(x, p.next);
p.next = t;

void deleteElement(int k) {
Node p = head;
if (p == null) {
System.out.println("Danh sach rong khong xoa duoc");

} else {
if (k < 1 && head == null) {
System.out.println("\nVi tri xoa khong hop le hoac
danh sach rong");
} else {
int vt = 1;
while (p != null && vt < k - 1) {
vt++;
p = p.next;
}
p.next = p.next.next;
}
}
}

void print() {
Node p = head;
if (p == null) {
System.out.println("Danh sach rong.");
return;
}
System.out.println("Noi dung danh sach : ");
while (p != null) {
System.out.print(p);
p = p.next;
}
System.out.print("null \n");
}
 public static void main(String[] args) {
MySLL ll = new MySLL();
ll.addRandomNumber();
ll.print();
ll.sum();
ll.countOddElements();
ll.swap();
System.out.println("\nDanh sach sau khi hoan doi vi tri not dau
tien va not thu nhi ");
ll.print();
ll.insert(100, 4);
System.out.println("\nDanh sach sau khi chen ");
ll.print();
ll.deleteElement(3);
System.out.println("\nDanh sach sau khi xoa phan tu ");
ll.print();
}

 Result