singly-linked-list

问题 I am making a singly-linked list. When you delete a node, the previous node's next should become the current node's next ( prev->next = curr->next; ) and return data if the index matches. Otherwise, the previous node becomes the current node and the current node becomes the next node ( prev = curr; curr = curr->next; ): struct Node<T> { data: T, next: Option<Box<Node<T>>>, } struct LinkedList<T> { head: Option<Box<Node<T>>>, } impl LinkedList<i64> { fn remove(&mut self, index: usize) -> i64 {

问题 Seems that there is only doubly linked list (but no singly linked list) in the C++ standard library, right? Is there any widely-used C++ libraries with singly linked list? 回答1: There is slist, which is an SGI extension ( __gnu_cxx::slist ) #include <iostream> #include <iterator> #include <ext/slist> int main(int argc, char** argv) { __gnu_cxx::slist<int> sl; sl.push_front(1); sl.push_front(2); sl.push_front(0); std::copy(sl.begin(), sl.end(), // The output is 0 2 1 std::ostream_iterator<int>

问题 I've implemented my own version of a singly linked list in Rust as one of the challenges for me to learn it, and I'm satisfied with everything I have there except for the .pop() method. Using 2 while loops is very ugly and inefficient, but I found no other way to overcome the problem of setting the node at the index len() - 2 to None (popping the list), and using the data from the node at the index len() - 1 for the Some(data) return value (returns the element that was popped). GitHub Link

问题 I am new to linked list this is my second problem after inserting element in LL.Now i am trying to insert element at nth position. I do so like this: (1) First taking the size of user at terminal. (2) Second read the input continuously from the user until the size. (3) I add the element read at terminal at the beginning of the LL. (4) I print that LL until formed. Until here everything works fine (5) Now after that i try to do addition at nth position in LL but it give 3 errors That i have

问题 I am working on a project about linked list, I have trouble with inserting a number to a sorted linked list. The number inserted to the second position every time, I cannot figure out where the problem is.Here is my code: void insertSort(struct linkedList *n,int num,int *length){ //insert number to a sort linked list node *new = (node *) malloc(sizeof(node)); //create a new node new->next=NULL; new->data = num; while(n!=NULL&&n->data > new->data){ // find which position num should insert in

问题 I am having an issue while deleting the vowel from a linked List. The program accept command line arguments, combines them in a single string and add each character to a linked list as node. When i try to run the program with command line argument "lemon", the successfully deletes the vowels. i.e the program deletes the vowels successfully if the argument doesn't contain consequetive vowels. On the other hand, if i try to do the same with command line argument "aeiou", the program crashes

问题 public void insertElementBefore(E element, E newElement) { MyNode<E> current = head; if (head != null) { while (current != null) { if (current.data.equals(element)) { MyNode<E> n = new MyNode<E>(newElement); n.next = current.next; current.next = n; return; } current = current.next; } } } This is what I have for this. I'm having troubles to insert the newElement before intended element. Can't seem to figure out the syntax for it. I've been tinkering with it for a while and the best I could get

问题 There is a linked list that needs to be sorted in O(n Log n) time. I would like to use merge sort, but I can't figure out how to implement it by extending the SplDoublyLinkedList class. The main problem I encountered is that I cannot divide the SplDoublyLinkedList in half without allocating additional memory. If I had independent nodes, I could easily set pointer "next" of the node to a null value, but SplDoublyLinkedList doesn't let me do it. I mean something like that in Java: node

问题 //Colin James P. Naranjo //CMSC123 CD-1L //This program demonstrates postfix evaluation through pop and push functions #include<stdio.h> #include<stdlib.h> #include<string.h> typedef struct node{ //Uses a combination of typedef and tagged structure for the singly linked list char value; struct node *next; }stack; char evaluate(char a, char b, char c){ int ans; if(c == '*'){ ans = (int)a * (int)b; } if(c == '+'){ ans = (int)a + (int)b; } if(c == '-'){ ans = (int)a - (int)b; } if(c == '/'){ ans

问题 I am trying to, without using a ListIterator, define and implement a new operation called insert_back which takes a single template Object and inserts the Object at the end of the list. Without changing the meaning of this operation or any other, I need to modify the representation of a List and alter whatever methods are necessary to make insert_back run in constant time: O(1). I am totally stumped at implementing this. I want to make another menu option named INSERTBACK that will insert a