linked-list

问题 Can anyone tell me what is the difference between while(thead != NULL) and while(thead->next !=NULL) because for traversing the list thead != NULL is not working while thead->next works. According to my understanding head node is just a pointer to the starting node and not the the starting node itself. See this if u have doubt.Here head just stores address. //thead means temp head variable to store the address head points to. This is the code for insertion. #include<stdio.h> #include<malloc.h

问题 This might be a stupid question, but I'm having trouble thinking this through. I wrote a method that uses a LinkedList to move through loaded MIDI instruments. I want to make a next and a previous button so that every time you click the button you traverse through the LinkedList. If I hardcode itr.next(); or itr.previous(); multiple times I can traverse through the LinkedList public void setInsturment(Synthesizer start,MidiChannel currentChannel[]) { try { start.open(); Soundbank bank = start

问题 Looking at Linkedlist.java, I observe overloaded constructors, one of which contains an empty this(). Generally I have seen this with default params. Whats the use of this() with no params in it ? /** * Constructs an empty list. */ public LinkedList() { } /** * Constructs a list containing the elements of the specified * collection, in the order they are returned by the collection's * iterator. * * @param c the collection whose elements are to be placed into this list * @throws

问题 I want to keep a linked list in sorted order when inserting elements (about 200000 elements in the list), which algorithm can you recommend? I made a simple implementation using insertion sort, but its performance is very very bad (a lot of CPU usage). Thanks for your help. I did some comparison between merge sort and insertion sort but it seems that insertion sort has better performance, I am a bit confused by this result. Can you tell me what's wrong and if there is a better algorithm? My

问题 I am trying to create a simple program that gets the ip address given a certain hostname: My code snipped is attached below: #include<stdio.h> #include<stdlib.h> #include<stdio.h> #include<netdb.h> #include<sys/socket.h> #include<errno.h> #include<arpa/inet.h> #include<string.h> #include<unistd.h> int main(int argc, char *argv[]) { if(argc<2){ printf("Please provide a hostname.\n"); exit(1); } char *hostname = argv[1]; char ip[100]; get_ip(hostname,ip); printf("%s resolved to %s\n",hostname

问题 I've been working on a project for school (Due tonight!), and I'm having some serious memory issues. I'm fairly new to C and am still being thrown for a loop when it comes to mallocing pointers and whatnot, so I could really use some help. The code is as follows. The order of the files is LinkedLists.h (Header for LinkedList module), LinkedLists.c (LinkedList module), and TestList.c (Main module). /****************************************************************************** * Base struct to

问题 I have done a lot of readings but seems like I can't clear my confusion without asking here. Based on the diagram, when I create a a shallow copy of a linkedlist using clone(). A new linkedlist is created and the reference value of the head variable in the original is copied to the clone's and the rest of the nodes are shared. So if I add a new node using the clone, this should be visible to the orginal is it not? But when printing list1 out the value 3 is omitted. Can someone tell me why?

问题 I have a situation, as follows: I have n doubly-linked lists Each list has a sentinel beginning and end The lists all have the same beginning and end node (not required, but for simplicity's sake) The lists are homogenous and may share items I'd like to find a partial ordering of all nodes in all n lists, starting with the beginning node and ending with, well, the end node, such that any node which appears in n-x lists, where x < n , will be sorted with respect to the other nodes in all the

问题 By definition Linked List is a list that each element of it refers to the next element (and previous element if we are talkin about double linked list.) http://en.wikipedia.org/wiki/Linked_list However, in Java LinkedList is implementing List, Queue, Deque and more. http://docs.oracle.com/javase/6/docs/api/java/util/LinkedList.html You can not find a method in LinkedList that gives you next or previous object in the list, the best you can do is to get an Iterator and get objects. My question

问题 i'm trying to sort the linked list by modifying the links not swapping the data.i'm using selection sort.i don't know where i am going wrong.i'm beginner please help me. struct node { int data; node* link; }; node* p; void sort() { node* temp = p; node* save; node* prev; node* tprev; node* push = new node; tprev = NULL; for (; temp != NULL; temp = temp->link) { push = temp->link; for (; push != NULL; push = push->link) { if (push->data<temp->data) { save->link = temp->link; temp->link = push-