c++ - 程序因为字符串崩溃？

Question

我正在编写双向链表，一切正常，但在将字符串值读取到结构时遇到崩溃(代码行在函数“struct Node* GetNewNode()”中注释):

        #include <iostream>
        #include <String>
        #include <fstream>
        #include <cstdlib>

        using namespace std;

        struct Node {
            int sv;
            double real;
            bool log;
            char simb;
            string str;
            struct Node* next;
            struct Node* prev;
        };

        struct Node* head; // global variable - pointer to head node.
        //----------------------------
        struct Node* GetNewNode();
        void Initialize(Node *stack);
        void InsertAtTail(Node *stack);
        void Print(Node *stack);
        //----------------------------
        //Creates a new Node and returns pointer to it.

        ifstream fd("duom.txt");
        struct Node* GetNewNode() {
            struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
            fd >> newNode->sv;
            fd >> newNode->real;
            string loginis;
            fd >> loginis;
            if (loginis == "TRUE")
                newNode->log = true;
            else
                newNode->log = false;
            fd >> newNode->simb;
            //fd >> newNode->str;           //uncommented code in this row crashes the program
            newNode->prev = NULL;
            newNode->next = NULL;
            return newNode;
        }

        //Inserts a Node at head of doubly linked list
        void Initialize(Node *stack) {
            stack = head;
        }

        //Inserts a Node at tail of Doubly linked list
        void InsertAtTail(Node *stack) {
            struct Node* temp = stack;
            struct Node* newNode = GetNewNode();
            if(head == NULL) {
                head = newNode;
                return;
            }
            while(temp->next != NULL)
                temp = temp->next; // Go To last Node
            temp->next = newNode;
            newNode->prev = temp;
        }

        //Prints all elements in linked list in reverse traversal order.
        void Print(Node *stack) {
            struct Node* temp = stack;
            if(temp == NULL)
                return; // empty list, exit
            // Going to last Node
            while(temp->next != NULL)
                temp = temp->next;
            // Traversing backward using prev pointer
            while(temp != NULL) {
                cout << temp->sv << " ";
                cout << temp->real << " ";
                if (temp->log == true)
                    cout << "TRUE " << " ";
                else
                    cout << "FALSE " << " ";
                cout << temp->simb << " ";
                //cout << temp->str << "\n";
                temp = temp->prev;
            }
            printf("\n");
        }

        int main() {

            /*Driver code to test the implementation*/
            head = NULL; // empty list. set head as NULL.
            // Calling an Insert and printing list both in forward as well as reverse direction.
            Initialize(head);
            InsertAtTail(head);
            Print(head);
            InsertAtTail(head);
            Print(head);
            fd.close();
        }

输入数据为:
4 5.27 真 $asdf
6 7.3 真#qwer
9 8.8 错误 @ zxvc
7 6.35 错误! vbmn
1 0.89 真 % ghjk

谁能解释一下这里出了什么问题？

Answer 1

而不是使用 C 标准函数 malloc

      struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));

你必须使用operator new

在这种情况下，编译器将调用类 std::string 的构造函数来创建数据成员 str 否则，std::string 类型的对象 str 将不会被创建，程序将进行 chash。

函数 malloc 简单地分配请求大小的原始内存。它对类的构造函数一无所知。