每日三题 day9
Rotting Oranges - 简单的遍历/图的存储,但是错在边界上,数iteration的时候是 while - do 还是 do - until
Merge Two Sorted Lists - 链表的基础操作,但是忘了挪current指针导致一直在刷新head。。。
Find First and Last Position of Element in Sorted Array - 二分查找的变种,算法和想法都没问题,但是又在边界条件上错了N次。。外加又一次把tail打错字成了target。。
8.9 Day 9打卡:
Find the Smallest Divisor Given a Threshold: Binary Search
Maximum Product of Splitted Binary Tree
Longest Increasing Path in a Matrix
Rotting Oranges