逸朵 - 博客园

2017年11月23日

Leetcode 153: Find Minimum in Rotated Sorted Array

摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find 阅读全文

posted @ 2017-11-23 04:54 逸朵阅读(136) 评论(0) 推荐(0)

Leetcode 152: Maximum Product Subarray

摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4],t 阅读全文

posted @ 2017-11-23 04:35 逸朵阅读(97) 评论(0) 推荐(0)

Leetcode 150: Evaluate Reverse Polish Notation

摘要： Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another e 阅读全文

posted @ 2017-11-23 04:17 逸朵阅读(121) 评论(0) 推荐(0)

Leetcode 146: LRU Cache

摘要： Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) - Get the 阅读全文

posted @ 2017-11-23 02:49 逸朵阅读(129) 评论(0) 推荐(0)

Leetcode 142: Linked List Cycle II

摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up:Can you 阅读全文

posted @ 2017-11-23 02:00 逸朵阅读(116) 评论(0) 推荐(0)

2017年11月22日

Leetcode 139: Word Break

摘要： Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ 阅读全文

posted @ 2017-11-22 07:34 逸朵阅读(176) 评论(0) 推荐(0)

Leetcode 138: Copy List with Random Pointer

摘要： A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy 阅读全文

posted @ 2017-11-22 06:24 逸朵阅读(100) 评论(0) 推荐(0)

Leetcode 137: Single Number II

摘要： Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note:Your algorithm sh 阅读全文

posted @ 2017-11-22 05:51 逸朵阅读(110) 评论(0) 推荐(0)

Leetcode 133: Clone Graph

摘要： Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled 阅读全文

posted @ 2017-11-22 05:20 逸朵阅读(164) 评论(0) 推荐(0)

Leetcode 132: Palindrome Partitioning II

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning 阅读全文

posted @ 2017-11-22 04:00 逸朵阅读(127) 评论(0) 推荐(0)

Keep walking

公告