随笔分类 -  Affirm

上一页 1 2
126. Word Ladder I & II
摘要：Word Ladder I Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Onl 阅读全文
posted @ 2016-07-18 07:03 北叶青藤 阅读(368) 评论(0) 推荐(0)
Add Two Numbers I & II
摘要：Add Two Numbers I You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, 阅读全文
posted @ 2016-07-16 00:11 北叶青藤 阅读(228) 评论(0) 推荐(0)
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 @ 2016-07-15 22:48 北叶青藤 阅读(380) 评论(0) 推荐(0)
42. Trapping Rain Water I && II
摘要：Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. 阅读全文
posted @ 2016-07-14 09:02 北叶青藤 阅读(241) 评论(0) 推荐(0)
200. Number of Islands I & II
摘要：Given a boolean 2D matrix, find the number of islands. Notice 0 is represented as the sea, 1 is represented as the island. If two 1 is adjacent, we co 阅读全文
posted @ 2016-07-13 10:39 北叶青藤 阅读(234) 评论(0) 推荐(0)
211. Add and Search Word - Data structure design
摘要：Design a data structure that supports the following two operations: addWord(word) andsearch(word) search(word) can search a literal word or a regular 阅读全文
posted @ 2016-07-13 05:58 北叶青藤 阅读(253) 评论(0) 推荐(0)
Reverse Pairs
摘要：For an array A, if i < j, and A [i] > A [j], called (A [i], A [j]) is a reverse pair.return total of reverse pairs in A. For an array A, if i < j, and 阅读全文
posted @ 2016-07-06 02:01 北叶青藤 阅读(220) 评论(0) 推荐(0)
Two Sum I & II & III & IV
摘要：Two Sum I Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of 阅读全文
posted @ 2016-07-04 07:13 北叶青藤 阅读(326) 评论(0) 推荐(0)

上一页 1 2