Artwork

محتوای ارائه شده توسط HackerNoon. تمام محتوای پادکست شامل قسمت‌ها، گرافیک‌ها و توضیحات پادکست مستقیماً توسط HackerNoon یا شریک پلتفرم پادکست آن‌ها آپلود و ارائه می‌شوند. اگر فکر می‌کنید شخصی بدون اجازه شما از اثر دارای حق نسخه‌برداری شما استفاده می‌کند، می‌توانید روندی که در اینجا شرح داده شده است را دنبال کنید.https://fa.player.fm/legal
Player FM - برنامه پادکست
با برنامه Player FM !

How To Merge Two Sorted Lists

2:44
 
اشتراک گذاری
 

Manage episode 400581983 series 3474159
محتوای ارائه شده توسط HackerNoon. تمام محتوای پادکست شامل قسمت‌ها، گرافیک‌ها و توضیحات پادکست مستقیماً توسط HackerNoon یا شریک پلتفرم پادکست آن‌ها آپلود و ارائه می‌شوند. اگر فکر می‌کنید شخصی بدون اجازه شما از اثر دارای حق نسخه‌برداری شما استفاده می‌کند، می‌توانید روندی که در اینجا شرح داده شده است را دنبال کنید.https://fa.player.fm/legal

This story was originally published on HackerNoon at: https://hackernoon.com/how-to-merge-two-sorted-lists.
We can use LinkedList to merge both sorted lists, though there are considerations to doing it single or double-linked that may complicate the operation.
Check more stories related to programming at: https://hackernoon.com/c/programming. You can also check exclusive content about #leetcode, #data-structures, #computer-science, #tech, #programming, #learn-programming, #programming-tips, #competitive-coding, #hackernoon-es, and more.
This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page, and for more stories, please visit hackernoon.com.
The list should be made by splicing together the nodes of the first two lists. It could be singly linked or doubly linked. The number of nodes in both lists is in the range `[0, 50]`-100 <= 100` The first Linked node is usually called the head whereas the last one is called the tail. The solution has a solution and we’ll discuss it in terms of big O notation. We’re looking for a node with minimal value stored in it. We move the pointer to the next for LinkedList which has a head. We also need a current node for storing the link of the current node.

  continue reading

346 قسمت

Artwork
iconاشتراک گذاری
 
Manage episode 400581983 series 3474159
محتوای ارائه شده توسط HackerNoon. تمام محتوای پادکست شامل قسمت‌ها، گرافیک‌ها و توضیحات پادکست مستقیماً توسط HackerNoon یا شریک پلتفرم پادکست آن‌ها آپلود و ارائه می‌شوند. اگر فکر می‌کنید شخصی بدون اجازه شما از اثر دارای حق نسخه‌برداری شما استفاده می‌کند، می‌توانید روندی که در اینجا شرح داده شده است را دنبال کنید.https://fa.player.fm/legal

This story was originally published on HackerNoon at: https://hackernoon.com/how-to-merge-two-sorted-lists.
We can use LinkedList to merge both sorted lists, though there are considerations to doing it single or double-linked that may complicate the operation.
Check more stories related to programming at: https://hackernoon.com/c/programming. You can also check exclusive content about #leetcode, #data-structures, #computer-science, #tech, #programming, #learn-programming, #programming-tips, #competitive-coding, #hackernoon-es, and more.
This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page, and for more stories, please visit hackernoon.com.
The list should be made by splicing together the nodes of the first two lists. It could be singly linked or doubly linked. The number of nodes in both lists is in the range `[0, 50]`-100 <= 100` The first Linked node is usually called the head whereas the last one is called the tail. The solution has a solution and we’ll discuss it in terms of big O notation. We’re looking for a node with minimal value stored in it. We move the pointer to the next for LinkedList which has a head. We also need a current node for storing the link of the current node.

  continue reading

346 قسمت

Tất cả các tập

×
 
Loading …

به Player FM خوش آمدید!

Player FM در سراسر وب را برای یافتن پادکست های با کیفیت اسکن می کند تا همین الان لذت ببرید. این بهترین برنامه ی پادکست است که در اندروید، آیفون و وب کار می کند. ثبت نام کنید تا اشتراک های شما در بین دستگاه های مختلف همگام سازی شود.

 

راهنمای مرجع سریع

در حین کاوش به این نمایش گوش دهید
پخش