| | | | |

2016年11月19日

✡ leetcode 162. Find Peak Element --------- java

摘要： A peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], find a peak element and return its inde 阅读全文

posted @ 2016-11-19 23:38 xiaoba1203 阅读(215) 评论(0) 推荐(0) 编辑

✡ leetcode 160. Intersection of Two Linked Lists 求两个链表的起始重复位置 --------- java

摘要： Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: begin to in 阅读全文

posted @ 2016-11-19 23:20 xiaoba1203 阅读(217) 评论(0) 推荐(0) 编辑

leetcode 155. Min Stack --------- java

摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Remov 阅读全文

posted @ 2016-11-19 15:45 xiaoba1203 阅读(314) 评论(0) 推荐(0) 编辑

leetcode 154. Find Minimum in Rotated Sorted Array II --------- java

摘要： Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed? Would this affect the run-time complexity? How and why? Suppose a 阅读全文

posted @ 2016-11-19 14:55 xiaoba1203 阅读(127) 评论(0) 推荐(0) 编辑

2016年11月19日

公告