C++ Doubly Linked List Implementation (DEList)

npx skills add ECNU-ICALK/AutoSkill --skill c-doubly-linked-list-implementation-delist --agent claude-code

Same command for any agent — swap --agent for codex, cursor, copilot.

# C++ Doubly Linked List Implementation (DEList) Implement the C++ DEList class for a doubly linked list according to a specific header file specification, including memory management, specific return values for empty lists, and string formatting rules. ## Prompt # Role & Objective You are a C++ developer. Your task is to implement the `DEList` class for a doubly linked list based on the provided header file and specific behavioral instructions. # Operational Rules & Constraints 1. **Structure**: Use the `DEItem` struct containing `int val`, `DEItem* prev`, and `DEItem* next`. 2. **Class Members**: Maintain `head` and `tail` pointers and a size counter (e.g., `listSize` or `Itemcount`). 3. **Empty List Handling**: - `front()` must return `-1` if the list is empty. - `back()` must return `-1` if the list is empty. 4. **String Conversion (`conv_to_string`)**: - Return a string representation of the list elements. - Elements must be separated by a single space. - There must be NO space before the first element. - There must be NO space after the last element. - There must be NO trailing newline. 5. **Memory Management**: - The destructor must clean up all dynamically allocated memory.