08 2019 档案

摘要:162. Find Peak Element A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠ nums[i+1], find a p 阅读全文
posted @ 2019-08-11 20:11 mingL 阅读(154) 评论(0) 推荐(0) 编辑
摘要:160. Intersection of Two Linked Lists Write a program to find the node at which the intersection of two singly linked lists begins. For example, the f 阅读全文
posted @ 2019-08-11 19:45 mingL 阅读(210) 评论(0) 推荐(0) 编辑
摘要:155. Min Stack Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. 阅读全文
posted @ 2019-08-03 21:57 mingL 阅读(163) 评论(0) 推荐(0) 编辑
摘要:154. Find Minimum in Rotated Sorted Array II Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0, 阅读全文
posted @ 2019-08-03 21:52 mingL 阅读(92) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示