北叶青藤

2016年7月18日

摘要： Spiral Matrix I Given an integer n, generate a square matrix filled with elements from 1 to n^2 in spiral order. Example Given n = 3, You should retur 阅读全文

posted @ 2016-07-18 11:44 北叶青藤阅读(209) 评论(0) 推荐(0)

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 北叶青藤阅读(369) 评论(0) 推荐(0)

130. Surrounded Regions

摘要： 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 surround 阅读全文

posted @ 2016-07-18 05:43 北叶青藤阅读(217) 评论(0) 推荐(0)

2016年7月17日

Find Minimum in Rotated Sorted Array I & II

摘要： Find Minimum in Rotated Sorted Array I Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 阅读全文

posted @ 2016-07-17 22:15 北叶青藤阅读(182) 评论(0) 推荐(0)

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 @ 2016-07-17 20:10 北叶青藤阅读(180) 评论(0) 推荐(0)

71. Simplify Path

摘要： Given an absolute path for a file (Unix-style), simplify it. Have you met this question in a real interview? Yes Example "/home/", => "/home" "/a/./b/ 阅读全文

posted @ 2016-07-17 01:02 北叶青藤阅读(220) 评论(0) 推荐(0)

2016年7月16日

Integer to Roman & Roman to Integer

摘要： Integer to Roman Given an integer, convert it to a roman numeral. The number is guaranteed to be within the range from 1 to 3999. Integer to Roman Giv 阅读全文

posted @ 2016-07-16 23:04 北叶青藤阅读(232) 评论(0) 推荐(0)

Distinct Subsequences

摘要： Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from t 阅读全文

posted @ 2016-07-16 11:39 北叶青藤阅读(191) 评论(0) 推荐(0)

72. Edit Distance

摘要： Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have 阅读全文

posted @ 2016-07-16 11:21 北叶青藤阅读(199) 评论(0) 推荐(0)

278. First Bad Version

摘要： The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the fo 阅读全文

posted @ 2016-07-16 05:12 北叶青藤阅读(186) 评论(0) 推荐(0)

公告