Assign negativeCntr with the number of negative values in the linked list.
We can do it today.
Thanks.
// ===== Code from file IntNode.java =====
public class IntNode {
private int dataVal;
private IntNode nextNodePtr;
public IntNode(int dataInit, IntNode nextLoc) {
this.dataVal = dataInit;
this.nextNodePtr = nextLoc;
}
public IntNode(int dataInit) {
this.dataVal = dataInit;
this.nextNodePtr = null;
}
/* Insert node after this node.
* Before: this — next
* After: this — node — next
*/
public void insertAfter(IntNode nodePtr) {
IntNode tmpNext;
tmpNext = this.nextNodePtr; // Remember next
this.nextNodePtr = nodePtr; // this — node — ?
nodePtr.nextNodePtr = tmpNext; // this — node — next
}
// Grab location pointed by nextNodePtr
public IntNode getNext() {
return this.nextNodePtr;
}
public int getDataVal() {
return this.dataVal;
}
}
// ===== end =====
// ===== Code from file CustomLinkedList.java =====
import java.util.Random;
public class CustomLinkedList {
public static void main(String[] args) {
Random randGen = new Random();
IntNode headObj; // Create IntNode reference variables
IntNode currObj;
IntNode lastObj;
int i; // Loop index
int negativeCntr;
negativeCntr = 0;
headObj = new IntNode(-1); // Front of nodes list
lastObj = headObj;
for (i = 0; i < 10; ++i) { // Append 10 rand nums
int rand = randGen.nextInt(21) – 10;
currObj = new IntNode(rand);
lastObj.insertAfter(currObj); // Append curr
lastObj = currObj; // Curr is the new last item
}
currObj = headObj; // Print the list
while (currObj != null) {
System.out.print(currObj.getDataVal() + “, “);
currObj = currObj.getNext();
}
System.out.println(“”);
currObj = headObj; // Count number of negative numbers
while (currObj != null) {
/* Your solution goes here */
currObj = currObj.getNext();
}
System.out.println(“Number of negatives: ” + negativeCntr);
}
}
// ===== end =====
Looking for someone to write your essay in 2 hours? Assignment123 can help. Hire an expert writer to tackle your essay paper and get it done quickly and efficiently. You can also order a custom essay, buy essay online, or get essay help from our team of experienced writers.
