[英]How to create a linked list in java without importing linked lists
i am a CS student in college and i am having trouble with this project where i am supoosed to create a linked list using nodes without importing linked lists, as well as doing a some methods with the list.我是一名大学计算机科学专业的学生,我在这个项目中遇到了麻烦,我想在不导入链表的情况下使用节点创建一个链表,以及对列表执行一些方法。 i am a beginner when it comes to coding, so assume i know nothing, because that is probably the case lol.
在编码方面我是初学者,所以假设我什么都不知道,因为可能就是这种情况哈哈。
import java.io.*;
import java.lang.*;
public class List {
public int listCount = 0;
public char[] linkedList;
public List() throws FileNotFoundException {
}
public List(char[] array) throws FileNotFoundException {
if (array.length == 1) {
Node head = new Node(array[0]);
} else if (array.length > 1) {
Node head = new Node(array[0]);
Node traverse = head;
for (int i = 1; i < array.length; i++) {
while (traverse.nextNode != null) {
traverse = traverse.nextNode;
}
traverse.nextNode = new Node(array[i]);
listCount++;
}
}
}
public List(String w) throws FileNotFoundException {
char[] array2 = new char[w.length()];
for (int i = 0; i < w.length(); i++) {
array2[i] = w.charAt(i);
}
List str = new List(array2);
}
/* Find the character at a index
@param int index
return the character at the chosen index
*/
public char charAt(int index) throws IndexOutOfBoundsException {
char results = linkedList[0];
if (index < linkedList.length && index >= 0) {
results = linkedList[index];
}
return results;
}
public String concat(int index1, int index2) {
return null;
}
/* Determine if the list is empty
return whether the given conditions are true or false
*/
public boolean isEmpty() {
for (int i = 0; i < linkedList.length; i++) {
if (!linkedList.equals(null)) {
System.out.println("This list is not empty");
return false;
}
}
System.out.println("List is empty");
return true;
}
/* Determine the size of the list
return the size of the list
*/
public int size() {
return listCount;
}
/* Create a new String between 2 index's including the start and end index
@param beginIndex is the starting point of the new String
@endIndex is the ending point of new String
return the new String
*/
public String subString(int beginIndex, int endIndex) {
return null;
}
public void insert(Object x) throws IndexOutOfBoundsException {
if (listCount > 100 || listCount < 0) {
throw new IndexOutOfBoundsException("Bag is too large");
} else {
this.linkedList[listCount] = (char) x;
listCount++;
}
}
}
i appreciate any help or pointers ahead of time.我提前感谢任何帮助或指示。 we are using a separate node, helper, and driver class as well as a.txt file to assign into my list.
我们正在使用单独的节点、帮助程序和驱动程序 class 以及一个 .txt 文件分配到我的列表中。 i am stuck on the concat and substring methods too, but i want to make sure i am getting the framework correct first.
我也坚持使用 concat 和 substring 方法,但我想确保我首先得到正确的框架。 thank you again.
再次感谢你。
If i understand your question correctly, you are asking how to access a specific type without importing it.如果我正确理解您的问题,您是在询问如何在不导入特定类型的情况下访问它。
Imports are required to identify which type is referenced when it is used by its simple name.当使用其简单名称时,需要导入来识别引用的类型。 To reference a type without declaring it in the imports you need to use its fully qualified name.
要引用一个类型而不在导入中声明它,您需要使用它的完全限定名称。 For instance
例如
java.util.List<String> someList = new java.util.ArrayList<>();
works without importing List and ArrayList because by declaring the package the class is in it is clear which class is being referenced.无需导入 List 和 ArrayList 即可工作,因为通过声明 package class 很明显哪个 ZA2F2ED4F8EBC2CBB61DZC 被引用。
I'll try to do the code later, but here is a book that i found that may help you.稍后我会尝试编写代码,但这是我发现的一本书可能对您有所帮助。
https://cin.ufpe.br/~grm/downloads/Data_Structures_and_Algorithms_in_Java.pdf I bought a book about DATA STRUCTURE from Pearson company, and it's really a good book, but i don't remember much, it's something like this, that i did in a hurry:
https://cin.ufpe.br/~grm/downloads/Data_Structures_and_Algorithms_in_Java.pdf我从 Pearson 公司买了一本关于 DATA STRUCTURE 的书,它确实是一本好书,但我不记得了我匆忙做了:
public class List {
private Node head = null;
private Node foot = null;
private Node newNode = null;
private Node auxNode = null;
public List() {
this.head = new Node();
this.foot = new Node();
}
public class Node {
private int adress;
private Node nextNode;
}
public void add(int value) {
this.newNode = new Node();
newNode.adress = value;
if (head == null) {
// Head of the list receive the values of the NEW NODE, so the head of the list
// is not null enymore
head = newNode;
head.nextNode = null;
} else {
// In this case Head is not null
/*The auxiliary node will receive the head and the new Node will become the new Head from the list*/
auxNode = new Node();
auxNode = head;
/*
while(auxNode.nextNode != null ) {
}
auxNode = head;
//head of the list is empty, so we can add the new node
head = newNode;//Here the new node is empty because was transfered to the head
head.nextNode = auxNode; //The head of the list receive the old node that used to be the head
if (head.nextNode == null) {
head.nextNode = newNode;
} else if (head.nextNode != null) {
}*/
}
}
}
```
I hope this help you to get some lead
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.