ผลต่างระหว่างรุ่นของ "Algo lab/notes/lists 67"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 12: แถว 12:
 
** mid65_zamoozooma - linked lists, insertion (<tt>push_front</tt>, <tt>push_back</tt>), deletion
 
** mid65_zamoozooma - linked lists, insertion (<tt>push_front</tt>, <tt>push_back</tt>), deletion
 
*** You need to do some book keeping to make sure you know that some number is in the list.
 
*** You need to do some book keeping to make sure you know that some number is in the list.
 +
*** Since the numbers of the balls are in the range 1 - 200000, you can simply use an array to for that.  You have to be careful to update the array when balls are removed as well.
  
 
* Stacks ([https://en.wikipedia.org/wiki/Stack_(abstract_data_type) wikipedia])
 
* Stacks ([https://en.wikipedia.org/wiki/Stack_(abstract_data_type) wikipedia])

รุ่นแก้ไขเมื่อ 03:14, 26 สิงหาคม 2567

Linked list tasks

  • Linked lists
    • mid61_cookies - linked lists insertion, traversal, and deletion
    • mid62_bonus - linked lists, iteration, insertion
    • mid64_colorrocks - linked lists (or array)
    • mid65_zamoozooma - linked lists, insertion (push_front, push_back), deletion
      • You need to do some book keeping to make sure you know that some number is in the list.
      • Since the numbers of the balls are in the range 1 - 200000, you can simply use an array to for that. You have to be careful to update the array when balls are removed as well.

2D-array tasks

  • mid63_table
  • mid64_slot - you can try all possible rotations (probably using 3-level nested loops)
ดึงข้อมูลจาก "http://158.108.32.49/wiki/index.php?title=Algo_lab/notes/lists_67&oldid=59524"