Alphabetizing a linked list, HELP!
To all:
Firstly, I'm not looking for someone to do my assignment for me. I just need a push in the right direction...
I need to create a linked list that contains nodes of a single string (a first name), but that list needs to be alphabetized and that's where I am stuck.
I can use an iterator method that will display a plain-old "make a new node the head" linked list with no problem. But I'm under the impression that an iterator method is also the way to go in alphabetizing this list (that is using an iterative method to determine the correct place to place a new node in the linked list). And I am having zero luck doing that.
The iterator method looks something like this:
// ---- MyList: DisplayList method ----
void DisplayList()
ListNode p;
for (ResetIterator(); (p = Iterate()) != null; )
p.DisplayNode();
// ---- MyList: ResetIterator method ----
void ResetIterator()
current = head;
// ---- MyList: Iterate method ----
ListNode Iterate()
if (current != null)
current = current.next;
return current;
Can I use the same iterator method to both display the final linked list AND alphabetize my linked list or do I need to create a whole new iterator method, one for each?
Please, someone give me a hint where to go with this. I've spent something like 15 hours so far trying to figure this thing out and I'm just stuck.
Thanks so much,
John
[email protected]
I'll try and point you in the right direction without being too explicit as you request.
Is your "linked list" an instance of the Java class java.util.LinkedList or a class of your own?
If it is the Java class, then check out some of the other types of Collections that provide built-in sorting. You should be able to easily convert from your List to another type of Collection and back again to implement the sorting. (hint: you can do this in two lines of code).
If this is your own class and you want to code the sort yourself, implement something simple such as a bubble sort (should be easy to research on the web).
Converting to an array, sorting that and converting back is another option.
Good Luck.
Similar Messages
-
I am writing a program for an assignment that reads a file containing population growth for all the Counties in the U.S. I'm required to use a link list to store the data. They want me to sort the data based on certain criteria. My first problem is that as each new County instance is created, it is to be inserted into this linked list in alphabetical order first by county name.
My understanding of linked lists is that they cannot be randomly accessed like a vector or an array. So is it possible to do this without using a vector or an array? And how would I go about it?
thanks.Can you create a second, sorted linked list?The prof. didn't specify whether or not I can use a second list.
Are you prohibited from using the collections framework (probably, if it is a school assignment!)Not really sure on this one. Again it is not specified in the assignment
(Why would they have you store this data in a linked list??)I their reasoning is to have us learn how to implement linked list because it can grow or shrink when necessary.(Other than that I don't understand the practicality of it either)
Are you using a doubly linked list (forwards and backwards)?The assignment does not specify a certain linked list to use.
Did your prof mention any sort algorithms you might use? He states later in the assignment that I have to generate different growth reports by using MergeSort.
I appreciate your help and comments. Unfortunately my prof. is very vague about the assignment and its implementation in his outline. He just kind of throws us into it hoping that we will figure it out. -
Hi,
I'm developing a circular linked list class.. However everytime I add to the front of the list it overwrites the first element in the list.. I pretty confused at the moment. If anyone could assist me in what I'm doing wrong it would be greatly appreciated..
My Class:
public class CNode<T>
public T nodeValue; //data held by the node
public CNode<T> next; //next node in the list
//default constructor; next references node itself
public CNode()
nodeValue = null;
next = this;
//constructor; initializes nodeValue to item
//and sets the next to reference the node itself
public CNode(T item)
nodeValue = item;
next = this;
}My addFirst:
public static <T> void addFirst(CNode<T> header, T item)
CNode<T> curr;
CNode<T> newNode = new CNode<T>(item);
//header.next = newNode;
//newNode.next = header;
curr = header;
newNode.next = header;
curr.next = newNode;
}You need a Node class and a class that manages the nodes. The class the manages the nodes is typically called something like MyLinkedList. The MyLinkedList class will typically have a member called 'head' or 'first' and another member called 'last', 'end', or 'tail'. Those members will contain references to the first node and the last node respectively.
The methods like add(), remove(), find(), etc. will be members of the MyLinkedList class--not the Node class. The add() method of the MyLinkedList class will create a node, set the value of the node, and then set the next member to refer to the proper node or null if the node is added to the end of the list. Therefore, there is really no need for a default constructor in the node class. The MyLinkedList class will always set the value of the node, and then set it's next member to refer to something.
You might want to try to write a linear linked list first, and get that working, and then modify it to make it a circular linked list. In addition, you should be drawing pictures of nodes with arrows connecting the different nodes to understand what's going on. Whenver the next member of a node refers to another node, draw an arrow starting at the next member and ending at the node it refers to. The pictures will be especially helpful when you write functions like add().
Message was edited by:
7stud -
Hey,
I am having trouble understanding the Linked List implementation code given under the Node Operations part of this pdf.
http://www.cs.berkeley.edu/~jrs/61b/lec/07.pdf
public ListNode(int item, ListNode next) {
this.item = item;
this.next = next;
public ListNode(int item) {
this(item, null);
ListNode l1 = new ListNode(7, new ListNode(0, new ListNode(6)));
I understand the earlier implementation, but this one has me confused. Would someone please go through/explain the flow of this implementation with me?
ThanksWell the code is pretty self explanitory.
a ListNode class that has two fields. an int field item, and a ListNode field next.
so when you create a ListNode object you can do so by one of two means passing one parameter or passing two parameters.
if you pass one parameter then you have a ListNode which has an int say 1 and a ListNode object who's value is null.
if you pass two parameters then you have a ListNode which has an int say 2 and a ListNode object who's value is the ListNode you pass to it.
ex ListNode myNode = ListNode(1,new ListNode(2));
so myNode now has an integer 1 and a reference to another ListNode which has an integer value of 2 and a reference to a null ListNode.
hope this helps. -
Hi,
I have an assignment on linked lists, as a beginner I am really struggling with it for hours...
I have to write the following methods without importing any libraries.
"Write an iterative method delete() for LinkedStackOfStrings that takes an integer parameter k and deletes the kth element (assuming it exists).
Write a method find() that takes an instance of LinkedStackOfStrings and a string key as arguments and returns true if some node in the list has key as its item field, false otherwise."
It must be implemented in the code on this site:
[http://www.cs.princeton.edu/introcs/43stack/LinkedStackOfStrings.java.html]
Help would be appreciated! I have been trying for hours :(vdL wrote:
Thanks for the reply! Yes, I forgot add what my actual problem is.
If I am correct, I will need to be able to traverse through the list up to a certain point, redirect and redirect the pointers.
My problem is I am able to traverse through the list using 'for(Node x = first; x != null; x= x.next)' but I do not know how make it only run up to a particular position in the list.You can keep an integer counter, increment it each time through the loop, and break out of the loop when the counter is big enough. Example of breaking:
if (n == k) break;
And also, how not to loose the previous Node when traversing trough the list.You're allowed to have multiple references. So you could keep one reference to the current node, and one reference to the one before it.
Or, rather than looping through the list until you find the kth element, loop until you find the (k - 1)th element, then (if it exists) remove the one after it. -
Hi, I am implementing a graph for my Java project and part of the coding requires link list for the edges.
I wrote the code, but I just don't understand why it does not function the way like it is in C++.
Bascilly, I have trouble adding data into a linklist
My codes are as follows:
public int insertLink(String fCity, String tCity, int distance)
int location = find(fCity);
if(location == -1)
return -1;
else
insertNode(new Link(tCity,distance), location);
return 0;
private void insertNode(Link node, int index)
Link head = vertex[index].head;
while(head != null)
head = head.next;
head = node;
This is to add stuff to the list, but for some reason, when i try to display the data, i keep getting null. somehow when
head = node
head = new Link(data, data);
the head points to somwhere else, and not refer to the linklist vertex[index].head anymore...
Here is my code to display my data:
public void printVertex()
for(int i = 0; i < vertex.length; i++)
if(vertex[i] != null)
System.out.print(vertex[i]+" --");
Link node = vertex.head;
while(node != null)
System.out.print(node.toCity+","+node.distance+"--");
node = node.next;
System.out.println();
Am i doing something wrong so my linklist isn't implement correct?
THank you.Hi, the "fix" for head.next != null didn't work
private void insertNode(Link node, int index)
Link head = vertex[index].head;
while(head != null)
head = head.next;
head = node;
System.out.println(head.toCity+","+head.distance);
System.out.println(vertex[index].head.toCity+","+vertex[index].head.distance);
}basiclly. When i do System.out.println(head.toCity+","+head.distance);, it can display data
but System.out.println(vertex[index].head.toCity+","+vertex[index].head.distance);
it throow null's error.
Btw, yes , i know Java have build in Link list, but unfortunately, my professor likes to reinvent the wheel and want us to do everything from scratch...
So any other help will be useful, thank you. -
I am fairly new to Java, and Linked Lists. Can you tell me how I can fix my code? Why does my code print infinite "3" s. That is all I am trying to do is create a linked list and put that linked list into index 2 of the array. In the loop, I am setting up a whole bunch on null Node's, is it even possible to link all these nodes together in that same loop? If something does not make sense, I will try to elaborate. I will eventually impliment an insert method in the Node class, are there any pointers on how to implement it? What are the special cases I need to be looking for when implementing the insert method?
* To change this template, choose Tools | Templates
* and open the template in the editor.
package testlinkedlist;
* @author Ben
public class Main {
* @param args the command line arguments
public static Node l;
public static Node p = new Node();
public static Node Front;
public static void main(String[] args) {
Node[] anArray = new Node[4];
for(int i = 0; i < 4; i++){
anArray[i] = new Node();
l = new Node(i);
l.setLink(l);
anArray[2] = l;
while(anArray[2] != null){
System.out.println(anArray[2].dataInNode());
anArray[2] = anArray[2].next;
}l = new Node(i);
l.setLink(l);The node l is created in line one, in line two a link is created from l to l. In other words here is the presence of your infinite loop which is magnified in the following piece of code:
anArray[2] = l;
while(anArray[2] != null){
System.out.println(anArray[2].dataInNode());
anArray[2] = anArray[2].next;
}Mel -
Linked lists help... how exactly is this a NullPointerException?
So I have a linked list class with variables head and tail both initialized to "null", with variables for size, declare, and traveler (not really relevant to this though). We have to create methods to manipulate said list.
For a test I declared an instance of this linked list:
static SinglyLinkedList list = new SinglyLinkedList();One of the methods we have to create is an append method, here's the code for that:
public void append(Object dataToAdd)
if(head == null & tail == null)
head = new Node(dataToAdd, null);
tail = head;
else
tail.next = new Node(dataToAdd, null);
tail = tail.next;
}Testing it with...
list.append("A");Gives null pointer exceptions at the if statement in the append method as well as at the list.append line. But why? What is exactly pointing to null?Ah... I didn't think of head not being null but tail being null.
I initiated the traveler node in the linked list class to head.
then I added this in between the if and else statements I had:
else if(head != null & tail == null)
while(traveler.next != null)
traveler = traveler.next;
tail = traveler;
tail.next = new Node(dataToAdd, null);
tail = tail.next;
}But it's still giving me the same errors.
Edited by: klawson88 on Feb 12, 2009 12:32 AM -
Need help regarding Linked List
I'm a beginner who just spent ages working on the following code.. but need help on re-implementing the following using a linked list, i.e. no array is allowed for customer records but you still can use arrays for names, address, etc.. Hopefully I've inserted enough comments..
Help very much appreciated!! Thanks! =]
import java.util.Scanner;
import java.io.*;
public class Bank
/* Private variables declared so that the data is only accessible to its own
class, but not to any other class, thus preventing other classes from
referring to the data directly */
private static Customer[] customerList = new Customer[30];
//Array of 30 objects created for storing information of each customer
private static int noOfCustomers;
//Integer used to store number of customers in customerList
public static void main(String[] args)
Scanner sc = new Scanner(System.in);
menu();
public static void menu()
char choice;
String filename;
int custId,counter=0;
double interestRate;
Scanner sc = new Scanner(System.in);
do
//Displaying of Program Menu for user to choose
System.out.println("ABC Bank Customer Management System Menu");
System.out.println("========================================");
System.out.println("(1) Input Data from File");
System.out.println("(2) Display Data");
System.out.println("(3) Output Data to File");
System.out.println("(4) Delete Record");
System.out.println("(5) Update Record");
System.out.println("(Q) Quit");
System.out.println();
System.out.print("Enter your choice: ");
String input = sc.next();
System.out.println();
choice = input.charAt(0);
//switch statement used to assign each 'selection' to its 'operation'
switch(choice)
case '1': int noOfRecords;
System.out.print("Enter file name: ");
sc.nextLine();
filename = sc.nextLine();
System.out.println();
noOfRecords = readFile(filename);
System.out.println(+noOfRecords+" records read.");
break;
case '2': displayRecords();
break;
case '3': writeFile();
break;
case '4': System.out.print("Enter account ID to be deleted: ");
sc.nextLine();
custId = sc.nextInt();
deleteRecord(custId);
break;
case '5': if(counter==0)
System.out.print("Enter current interest rate for saving account: ");
sc.nextLine();
interestRate = sc.nextDouble();
update(interestRate);
counter++;
else
System.out.println("Error: Accounts have been updated for the month.");
break;
}System.out.println();
}while(choice!='Q' && choice!='q');
/* The method readFile() loads the customer list of a Bank from a specified
text file fileName into customerList to be stored as array of Customer
objects in customerList in ascending alphabetical order according to the
customer names */
public static int readFile(String fileName)
int custId,i=0;
String custName,custAddress,custBirthdate,custPhone,custAccType;
double custBalance,curRate;
boolean d;
/* Try block to enclose statements that might throw an exception, followed by
the catch block to handle the exception */
try
Scanner sc = new Scanner(new File(fileName));
while(sc.hasNext())
/* sc.next() gets rid of "Account", "Id" and "=" */
sc.next();sc.next();sc.next();
custId = sc.nextInt();
d=checkDuplicate(custId);
/* checkDuplicate() is a method created to locate duplicating ids in array */
if(d==true)
/* A return value of true indicates duplicating record and the sc.nextLine()
will get rid of all the following lines to read the next customer's record */
sc.nextLine();sc.nextLine();sc.nextLine();
sc.nextLine();sc.nextLine();sc.nextLine();
continue;
/* A return value of false indicates no duplicating record and the following
lines containing the information of that customer's record is being read
in */
if(d==false)
/* sc.next() gets rid of "Name" and "=" and name is changed to upper case*/
sc.next();sc.next();
custName = sc.nextLine().toUpperCase();
/* sc.nextLine get rids of the following lines to read the next customer's
record if length of name is more than 20 characters*/
if(custName.length()>21)
System.out.println("Name of custId "+custId+" is more than 20 characters");
System.out.println();
sc.nextLine();sc.nextLine();sc.nextLine();sc.nextLine();
continue;
/* sc.next() gets rid of "Address" and "=" */
sc.next();sc.next();
custAddress = sc.nextLine();
/* sc.nextLine get rids of the following lines to read the next customer's
record if length of address is more than 80 characters*/
if(custAddress.length()>81)
System.out.println("Address of custId "+custId+" is more than 80 characters");
System.out.println();
sc.nextLine();sc.nextLine();sc.nextLine();sc.nextLine();
continue;
/* sc.next() gets rid of "DOB" and "=" */
sc.next();sc.next();
custBirthdate = sc.nextLine();
/* sc.nextLine get rids of the following lines to read the next customer's
record if length of date of birth is more than 10 characters*/
if(custBirthdate.length()>11)
System.out.println("D.O.B of custId "+custId+" is more than 10 characters");
System.out.println();
sc.nextLine();sc.nextLine();sc.nextLine();sc.nextLine();
continue;
/* sc.next() gets rid of "Phone", "Number" and "=" */
sc.next();sc.next();sc.next();
custPhone = sc.nextLine();
/* sc.nextLine get rids of the following lines to read the next customer's
record if length of phone number is more than 8 characters*/
if(custPhone.length()>9)
System.out.println("Phone no. of custId "+custId+" is more than 8 characters");
System.out.println();
sc.nextLine();sc.nextLine();sc.nextLine();sc.nextLine();
continue;
/* sc.next() gets rid of "Account", "Balance" and "=" */
sc.next();sc.next();sc.next();
custBalance = sc.nextDouble();
/* sc.next() gets rid of "Account", "Type" and "=" */
sc.next();sc.next();sc.next();
custAccType = sc.next();
if(custAccType.equals("Saving"))
customerList[noOfCustomers] = new Account1(custId,custName,custAddress,custBirthdate,custPhone,custBalance,custAccType);
sc.nextLine();
noOfCustomers++;
i++;
else if(custAccType.equals("Checking"))
customerList[noOfCustomers] = new Account2(custId,custName,custAddress,custBirthdate,custPhone,custBalance,custAccType);
sc.nextLine();
noOfCustomers++;
i++;
else if(custAccType.equals("Fixed"))
sc.next();sc.next();sc.next();sc.next();
curRate = sc.nextDouble();
Account3 temp = new Account3(custId,custName,custAddress,custBirthdate,custPhone,custBalance,custAccType,curRate);
customerList[noOfCustomers]=temp;
sc.nextLine();
noOfCustomers++;
i++;
else
System.out.println("Account type not defined.");
if(noOfCustomers==30)
System.out.println("The customer list has reached its maximum limit of 30 records!");
System.out.println();
return noOfCustomers;
//Exceptions to be caught
catch (FileNotFoundException e)
System.out.println("Error opening file");
System.exit(0);
catch (IOException e)
System.out.println("IO error!");
System.exit(0);
/* Bubblesort method used to sort the array in ascending alphabetical order
according to customer's name */
bubbleSort(customerList);
return i;
/* The method displayRecords() displays the data of the customer records on
screen */
public static void displayRecords()
int k;
/* Displaying text using the printf() method */
for(k=0;k<noOfCustomers;k++)
System.out.printf("Name = %s\n", customerList[k].getName());
System.out.printf("Account Balance = %.2f\n", customerList[k].getBalance());
System.out.printf("Account Id = %d\n", customerList[k].getId());
System.out.printf("Address = %s\n", customerList[k].getAddress());
System.out.printf("DOB = %s\n", customerList[k].getBirthdate());
System.out.printf("Phone Number = %s\n", customerList[k].getPhone());
String type = customerList[k].getAccType();
System.out.println("Account Type = " +type);
if(type.equals("Fixed"))
System.out.println("Fixed daily interest = "+((Account3)customerList[k]).getFixed());
System.out.println();
/* The method writeFile() saves the content from customerList into a
specified text file. Data is printed on the screen at the same time */
public static void writeFile()
/* Try block to enclose statements that might throw an exception, followed by
the catch block to handle the exception */
try
int i;
int n=0;
//PrintWriter class used to write contents of studentList to specified file
FileWriter fwStream = new FileWriter("newCustomers.txt");
BufferedWriter bwStream = new BufferedWriter(fwStream);
PrintWriter pwStream = new PrintWriter(bwStream);
for(i=0;i<noOfCustomers;i++)
pwStream.println("Account Id = "+customerList.getId());
pwStream.println("Name = "+customerList[i].getName());
pwStream.println("Address = "+customerList[i].getAddress());
pwStream.println("DOB = "+customerList[i].getBirthdate());
pwStream.println("Phone Number = "+customerList[i].getPhone());
pwStream.printf("Account Balance = %.2f\n", customerList[i].getBalance());
pwStream.println("Account Type = "+customerList[i].getAccType());
if(customerList[i].getAccType().equals("Fixed"))
pwStream.println("Fixed Daily Interest = "+((Account3)customerList[i]).getFixed());
pwStream.println();
n++;
//Closure of stream
pwStream.close();
System.out.println(+n+" records written.");
catch(IOException e)
System.out.println("IO error!");
System.exit(0);
//Deletes specified record from list
public static void deleteRecord(int id)
int i;
i=locate(id);
if(i==200)
//checking if account to be deleted does not exist
System.out.println("Error: no account with the id of "+id+" found!");
//if account exists
else
while(i<noOfCustomers)
customerList[i] = customerList[i+1];
i++;
System.out.println("Account Id: "+id+" has been deleted");
--noOfCustomers;
//Updates the accounts
public static void update(double interest)
int i,j,k;
double custBalance,addition=0;
for(i=0;i<noOfCustomers;i++)
if(customerList[i] instanceof Account1)
for(j=0;j<30;j++)
addition=customerList[i].getBalance()*interest;
custBalance=customerList[i].getBalance()+addition;
customerList[i].setBalance(custBalance);
else if(customerList[i] instanceof Account2)
continue;
else if(customerList[i] instanceof Account3)
for(j=0;j<30;j++)
addition=customerList[i].getBalance()*((Account3)customerList[i]).getFixed();
custBalance=customerList[i].getBalance()+addition;
customerList[i].setBalance(custBalance);
else
System.out.println("Account type not defined");
System.out.println("The updated balances are: \n");
for(k=0;k<noOfCustomers;k++)
System.out.printf("Name = %s\n", customerList[k].getName());
System.out.printf("Account Balance = %.2f\n", customerList[k].getBalance());
System.out.println();
/* ================== Additional methods ==================== */
/* Bubblesort method to sort the customerList in ascending alphabetical
order according to customer's name */
public static void bubbleSort(Customer[] x)
int pass, index;
Customer tempValue;
for(pass=0; pass<noOfCustomers-1; pass++)
for(index=0; index<noOfCustomers-1; index++)
if(customerList[index].getName().compareToIgnoreCase(customerList[index+1].getName()) > 0)
tempValue = x[index];
x[index] = x[index+1];
x[index+1]= tempValue;
/* Method used to check for duplicated ids in array */
public static boolean checkDuplicate(int id)
int i;
for(i=0;i<noOfCustomers;i++)
if(id == customerList[i].getId())
System.out.println("Account Id = "+id+" already exists");
System.out.println();
return true;
}return false;
/* Method to seach for account id in array */
public static int locate(int id)
int j;
for(j=0;j<noOfCustomers;j++)
if(customerList[j].getId()==id)
return j;
j=200;
return j;
import java.util.Scanner;
public class Customer
/* The following private variables are declared so that the data is only
accessible to its own class,but not to any other class, thus preventing
other classes from referring to the data directly */
protected int id;
protected String name,address,birthdate,phone,accType;
protected double balance;
// Null constructor of Customer
public Customer()
id = 0;
name = null;
address = null;
birthdate = null;
phone = null;
balance = 0;
accType = null;
/* The following statements with the keyword this activates the Customer
(int id, String name String address, String birthdate, String phone, double
balance) constructor that has six parameters of account id, name, address,
date of birth, phone number, account balance and assign the values of the
parameters to the instance variables of the object */
public Customer(int id, String name, String address, String birthdate, String phone, double balance, String accType)
//this is the object reference that stores the receiver object
this.id = id;
this.name = name;
this.address = address;
this.birthdate = birthdate;
this.phone = phone;
this.balance = balance;
this.accType = accType;
/* The following get methods getId(), getName(), getAddress(), getBirthdate(),
getPhone(), getBalance() return the values of the corresponding instance
properties */
public int getId()
return id;
public String getName()
return name;
public String getAddress()
return address;
public String getBirthdate()
return birthdate;
public String getPhone()
return phone;
public double getBalance()
return balance;
public String getAccType()
return accType;
/* The following set methods setId(), setName(), setAddress(), setBirthdate(),
setPhone and setBalance() set the values of the corresponding instance
properties */
public void setId (int custId)
id = custId;
public void setName(String custName)
name = custName;
public void setAddress (String custAddress)
address = custAddress;
public void setBirthdate (String custBirthdate)
birthdate = custBirthdate;
public void setPhone (String custPhone)
phone = custPhone;
public void setBalance (double custBalance)
balance = custBalance;
public void setAccType (String custAccType)
accType = custAccType;
class Account1 extends Customer
public Account1(int id, String name, String address, String birthdate, String phone, double balance, String accType)
super(id,name,address,birthdate,phone,balance,accType);
this.id = id;
this.name = name;
this.address = address;
this.birthdate = birthdate;
this.phone = phone;
this.balance = balance;
this.accType = accType;
class Account2 extends Customer
public Account2(int id, String name, String address, String birthdate, String phone, double balance, String accType)
super(id,name,address,birthdate,phone,balance,accType);
this.id = id;
this.name = name;
this.address = address;
this.birthdate = birthdate;
this.phone = phone;
this.balance = balance;
this.accType = accType;
class Account3 extends Customer
protected double fixed=0;
public Account3(int id, String name, String address, String birthdate, String phone, double balance, String accType, double fixed)
super(id,name,address,birthdate,phone,balance,accType);
this.id = id;
this.name = name;
this.address = address;
this.birthdate = birthdate;
this.phone = phone;
this.balance = balance;
this.accType = accType;
this.fixed = fixed;
public double getFixed()
return fixed;
Example of a customers.txt
Account Id = 123
Name = Matt Damon
Address = 465 Ripley Boulevard, Oscar Mansion, Singapore 7666322
DOB = 10-10-1970
Phone Number = 790-3233
Account Balance = 405600.00
Account Type = Fixed
Fixed Daily Interest = 0.05
Account Id = 126
Name = Ben Affleck
Address = 200 Hunting Street, Singapore 784563
DOB = 25-10-1968
Phone Number = 432-4579
Account Balance = 530045.00
Account Type = Saving
Account Id = 65
Name = Salma Hayek
Address = 45 Mexican Boulevard, Hotel California, Singapore 467822
DOB = 06-04-73
Phone Number = 790-0000
Account Balance = 2345.00
Account Type = Checking
Account Id = 78
Name = Phua Chu Kang
Address = 50 PCK Avenue, Singapore 639798
DOB = 11-08-64
Phone Number = 345-6780
Account Balance = 0.00
Account Type = Checking
Account Id = 234
Name = Zoe Tay
Address = 100 Blue Eyed St, Singapore 456872
DOB = 15-02-68
Phone Number = 456-1234
Account Balance = 600.00
Account Type = Saving1) When you post code, please use[code] and [/code] tags as described in Formatting tips on the message entry page. It makes it much easier to read.
2) Don't just post a huge pile of code and ask, "How do I make this work?" Ask a specific question, and post just enough code to demonstrate the problem you're having.
3) Don't just write a huge pile of code and then test it. Write a tiny piece, test it. Then write the piece that will work with or use the first piece. Test that by itself--without the first piece. Then put the two together and test that. Only move on to the next step after the current step produces the correct results. Continue this process until you have a complete, working program. -
Alphabetically ordering a Linked List
Would anyone please be able to give me help in ordering a linked list alphabetically. I'm new to java so please be gentle.
Many thanks in advance.I've just tried that but it gave me errors on trying to compile it:
.\List.java:91: Incompatible type for method. Explicit cast needed to convert List to java.util.List.
Collections.sort(leftList);
^
.\List.java:92: Incompatible type for method. Explicit cast needed to convert List to java.util.List.
Collections.sort(rightList);
^
2 errors
I'll post my coding below to see if you can help me out. Thanks a lot.
import java.util.LinkedList;
import java.util.Collections;
class ListNode {
// package access data so class List can access it directly
char data;
ListNode next;
// Constructor: Create a ListNode that refers to Object o.
ListNode( char c ) { this( c, null ); }
// Constructor: Create a ListNode that refers to Object o and
// to the next ListNode in the List.
ListNode( char c, ListNode nextNode )
data = c; // this node refers to Object o
next = nextNode; // set next to refer to next
// Return a reference to the Object in this node
char getChar() { return data; }
// Return the next node
ListNode getNext() { return next; }
// Class List definition
public class List {
private ListNode firstNode, current;
private ListNode lastNode;
private String name; // String like "list" used in printing
// Constructor: Construct an empty List with s as the name
public List( String s )
name = s;
firstNode = lastNode = null;
// Constructor: Construct an empty List with
// "list" as the name
public List() { this( "list" ); }
public synchronized boolean isEmpty()
{ return firstNode == null; }
public synchronized void insertAtBack( char insertItem )
if ( isEmpty() )
firstNode = lastNode = new ListNode( insertItem );
else
lastNode = lastNode.next = new ListNode( insertItem );
print();
// System.out.println(insertItem);
// public char getText(){
// return current.data;
// Output the List contents
public synchronized void print()
current = firstNode;
while ( current != null ) {
System.out.print(current.data);
current = current.next;
System.out.println( "\n" );
// method to split the linked list
public synchronized void splitList(){
System.out.println("splitList");
ListNode present = firstNode;
List leftList = new List(); // create the left list
List rightList = new List(); // create the right list
try{
while (present != null) {
leftList.insertAtBack(present.data);
System.out.println("left " +present.data);
present = present.next; // skips 1 node
rightList.insertAtBack(present.data);
System.out.println("right " +present.data);
present = present.next; // skips 1 node
Collections.sort(leftList);
Collections.sort(rightList);
catch(NullPointerException e){ -
C/C++ Alphabetical Linked List
For my programming class, we have to create a linked list, which is arranged in order of when you added them. This was Assignment Six. Assignment 8 is to add an alphabetical list to this program, alongside the list in order.
My professor wants us to have a "donor struct" and an "alpha struct" that points to the donor, as well as the next in the list.
He isn't helping me figure this out so I figured I'd ask for help here.
My 'modifyDonor()' function is broken, it deletes everything after whatever record you are trying to modify. There is also a problem in my 'prepareFiles()' function. Whatever the last entry is, is copied in twice.
I would rather have this alphabetical stuff figured out before I work on those things.
I'm not really allowed to use C++ stuff (classes, objects, etc.), because we haven't learned them yet, but if you can do it, and figure it out, then explain it to me. I'll take it.
(Also, if you could post the edits to my source code, that would rad!)
Below is a link to my source code and data file.
http://www.dcpwrpodcast.com/DCPWR/Help.Sponsorhipfiles/Archive.zip
Any help you can provide is greatly appreciated!Unfortunately, I can't really pinpoint an exact place where you are doing something wrong. I don't think you really understand the linked list concepts yet. The first thing I changed was getting rid of where you increment "first" in modifyDonation. Resetting "first" effectively destroys your list. You have additional problems with the other pointers.
So, first of all, you have too many global pointers. You need one global pointer, named "head". Any time you iterate through the list (to print, find, etc.) you create a temp donor pointer, assign "head" to it and increment that temp pointer. The last node in your list should have NULL as its "next" pointer.
To add a node, create a new node with NULL as its next pointer. Find where you want to insert, make the new node's next pointer point to the next pointer of the node at the insertion point. Then make the next pointer of the node at the insertion point point to the new node.
To delete a node, find the node to delete. Make the previous node's next pointer point to the dead node's next pointer. Then delete the node.
You don't change any pointers (other than temp ones) during a modify or print.
At this point, all you have left is the special case of the first node. The last node isn't special because you can do the same copying of the next pointer as normal, even though that pointer is NULL.
The first node, however, needs careful handling. If you delete the first node, you have to reset your head pointer. If you insert a new first node, you have to reset your head pointer. Sometimes it is easier to have your head node be a special, empty node. Then, you don't have to re-assign head. Also, when searching through the list, your "current" pointer should be the "previous" node. That way, when you are ready to insert, your "current" pointer is the "previous" node and the insertion is easy. The code looks a bit ugly because you'll have things like "if(current->next && current->next->id == id)". But you'll also need an extra, redundant null check.
Hopefully this makes some sense. Your code is more complicated than it needs to be. You have too many globals. You are modifying those globals far too frequently. You want lots of:
void modifyDonation(donor * node);
donor * current = head->next;
while(current)
if(current->id == id)
modifyDonation(current);
break;
current = current->next;
insert and delete are more difficult
void insertDonation(donor * previous, donor * next);
donor * current = head;
while(current)
if(!current->next || (current->next->id == id))
insertDonation(current, current->next);
break;
current = current->next;
To maintain a natural order and a sorted order, you'll need two head pointers. After you add or insert into the natural list, you insert into the sorted list according to the sort criteria. Delete is the same for both lists. -
Help needed in linked lists...
I have been working on this computer assignment lately but I still don't understand linked lists yet..I did an assignment on array based implementation and now I am supposed to do the same thing in linked list implementation..
I need help on how to change this into a linked list implementation..any help would be appreciated. Thank you..below is the code for the array based implementation..the only thing that needs change here is after where is says Array-based implementation of the ADT list.
public class ListArrayBasedDriver {
public static void main(String [] args) {
ListArrayBased myGroceryList = new ListArrayBased();
myGroceryList.add(1,"milk");
myGroceryList.add(2,"eggs");
myGroceryList.add(3,"butter");
myGroceryList.add(4,"pecans");
myGroceryList.add(5,"apples");
myGroceryList.add(6,"bread");
myGroceryList.add(7,"chicken");
myGroceryList.add(8,"rice");
myGroceryList.add(9,"red beans");
myGroceryList.add(10,"sausage");
myGroceryList.add(11,"flour");
printList(myGroceryList); //print out original List
System.out.print("numItems is now: " + myGroceryList.size() + "\n");
System.out.println("adding juice for 5th item...");
myGroceryList.add (5, (Object) "juice"); //add juice
System.out.println("item 5 is: " + myGroceryList.get(5)); //get position 5
printList(myGroceryList);
System.out.print("numItems is now: " + myGroceryList.size() + "\n");
System.out.println("removing juice...");
myGroceryList.remove (5); //remove item at position 5
printList(myGroceryList);
System.out.print("numItems is now: " + myGroceryList.size() + "\n");
public static void printList(ListArrayBased myList)
//method prints a list, numbering the values, e.g, "1. milk" .... "5. juice".... etc.
int i;
for(i=1; i <= myList.size(); i++)
String tempString = new String((String)myList.get(i));
System.out.println(i+" "+ tempString);
// Array-based implementation of the ADT list.
class ListArrayBased {
private static final int MAX_LIST = 50;
private Object items[]; // an array of list items
private int numItems; // number of items in list
public ListArrayBased()
// creates an empty list
items = new Object[MAX_LIST];
numItems = 0;
} // end default constructor
public boolean isEmpty()
return (numItems == 0);
} // end isEmpty
public int size()
return numItems;
} // end size
public void removeAll()
// Creates a new array; marks old array for
// garbage collection.
items = new Object[MAX_LIST];
numItems = 0;
} // end removeAll
public void add(int index, Object item) throws ListIndexOutOfBoundsException
if (numItems > MAX_LIST)
throw new ListException("ListException on add");
} // end if
if (index >= 1 && index <= numItems+1)
// make room for new element by shifting all items at
// positions >= index toward the end of the
// list (no shift if index == numItems+1)
for (int pos = numItems; pos >= index; pos--) {
items[translate(pos+1)] = items[translate(pos)];
} // end for
// insert new item
items[translate(index)] = item;
numItems++;
else
{ // index out of range
throw new ListIndexOutOfBoundsException(
"ListIndexOutOfBoundsException on add");
} // end if
} //end add
public Object get(int index) throws ListIndexOutOfBoundsException
if (index >= 1 && index <= numItems)
return items[translate(index)];
else
{ // index out of range
throw new ListIndexOutOfBoundsException(
"ListIndexOutOfBoundsException on get");
} // end if
} // end get
public void remove(int index) throws ListIndexOutOfBoundsException
if (index >= 1 && index <= numItems)
// delete item by shifting all items at
// positions > index toward the beginning of the list
// (no shift if index == size)
for (int pos = index+1; pos <= size(); pos++) {
items[translate(pos-1)] = items[translate(pos)];
} // end for
numItems--;
else
{ // index out of range
throw new ListIndexOutOfBoundsException("ListIndexOutOfBoundsException on remove");
} // end if
} // end remove
private int translate(int position) {
return position - 1;
} // end translate
} // end ListArrayBased
class ListException extends RuntimeException
public ListException(String s)
super(s);
} // end constructor
} // end ListException
class ListIndexOutOfBoundsException
extends IndexOutOfBoundsException {
public ListIndexOutOfBoundsException(String s) {
super(s);
} // end constructor
} // end ListIndexOutOfBoundsExceptionCould someone check for me if this will work and if it doesn't what I need to do to make it work..Thanks...
public class ListArrayBasedDriver {
public static void main(String [] args) {
ListArrayBased myGroceryList = new ListArrayBased();
myGroceryList.add(1,"milk");
myGroceryList.add(2,"eggs");
myGroceryList.add(3,"butter");
myGroceryList.add(4,"pecans");
myGroceryList.add(5,"apples");
myGroceryList.add(6,"bread");
myGroceryList.add(7,"chicken");
myGroceryList.add(8,"rice");
myGroceryList.add(9,"red beans");
myGroceryList.add(10,"sausage");
myGroceryList.add(11,"flour");
printList(myGroceryList); //print out original List
System.out.print("numItems is now: " + myGroceryList.size() + "\n");
System.out.println("adding juice for 5th item...");
myGroceryList.add (5, (Object) "juice"); //add juice
System.out.println("item 5 is: " + myGroceryList.get(5)); //get position 5
printList(myGroceryList);
System.out.print("numItems is now: " + myGroceryList.size() + "\n");
System.out.println("removing juice...");
myGroceryList.remove (5); //remove item at position 5
printList(myGroceryList);
System.out.print("numItems is now: " + myGroceryList.size() + "\n");
public static void printList(ListArrayBased myList)
//method prints a list, numbering the values, e.g, "1. milk" .... "5. juice".... etc.
int i;
for(i=1; i <= myList.size(); i++)
String tempString = new String((String)myList.get(i));
System.out.println(i+" "+ tempString);
// Linked List-based implementation of the ADT list.
class ListNode
//class to represent one node in a list
class ListNode
//package access members; List can access these directly
Object data;
ListNode nextNode;
//contructor creates a ListNode that refers to object
ListNode( Object object)
this( object, null );
} //end ListNode one-argument constructor
//constructor creates ListNode that refers to
// Object and to the next ListNode
ListNode ( Object object, ListNode node)
data = object;
nextNode = node;
// end ListNode two-argument contructor
//return reference to data in node
Object getObject()
return data; // return Object in this mode
//return reference to next node in list
ListNode getNext()
return nextNode; // get next node
} // end method getNext
} //end class ListNode
//class List Definition
public class List
private ListNode firstNode;
private ListNode lastNode;
private String name; // string like " list " used in printing
//contructor creates empty List with " list " as the name
public List()
this(" list ");
} //end List no-arguement constructor
//contructor creates an empty list with a name
public List( String listName )
name = listname;
firstNode = lastNode = null;
} //end List no-arguement contructor
//insert Object at front of List
public void insertAtFront ( object insertItem )
if ( isEmpty() ) //firstNode and lastNode refer to same object
firstNode = lastNode = newListNode( insertItem );
else // firstNode refers to new node
firstNode = new ListNode ( insertItem, firstNode );
} // end method insertAtFront
// insert Object at end of List
public void insert AtBack ( Object insertItem )
if ( isEmpty() ) //firstNode and lastNode refer to same object
firstNode = new ListNode ( insertItem );
else // firstNode refers to new node
firstNode = new ListNode (insertItem, firstNode );
} // end method insertAtFront
// insert Object at end of List
public void insertAtBack ( Object insertItem )
if ( isEmpty() ) //firstNode and LastNode refer to same Object
firstNode = lastNode = new ListNode ( insertItem );
else // lastNode = lastNode.nextNode = new ListNode ( insertItem );
} // end method insertAtBack
//remove first node from List
public Object removeFromFront() throws EmptyListException
if( isEmpty() ) //throw exception if list is empty
throw new EmptyListException( name );
object removedItem = firstNode.data; //retrieve data being removed
// update references firstNode and lastNode
if (firstNode == lastNode )
firstNode =lastNode = null;
else
firstNode = firstNode.nextNode;
return removedItem; // return removed node data
} //end method removeFromFront
//remove last node from List
Public Object removeFromBack() throws EmptyListException
If ( isEmpty() ) // throw exception if list is empty
throw new EmptyListException( name );
Object removedItem = lastNode.data; // retrieve data being removed
// update references firstNode and lastNode
If ( firstNode == lastNode )
firstNode = lastNode = null;
else // locate new last node
ListNode current = firstNode;
// loop while current node does not refer to lastNode
while ( current.nextNode != lastNode )
current = current.nextNode;
lastNode = current; // current is new lastNode
current.nextNode = null;
} // end else
return removedItem; // return removed node data
} // end method removeFromBack
// determine whether list is empty
public boolean isEmpty()
return firstNode == null; // return true if list is empty
} // end method isEmpty
//output List contents
public void print()
if (isEmpty() )
System.out.printf(�Empty %s\n�, name );
return;
System.out.printf(�The %s is: �, name );
ListNode current = firstNode;
//while (current != null )
System.out,printf(�%s �, current.data );
current = current.nextNode;
} //end while
System.out.println( �\n� );
} //end method print
} end class List -
Help PLEASE with linked list. Inserting a string in the middle of
I'm trying to insert new strings to a linked list but it seem i cant never insert. the following code has the instructions. What i'm I not doing right? If i try to use the code, the new strings don't go through
please help someone
// This method should insert a new node containing the string newString immediately after the first
// occurrence of the string aString in the list. If aString is not in the list, the method should add a node
// containing newString to the tail of the list.
public void insertAfter(String newString, String aString)
StringLLNode newNode = new StringLLNode();
newNode.setData(newString);
//Check if HeadNode == aString
if (headNode.getData().equalsIgnoreCase(aString))
headNode = newNode;
//rest of the nodes
StringLLNode currNode = headNode;
while(currNode != null)
if (currNode.getData().equalsIgnoreCase(aString))
newNode.setNext(currNode);
//System.out.println("It went THROUGH");
currNode = currNode.getNext();
//Last Node
if (currNode != null)
newNode.setNext(headNode);
}I have to agree with flounder, go grab a pen and paper and logically work thru the code snippet you posted.
public void insertAfter(String newString, String aString)
StringLLNode newNode = new StringLLNode();
newNode.setData(newString);
//Check if HeadNode == aString
if (headNode.getData().equalsIgnoreCase(aString))
headNode = newNode;
//rest of the nodes
StringLLNode currNode = headNode;
while(currNode != null)
if (currNode.getData().equalsIgnoreCase(aString))
newNode.setNext(currNode);
//System.out.println("It went THROUGH");
currNode = currNode.getNext();
//Last Node
if (currNode != null)
newNode.setNext(headNode);
}Given a linked list [A-E] we have: A => B => C => D => E. Each Node is referencing the node to it's right, so A references B, D references E etc.
For example take aString = "A" and newString = "AB". Your code suggests the following:
1. Create new_node "AB"
2. if head[A] equals aString[A], TRUE
2.a head = new_ node
Now the resulting linkedlist is the following:
AB => Null
what happened to the rest of the list?
Now we go on to your updated example, we result in the following list:
A => AB => Null
hmm do you see a pattern here? when inserting a new node we are disregarding any reference to the tail of the list.
Extending on that idea we have the following pseudo code
1. if node to be inserted
1.a new_node.next = list_tail
1.b current_node.next = new_node
A => B => C => D => E, where newnode=AA
AA => B => C => D => E //using 1.a
A => AA => B => C => D => E //using 1.b
Mel -
Linked lists problem -- help needed
Hello again. I've got yet another problem in my C++ course that stems from my use of a Mac instead of Windows. I'm going to install Parallels so I can get Windows on my MacBook and install Visual Studio this week so that I don't have to deal with these discrepancies anymore, but in the meanwhile, I'm having a problem here that I don't know how to resolve. To be clear, I've spent a lot of time trying to work this out myself, so I'm not just throwing this up here to have you guys do the work for me -- I'm really stuck here, and am coming here as a last resort, so I'll be very, very appreciative for any help that anyone can offer.
In my C++ course, we are on a chapter about linked lists, and the professor has given us a template to make the linked lists work. It comes in three files (a header, a source file, and a main source file). I've made some adjustments -- the original files the professor provided brought up 36 errors and a handful of warnings, but I altered the #include directives and got it down to 2 errors. The problematic part of the code (the part that contains the two errors) is in one of the function definitions, print_list(), in the source file. That function definition is shown below, and I've marked the two statements that have the errors using comments that say exactly what the errors say in my Xcode window under those two statements. If you want to see the entire template, I've pasted the full code from all three files at the bottom of this post, but for now, here is the function definition (in the source file) that contains the part of the code with the errors:
void LinkedList::printlist( )
// good for only a few nodes in a list
if(isEmpty() == 1)
cout << "No nodes to display" << endl;
return;
for(CURSOR = FRONT_ptr; CURSOR; CURSOR = CURSOR-> link)
{ cout << setw(8) << CURSOR->name; } cout << endl; // error: 'setw' was not declared in this scope
for(CURSOR = FRONT_ptr; CURSOR; CURSOR = CURSOR-> link)
{ cout << setw(8) << CURSOR->test_grade; } cout << endl; // error: 'setw' was not declared in this scope
As you can see, the problem is with the two statements that contain the 'setw' function. Can anyone help me figure out how to get this template working and get by these two errors? I don't know enough about linked lists to know what I can and can't mess with here to get it working. The professor recommended that I try using 'printf' instead of 'cout' for those two statements, but I don't know how to achieve the same effect (how to do whatever 'setw' does) using 'printf'. Can anyone please help me get this template working? Thank you very, very much.
For reference, here is the full code from all three files that make up the template:
linkedlist.h (header file):
#ifndef LINKED_LINKED_H
#define LINKED_LINKED_H
struct NODE
string name;
int test_grade;
NODE * link;
class Linked_List
public:
Linked_List();
void insert(string n, int score);
void remove(string target);
void print_list();
private:
bool isEmpty();
NODE *FRONT_ptr, *REAR_ptr, *CURSOR, *INSERT, *PREVIOUS_ptr;
#endif
linkedlist.cpp (source file):
#include <iostream>
using namespace std;
#include "linkedlist.h"
LinkedList::LinkedList()
FRONT_ptr = NULL;
REAR_ptr = NULL;
PREVIOUS_ptr = NULL;
CURSOR = NULL;
void Linked_List::insert(string n, int score)
INSERT = new NODE;
if(isEmpty()) // first item in List
// collect information into INSERT NODE
INSERT-> name = n;
// must use strcpy to assign strings
INSERT -> test_grade = score;
INSERT -> link = NULL;
FRONT_ptr = INSERT;
REAR_ptr = INSERT;
else // else what?? When would this happen??
// collect information into INSERT NODE
INSERT-> name = n; // must use strcpy to assign strings
INSERT -> test_grade = score;
REAR_ptr -> link = INSERT;
INSERT -> link = NULL;
REAR_ptr = INSERT;
void LinkedList::printlist( )
// good for only a few nodes in a list
if(isEmpty() == 1)
cout << "No nodes to display" << endl;
return;
for(CURSOR = FRONT_ptr; CURSOR; CURSOR = CURSOR-> link)
{ cout << setw(8) << CURSOR->name; } cout << endl; // error: 'setw' was not declared in this scope
for(CURSOR = FRONT_ptr; CURSOR; CURSOR = CURSOR-> link)
{ cout << setw(8) << CURSOR->test_grade; } cout << endl; // error: 'setw' was not declared in this scope
void Linked_List::remove(string target)
// 3 possible places that NODES can be removed from in the Linked List
// FRONT
// MIDDLE
// REAR
// all 3 condition need to be covered and coded
// use Trasversing to find TARGET
PREVIOUS_ptr = NULL;
for(CURSOR = FRONT_ptr; CURSOR; CURSOR = CURSOR-> link)
if(CURSOR->name == target) // match
{ break; } // function will still continue, CURSOR will
// mark NODE to be removed
else
{ PREVIOUS_ptr = CURSOR; } // PREVIOUS marks what NODE CURSOR is marking
// JUST before CURSOR is about to move to the next NODE
if(CURSOR == NULL) // never found a match
{ return; }
else
// check each condition FRONT, REAR and MIDDLE
if(CURSOR == FRONT_ptr)
// TARGET node was the first in the list
FRONT_ptr = FRONT_ptr -> link; // moves FRONT_ptr up one node
delete CURSOR; // deletes and return NODE back to free memory!!!
return;
}// why no need for PREVIOUS??
else if (CURSOR == REAR_ptr) // TARGET node was the last in the list
{ // will need PREVIOUS for this one
PREVIOUS_ptr -> link = NULL; // since this node will become the last in the list
REAR_ptr = PREVIOUS_ptr; // = REAR_ptr; // moves REAR_ptr into correct position in list
delete CURSOR; // deletes and return NODE back to free memory!!!
return;
else // TARGET node was the middle of the list
{ // will need PREVIOUS also for this one
PREVIOUS_ptr -> link = CURSOR-> link; // moves PREV nodes' link to point where CURSOR nodes' points
delete CURSOR; // deletes and return NODE back to free memory!!!
return;
bool Linked_List::isEmpty()
if ((FRONT_ptr == NULL) && (REAR_ptr == NULL))
{ return true; }
else
{ return false;}
llmain.cpp (main source file):
#include <iostream>
#include <string>
#include <iomanip>
using namespace std;
#include "linkedlist.h"
int main()
Linked_List one;
one.insert("Angela", 261);
one.insert("Jack", 20);
one.insert("Peter", 120);
one.insert("Chris", 270);
one.print_list();
one.remove("Jack");
one.print_list();
one.remove("Angela");
one.print_list();
one.remove("Chris");
one.print_list();
return 0;setw is the equivalent of the field width value in printf. In your code, the printf version would look like:
printf("%8s", CURSOR->name.c_str());
I much prefer printf over any I/O formatting in C++. See the printf man page for more information. I recommend using Bwana: http://www.bruji.com/bwana/
I do think it is a good idea to verify your code on the platform it will be tested against. That means Visual Studio. However, you don't want to use Visual Studio. As you have found out, it gets people into too many bad habits. Linux is much the same way. Both development platforms are designed to build anything, whether or not it is syntactically correct. Both GNU and Microsoft have a long history of changing the language standards just to suit themselves.
I don't know what level you are in the class, but I have a few tips for you. I'll phrase them so that they answers are a good exercise for the student
* Look into const-correctness.
* You don't need to compare a bool to 1. You can just use bool. Plus, any integer or pointer type has an implicit cast to bool.
* Don't reuse your CURSOR pointer as a temporary index. Create a new pointer inside the for loop.
* In C++, a struct is the same thing as a class, with all of its members public by default. You can create constructors and member functions in a struct.
* Optimize your function arguments. Pass by const reference instead of by copy. You will need to use pass by copy at a later date, but don't worry about that now.
* Look into initializer lists.
* In C++ NULL and 0 are always the same.
* Return the result of an expression instead of true or false. Technically this isn't officially Return Value Optimization, but it is a good habit.
Of course, get it running first, then make it fancy. -
Hey people, i need a small help on my linked list.
Ok, what i'm trying to do is have a search function with a linked list using strings. First i will have a string, i will then compute the ASCII value for that and take MOD 71 lets say. For example, a string has an ASCII value of 216, MOD 71 of this gives me 3. I will then have an array of 71, and each array will point to a linked list. There will be as many linked list as there are of arrays (71). I will then store this string at index [3] in the linked list in which the array points to.
My problem for now is, how do i for example create 71 linked list? So far i can create only 1. To create another is easy, but if i have 71 the code will be too much. Is there an iterator i could use that easily creates 71? Sorry about this, i'm not really good with linked list with Java. Anyway, here is what i have now :).
public class MyLinkedListElement {
String string;
MyLinkedListElement next;
public MyLinkedListElement(String s) {
string = s;
next = null;
public MyLinkedListElement getNext() {
return next;
public String getValue() {
return string;
public class MyLinkedList {
public static MyLinkedListElement head;
public MyLinkedList() {
head = null;
public static void addToHead(String s) {
MyLinkedListElement a = new MyLinkedListElement(s);
if (head == null) {
head = a;
} else {
a.next = head;
head = a;
public static void main(String[] args) {
String[] arr = {"Bubble", "Angie", "Bob", "Bubble", "Adam"};
for (int i = 0; i < arr.length; i++) {
addToHead(arr);
MyLinkedListElement current = head;
while (current != null) {
System.out.println(current.getValue());
current = current.next;
}I can have an array of strings and easily add them to a linked list.I am very confused now, i just need to store a string value inside an array of linked list. But i can't somehow do it. I am very close, i can store the value in a linked list but the array of linked list, this is what i have.
public class MyLinkedListElement {
String string;
MyLinkedListElement next;
public MyLinkedListElement(String s) {
string = s;
next = null;
public MyLinkedListElement getNext() {
return next;
public String getValue() {
return string;
public class MyLinkedList {
public MyLinkedListElement head;
public MyLinkedList() {
head = null;
public void addToHead(String s) {
MyLinkedListElement a = new MyLinkedListElement(s);
MyLinkedList[] arrayOfLinkedLists = new MyLinkedList[71];
for(int i = 0; i < arrayOfLinkedLists.length; i++) {
arrayOfLinkedLists[i] = new MyLinkedList();
if (head == null) {
head = a;
} else {
a.next = head;
head = a;
public void print(MyLinkedListElement current) {
while (current != null) {
System.out.println(current.getValue());
current = current.next;
public static void main(String[] args) {
String[] arr = {"Bubble", "Angie", "Bob", "Bubble", "Adam"};
MyLinkedList listInstance = new MyLinkedList();
for (int i = 0; i < arr.length; i++) {
listInstance.addToHead(arr);
MyLinkedListElement current = listInstance.head;
listInstance.print(current);
Maybe you are looking for
-
Print document type Q02( technical delivery terms) with Purchase Order
Hi all 1) I have activated the QM procurement for a certain material and I have assigned the control key that makes mandatory the technical delivery terms on the material master (standard control key 0002). 2) I have created a Document Info Record Q0
-
Managing more than one logical component in SMSY Current System Assignments
Hi, I have a problem with managing logical components in TA SMSY in my Solution Manager System, in the section "System Groups and logical Components". I want to maintain more than one logical System e. g. from Type Application Server ABAP --> SAP NET
-
Hi could any one please give Shopping cart update tables like PR, PO(Eban,Ekko,Ekpo etc) updation in Backend. kindly provide SRM shopping cart tables,t codes&programmes. highly appreciated if any one could suggest. Thanks in advance Regards sss
-
Mac client (huh!) forgets appointments in future
Hi, Im not the guy with the mac, but I have to deal with this error. His post office was down some hours (certificate trouble) and after restart of the poa he missed the mails between yesterday and november 2014. But after last night, the missing mai
-
Instalation without the CD? Please help.
To whomever has stumbled upon this, I origionally bought my iPod and had sucsessfully instaled it into another computer, but one thing lead to another and we bought a new computer. My iPod got knocked off a desk, too, so I had to reset it and all of