[Data Structure] 이중 연결 리스트 구현 - #173
Merged
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
DoublyLinkedList클래스로 기본 이중 연결 리스트 동작을 직접 구현했습니다.insert,erase,at,clear를 포함한 기본 인터페이스와 예외 처리를 추가했습니다.assert기반 테스트로 정상 동작, 빈 리스트, 범위 오류 예외 케이스를 검증합니다.Test
c++ -std=c++17 -Wall -Wextra -pedantic src/data_structure_implement/list/doublyLinkedList/doublyLinkedList.cpp -o /tmp/doubly_linked_list_check/tmp/doubly_linked_list_check→ALL TESTS PASSEDCloses #172