ผลต่างระหว่างรุ่นของ "Adt lab/Data structure problems 1/hints"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) (หน้าที่ถูกสร้างด้วย 'Hints for Data structure problems 1 * UVa 11988 - Broken Keyboard (a.k.a. Beiju Text) * UVa 1093...') |
Jittat (คุย | มีส่วนร่วม) |
||
| แถว 2: | แถว 2: | ||
* UVa 11988 - Broken Keyboard (a.k.a. Beiju Text) | * UVa 11988 - Broken Keyboard (a.k.a. Beiju Text) | ||
| + | ** Maintain a list of characters typed. Make sure you follow the current location. | ||
* UVa 10935 - Throwing cards away I | * UVa 10935 - Throwing cards away I | ||
| − | * UVa 514 - Rails | + | ** Maintain a list of cards. |
| + | * UVa 514 - Rails | ||
| + | ** Try to simulate how the coaches move. At any point, there is a very limited way you can move the coaches. | ||
* UVa 699 - The Falling Leaves | * UVa 699 - The Falling Leaves | ||
| + | ** Reading the input is the probably the hardest step. You may want to use recursion to read the input, build a tree, and find the solution | ||
* UVa 299 - Train swapping | * UVa 299 - Train swapping | ||
รุ่นแก้ไขเมื่อ 09:17, 17 พฤศจิกายน 2559
Hints for Data structure problems 1
- UVa 11988 - Broken Keyboard (a.k.a. Beiju Text)
- Maintain a list of characters typed. Make sure you follow the current location.
- UVa 10935 - Throwing cards away I
- Maintain a list of cards.
- UVa 514 - Rails
- Try to simulate how the coaches move. At any point, there is a very limited way you can move the coaches.
- UVa 699 - The Falling Leaves
- Reading the input is the probably the hardest step. You may want to use recursion to read the input, build a tree, and find the solution
- UVa 299 - Train swapping
- UVa 296 - Safebreaker
- UVa 686 - Goldbach's Conjecture (II)
- (optional) UVa 11234 - Expressions
