Проекти за наставничество, 10 – 15 май 2024


Група №3, 2024

Група №4, 2024

Група №6, 2024

Тренировка за 13 май

Тренировка за 10 май

Видео за работа със свързан списък


public static void main(String[] args) {
LinkedList ll=new LinkedList();
Scanner s=new Scanner(System.in);
Integer n=s.nextInt();
Integer a;
for(Integer i=0;i<n;i++){
a=s.nextInt();
ll.addLast(a);
}
for(Integer j=0;j<ll.size();j++){
System.out.println(ll.get(j));
}
}

Задачата от HackerRank

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

static class SinglyLinkedListNode {
    public int data;
    public SinglyLinkedListNode next;

    public SinglyLinkedListNode(int nodeData) {
        this.data = nodeData;
        this.next = null;
    }
}

static class SinglyLinkedList {
    public SinglyLinkedListNode head;
    public SinglyLinkedListNode tail;

    public SinglyLinkedList() {
        this.head = null;
        this.tail = null;
    }

    public void insertNode(int nodeData) {
        SinglyLinkedListNode node = new SinglyLinkedListNode(nodeData);

        if (this.head == null) {
            this.head = node;
        } else {
            this.tail.next = node;
        }

        this.tail = node;
    }
}

// Complete the printLinkedList function below.

/*
 * For your reference:
 *
 * SinglyLinkedListNode {
 *     int data;
 *     SinglyLinkedListNode next;
 * }
 *
 */
static void printLinkedList(SinglyLinkedListNode head) {
     SinglyLinkedListNode current = head;
for(;current != null; current = current.next) {
    System.out.println(current.data);


}
}

private static final Scanner scanner = new Scanner(System.in);

public static void main(String[] args) {
    SinglyLinkedList llist = new SinglyLinkedList();

    int llistCount = scanner.nextInt();
    scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

    for (int i = 0; i &lt; llistCount; i++) {
        int llistItem = scanner.nextInt();
        scanner.skip(&quot;(\r\n|[\n\r\u2028\u2029\u0085])?&quot;);

        llist.insertNode(llistItem);
    }

    printLinkedList(llist.head);

    scanner.close();
}

}

Работа по екипи
пъзел

Заключителни въпроси в първи клас

https://zelenkroki.wordpress.com/wp-admin/post.php?post=15097&action=edit&classic-editor

Вашият коментар