一月有phone interview 从今天起每天一个mock

第一次发帖 请大家支持啊求大米 求鼓励


2020年12月19日 第一天 mock
Problem 1: A peak element is an element that is strictly greater than its neighbors.
Given an integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.[i][/i]I did well on this problem, give both a linear solution and a log solution.

Problem 2: 459. Repeated Substring Pattern

However, I did very badly on this question in the sense that I even forgot the number of Divisor is bounded by sqrt(n) so the algorithm can be achieved on O(sqrt(n)*n) in the worst case.

今天mock了三道题 最后一道的时候出了问题test了很久都没有debug出来
616. Add Bold Tag in String
我做这题时忘了控制 i，j指针的长度 导致出了问题

今天又做了一个 一个easy 两个medium 在规定时间内做完了 但是第三个问题我用了leetcode debug 希望下次能用纸自己debug也有充分的时间