Let’s see. Assume first time it runs, x,y is 1,1. So you add Box(1,1). Next time is run, let’s assume x,y is 2,3. So, enter for loop: i = 0: Not same x,y, so enter else, and add Box(2,3). i = 1: Same as x,y (yeah, we just added it), so enter if and remove … Read more
This operation is just doing the “merge” step of a Merge Sort and can be done in O(l1+l2) time. The general premise is to iterate over both (already sorted) lists at the same time, but only advance the list with the lowest head value, while using the advanced value in the resulting output. The operation … Read more
Okay to explain it in a more complete way. The most other guys had already wrote that you have to use ‘->’ when ever you have a pointer. But you could also do this with ‘.’, to do this you must respect the priority of the operators. We need the ‘*’ to get the content … Read more
Why does the difference emerge between this two codes in C: Array Implementation for Stack and Linked List Implementation for Stack? solved Why does the difference emerge between this two codes in C: Array Implementation for Stack and Linked List Implementation for Stack?
For logic as far as what I understood, you need to remove some flaws then your logic might work. try this one out : for(i=1;i<=n;i++) { flag=0; c=head; while(c!=b) { if(c->d==b->d) flag++; c=c->next; } if(flag==0 && i==1) { a=(list)malloc(sizeof(node)); a->d=b->d; a->next=NULL; taila=a; } else if(flag==0) { new=(list)malloc(sizeof(node)); new->d=b->d; new->next=NULL; taila->next=new; taila=new; } b=b->next; } 1 … Read more
!read.eof() only checks for end of file, not errors reading the file, such as a networked mounted file system not being ready, disk error, or lack of permission to read the file. You should check for all failures, with while(read) which has an overloaded operator to check everything for you. So, if the file fails, … Read more
@Sourav Ghosh have already explained what was wrong with your code and also suggested one way to solve it. Here is another way. Instead of passing current and head as variables to be changed inside the function (i.e. as pointer-to-pointer), I would recommend that you use the function return value. In that way you don’t … Read more
private members, pointers or otherwise, are data that the object either does not want messed by anyone else with or wants to know if someone messed with them. Setter and getter methods allow access to the private member, but in a controlled manner. For example if you have a private integer that under no circumstances … Read more
I like to handle this problem recursively: void deleteNode(Node * head) { if(head->pNext != NULL) { deleteNode(head->pNext) } delete head; } If we have a list of 5 items: head->pNext->pNext->pNext->pNext->NULL; Then, the function will first get called for head, then for each pNext until the last one. When we reach the last one, it will … Read more
from your question, I think (not 100% sure) you are looking for java.util.LinkedHashMap<K, V> in your case, it would be LinkedHashMap<String, Double> from java doc: Hash table and linked list implementation of the Map interface, with predictable iteration order. This implementation differs from HashMap in that it maintains a doubly-linked list running through all of … Read more
A Linked List is a data structured used for collecting a sequence of objects. The “Head” is the very first item in the sequence. The “Tail” is the last object in the sequence. Each item in the linked list (a node) will have a property called Next (and Previous if it is doubly linked) which … Read more
Your question isn’t clear, but I suspect the main point you may be missing is that ListIterator.add inserts at the current location: The element is inserted immediately before the next element that would be returned by next(), if any, and after the next element that would be returned by previous(), if any. And also: The … Read more
You should build your code with -Wall flag to compiler. At compile time it will then print: main.c:9:15: warning: ‘coord1’ is used uninitialized in this function [-Wuninitialized] This points you to the problem. coord1 is a pointer type, that you assign to, but coord1 has no memory backing it until it is initialized. In the … Read more
Look at this code: if (a == b) { while (a == b) { ptr->next = tmp->next; tmp = tmp->next; } When a is equal to b you execute the while (a == b). Since you don’t change a or b in the body of the while, you have an endless loop. Sooner or later … Read more
Nested* Nested_create(List list) { Nested* new = malloc(sizeof(Nested)); new->list = list; new->next = NULL; return new; } void Nested_add(Nested** proot, Nested* node) { if (*proot == NULL) { *proot = node; } else { Nested* cur = *proot; while (cur->next) cur = cur->next; cur->next = node; } } void createlistoflists(Nested **LIST, List list1, List list2, … Read more