linked-list

问题 As my many previous posts show, I am making a code to simulate a crazy 8's card game. I have a delete node function that is meant to delete the card from the deck being played. It works for cards after the first, but every time i try to delete the first card (node) from the list it will not delete and then messes up the whole program after it. Here is the function: void deleteNode(card *head, int coordinate) { card *current = head; card *temp = NULL; temp = current; int count = 1; while (head

问题 As my many previous posts show, I am making a code to simulate a crazy 8's card game. I have a delete node function that is meant to delete the card from the deck being played. It works for cards after the first, but every time i try to delete the first card (node) from the list it will not delete and then messes up the whole program after it. Here is the function: void deleteNode(card *head, int coordinate) { card *current = head; card *temp = NULL; temp = current; int count = 1; while (head

问题 Closed. This question needs debugging details. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 6 years ago . Improve this question My aim is to produce a function that searches for a number already in the list and print that it has been found. My initial idea was to follow my remove function which searches through the list until it finds a number (to then delete). This seemed the logical way to code the

问题 In a hashmap, when we have the same hashcodes, we insert objects as a linked list which are later converted to TreeNode. Every New object with the same hashcode is added to the last of the linked list attached. So, my question here is why don't we add the new element as first element of the internal linked list attached to the bucket? Why do we traverse till the last element, and then add the new element. Time taken by Linked list to: Insert New element at start = O(1) Insert New element at

问题 I thought I understood the difference between ArrayList and LinkedList theoretically pretty well. However, its the first time, I put it to a little test, and the tests came out, well different to my expectations. Expectations : Arraylist will be slower than LinkedList when inserting at the beginning, since it has to "shift" the elements, for linkedlist, its just updating 2 references. Reality : came out to be same on most iterations. For a select few iterations, it was slower. Arraylist will

问题 I have been practicing the linked list and wanted to implement the recurse on it, although in some cases I was able to implement it efficiently, in other cases I failed miserably at doing so. I would like to know a method to do the recursive so as not to have to use the "while" to go through the Linked List, I have used the recurse to go through the arrays but when I wanted to do it similar in this case it fails. I don't have much experience in implementing recursion and wanted to apply it in

问题 I've made a remove method from scratch that removes a Node from a linked list at a specified index. It's not removing the correct Node. I've tried to step through with the debugger in eclipse but couldn't catch the problem. Each Node contains a token. I have included the Token class, Node class. I have written my methods in the List class and included a Test class. The remove method is currently removing the node next to the specified index. How can I get this to work? My apologies for the

问题 I've made a remove method from scratch that removes a Node from a linked list at a specified index. It's not removing the correct Node. I've tried to step through with the debugger in eclipse but couldn't catch the problem. Each Node contains a token. I have included the Token class, Node class. I have written my methods in the List class and included a Test class. The remove method is currently removing the node next to the specified index. How can I get this to work? My apologies for the

问题 PREFACE : The goal is to prompt a user for input, adding each element (input line) into a linked list. I have been playing around with some sample code from Learn-C.org, which shows a linked list example. I have modified the code so that it takes "strings" instead of integers. My insert function is as follows: void push(node_t * head, char *data) { node_t * current = head; if(head == NULL) { printf("First element ever!\n"); } else if(current->data == NULL) { current->data = data; current-

问题 PREFACE : The goal is to prompt a user for input, adding each element (input line) into a linked list. I have been playing around with some sample code from Learn-C.org, which shows a linked list example. I have modified the code so that it takes "strings" instead of integers. My insert function is as follows: void push(node_t * head, char *data) { node_t * current = head; if(head == NULL) { printf("First element ever!\n"); } else if(current->data == NULL) { current->data = data; current-