2015年10月4日

41. First Missing Positive (HashTable)

摘要: Given an unsorted integer array, find the first missing positive integer. For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2. Your algorithm s 阅读全文

posted @ 2015-10-04 20:18 joannae 阅读(161) 评论(0) 推荐(0) 编辑

49. Group Anagrams (string, HashTable)

摘要: Given an array of strings, group anagrams together. For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return: [ ["ate", "eat","tea"], [" 阅读全文

posted @ 2015-10-04 19:38 joannae 阅读(150) 评论(0) 推荐(0) 编辑

76. Minimum Window Substring (String, Map)

摘要: Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECODEBA... 阅读全文

posted @ 2015-10-04 19:01 joannae 阅读(156) 评论(0) 推荐(0) 编辑

63. Unique Paths II (Graph; DP)

摘要: Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i... 阅读全文

posted @ 2015-10-04 18:35 joannae 阅读(134) 评论(0) 推荐(0) 编辑

62. Unique Paths (Graph; DP)

摘要: A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文

posted @ 2015-10-04 18:33 joannae 阅读(159) 评论(0) 推荐(0) 编辑

64. Minimum Path Sum (Graph; DP)

摘要: Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo... 阅读全文

posted @ 2015-10-04 18:31 joannae 阅读(193) 评论(0) 推荐(0) 编辑

126. Word Ladder II( Queue; BFS)

摘要: Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such th 阅读全文

posted @ 2015-10-04 17:34 joannae 阅读(268) 评论(0) 推荐(0) 编辑

130. Surrounded Regions (Graph; DFS)

摘要: Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded ... 阅读全文

posted @ 2015-10-04 16:57 joannae 阅读(208) 评论(0) 推荐(0) 编辑

138. Copy List with Random Pointer (Graph, Map; DFS)

摘要: 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 @ 2015-10-04 16:41 joannae 阅读(210) 评论(0) 推荐(0) 编辑

133. Clone Graph (Graph, Map; DFS)

摘要: 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 @ 2015-10-04 16:37 joannae 阅读(194) 评论(0) 推荐(0) 编辑

73. Set Matrix Zeroes (Array)

摘要: Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Follow up: Did you use extra space? A straight forward s 阅读全文

posted @ 2015-10-04 16:21 joannae 阅读(177) 评论(0) 推荐(0) 编辑

79. Word Search (Array; DFS,Back-Track)

摘要: Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjac 阅读全文

posted @ 2015-10-04 16:15 joannae 阅读(159) 评论(0) 推荐(0) 编辑

59. Spiral Matrix II (Array)

摘要: Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. For example, Given n = 3, You should return the follow 阅读全文

posted @ 2015-10-04 15:59 joannae 阅读(134) 评论(0) 推荐(0) 编辑

54. Spiral Matrix (Graph)

摘要: Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example,Given the following matrix:[ [ 1,... 阅读全文

posted @ 2015-10-04 15:56 joannae 阅读(186) 评论(0) 推荐(0) 编辑

74. Search a 2D Matrix (Graph; Divide-and-Conquer)

摘要: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted f 阅读全文

posted @ 2015-10-04 15:51 joannae 阅读(159) 评论(0) 推荐(0) 编辑

48. Rotate Image (Array)

摘要: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 阅读全文

posted @ 2015-10-04 15:46 joannae 阅读(124) 评论(0) 推荐(0) 编辑

119. Pascal's Triangle II (Graph; WFS)

摘要: Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use... 阅读全文

posted @ 2015-10-04 15:43 joannae 阅读(134) 评论(0) 推荐(0) 编辑

118. Pascal's Triangle (Array)

摘要: Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return 阅读全文

posted @ 2015-10-04 15:27 joannae 阅读(184) 评论(0) 推荐(0) 编辑

127. Word Ladder (Tree, Queue; WFS)

摘要: Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, 阅读全文

posted @ 2015-10-04 15:21 joannae 阅读(362) 评论(0) 推荐(0) 编辑

117. Populating Next Right Pointers in Each Node II (Tree; WFS)

摘要: Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文

posted @ 2015-10-04 14:58 joannae 阅读(167) 评论(0) 推荐(0) 编辑

导航