Website Summary Files Commits Branches @commit @diff @stats
diff options
context:
space:
mode:
Commit8b97246a36150dd7ea408ae16b7e9a696d5be91d (patch)
Author
 Stoycho Kyosev <stoycho.kk@gmail.com>
2022-11-03 21:23:05 +0200
Committer
 Stoycho Kyosev <stoycho.kk@gmail.com>
2022-11-03 21:23:05 +0200
Files35a01a573f0817e577b6c46d2a37b6e0308a91e0
Data-structures-and-algorithms-8b97246a36150dd7ea408ae16b7e9a696d5be91d.tar
Data-structures-and-algorithms-8b97246a36150dd7ea408ae16b7e9a696d5be91d.tar.gz
Data-structures-and-algorithms-8b97246a36150dd7ea408ae16b7e9a696d5be91d.zip
Parent56407acab11ada828ae18e9551e31825ae2485f1 (diff)
add insert at example
1 files changed, 15 insertions, 0 deletions
-rw-r--r--Seminar05/list-cheat-sheet.cpp15
diff --git a/Seminar05/list-cheat-sheet.cpp b/Seminar05/list-cheat-sheet.cpp
index 356519d..fd68300 100644
--- a/Seminar05/list-cheat-sheet.cpp
+++ b/Seminar05/list-cheat-sheet.cpp
@@ -104,4 +104,19 @@ int main() {
std::cout << "Pointer linked list after mappint 2* " << std::endl;
printLinkedList(pointreLinkedlist);
std::cout << std::endl;
+
+ // Как да добавяме елементи на произволна позиция?
+
+ // Итератор към началото
+ std::list<int>::iterator it = myList.begin();
+
+ // Отиваме на позицията
+ for (size_t i = 0; i < 2; i++) {
+ ++it;
+ }
+
+ // Добавяме
+ myList.insert(it, 10000);
+ // insert може да вмъква и цели рейнджове
+ printList(myList, "My list after adding 10000 in third pos");
} \ No newline at end of file