hackerrank linked list exercises
This commit is contained in:
anebz
parent
ec0cd86102
commit
c3eaabb920
|
|
@ -0,0 +1,113 @@
|
|||
import java.io.*;
|
||||
import java.math.*;
|
||||
import java.text.*;
|
||||
import java.util.*;
|
||||
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;
|
||||
}
|
||||
}
|
||||
|
||||
public static void printSinglyLinkedList(SinglyLinkedListNode node, String sep, BufferedWriter bufferedWriter)
|
||||
throws IOException {
|
||||
while (node != null) {
|
||||
bufferedWriter.write(String.valueOf(node.data));
|
||||
|
||||
node = node.next;
|
||||
|
||||
if (node != null) {
|
||||
bufferedWriter.write(sep);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Complete the compareLists function below.
|
||||
|
||||
/*
|
||||
* For your reference:
|
||||
*
|
||||
* SinglyLinkedListNode { int data; SinglyLinkedListNode next; }
|
||||
*
|
||||
*/
|
||||
static boolean compareLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {
|
||||
while (head1 != null && head2 != null && head1.data == head2.data) {
|
||||
head1 = head1.next;
|
||||
head2 = head2.next;
|
||||
}
|
||||
return head1 == head2;
|
||||
}
|
||||
|
||||
private static final Scanner scanner = new Scanner(System.in);
|
||||
|
||||
public static void main(String[] args) throws IOException {
|
||||
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
|
||||
|
||||
int tests = scanner.nextInt();
|
||||
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
|
||||
|
||||
for (int testsItr = 0; testsItr < tests; testsItr++) {
|
||||
SinglyLinkedList llist1 = new SinglyLinkedList();
|
||||
|
||||
int llist1Count = scanner.nextInt();
|
||||
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
|
||||
|
||||
for (int i = 0; i < llist1Count; i++) {
|
||||
int llist1Item = scanner.nextInt();
|
||||
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
|
||||
|
||||
llist1.insertNode(llist1Item);
|
||||
}
|
||||
|
||||
SinglyLinkedList llist2 = new SinglyLinkedList();
|
||||
|
||||
int llist2Count = scanner.nextInt();
|
||||
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
|
||||
|
||||
for (int i = 0; i < llist2Count; i++) {
|
||||
int llist2Item = scanner.nextInt();
|
||||
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
|
||||
|
||||
llist2.insertNode(llist2Item);
|
||||
}
|
||||
|
||||
boolean result = compareLists(llist1.head, llist2.head);
|
||||
|
||||
bufferedWriter.write(String.valueOf(result ? 1 : 0));
|
||||
bufferedWriter.newLine();
|
||||
}
|
||||
|
||||
bufferedWriter.close();
|
||||
|
||||
scanner.close();
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,112 @@
|
|||
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;
|
||||
}
|
||||
}
|
||||
|
||||
public static void printSinglyLinkedList(SinglyLinkedListNode node, String sep) {
|
||||
while (node != null) {
|
||||
System.out.print(node.data);
|
||||
|
||||
node = node.next;
|
||||
|
||||
if (node != null) {
|
||||
System.out.print(sep);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Complete the reversePrint function below.
|
||||
|
||||
/*
|
||||
* For your reference:
|
||||
*
|
||||
* SinglyLinkedListNode { int data; SinglyLinkedListNode next; }
|
||||
*
|
||||
*/
|
||||
static void reversePrint(SinglyLinkedListNode head) {
|
||||
SinglyLinkedListNode tail = null;
|
||||
while (head != null) {
|
||||
SinglyLinkedListNode next = head.next;
|
||||
head.next = tail;
|
||||
tail = head;
|
||||
head = next;
|
||||
}
|
||||
|
||||
while (tail != null) {
|
||||
System.out.println(tail.data);
|
||||
tail = tail.next;
|
||||
}
|
||||
|
||||
// Recursive option
|
||||
/*
|
||||
if (head == null) {
|
||||
return;
|
||||
}
|
||||
reversePrint(head.next);
|
||||
System.out.println(head.data);
|
||||
*/
|
||||
|
||||
}
|
||||
|
||||
private static final Scanner scanner = new Scanner(System.in);
|
||||
|
||||
public static void main(String[] args) {
|
||||
int tests = scanner.nextInt();
|
||||
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
|
||||
|
||||
for (int testsItr = 0; testsItr < tests; testsItr++) {
|
||||
SinglyLinkedList llist = new SinglyLinkedList();
|
||||
|
||||
int llistCount = scanner.nextInt();
|
||||
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
|
||||
|
||||
for (int i = 0; i < llistCount; i++) {
|
||||
int llistItem = scanner.nextInt();
|
||||
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
|
||||
|
||||
llist.insertNode(llistItem);
|
||||
}
|
||||
|
||||
reversePrint(llist.head);
|
||||
}
|
||||
|
||||
scanner.close();
|
||||
}
|
||||
}
|
||||
Loading…
Reference in New Issue