上一页 1 2 3 4 5 6 7 8 ··· 14 下一页
摘要: Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3, 阅读全文
posted @ 2017-04-14 20:57 aiterator 阅读(94) 评论(0) 推荐(0) 编辑
摘要: 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 = "ADOBECO 阅读全文
posted @ 2017-04-14 20:41 aiterator 阅读(106) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2017-04-14 19:35 aiterator 阅读(83) 评论(0) 推荐(0) 编辑
摘要: Given a matrix, if an element is 0, set its entire row and column to 0. Do it in place. 题目大意就是将矩阵中等于0的点所在的行和列中的元素全部置为0; 并且要求不得声明额外的数组空间。 既然不得在额外的数组空间中 阅读全文
posted @ 2017-04-13 19:36 aiterator 阅读(99) 评论(0) 推荐(0) 编辑
摘要: See the picture below. You are given , and . is parallel to . You are also given the area ratio between and . You have to find the value of . 水题; 说一下题 阅读全文
posted @ 2017-04-12 21:44 aiterator 阅读(113) 评论(0) 推荐(0) 编辑
摘要: This is the tale of Zephyr, the greatest time traveler the world will never know. Even those who are aware of Zephyr's existence know very little abou 阅读全文
posted @ 2017-04-12 21:03 aiterator 阅读(234) 评论(0) 推荐(0) 编辑
摘要: 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 @ 2017-04-12 20:13 aiterator 阅读(83) 评论(0) 推荐(0) 编辑
摘要: Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. You shou 阅读全文
posted @ 2017-04-12 13:38 aiterator 阅读(147) 评论(0) 推荐(0) 编辑
摘要: Validate if a given string is numeric. Some examples: "0" = true " 0.1 " = true "abc" = false "1 a" = false "2e10" = true Note : It is intended for th 阅读全文
posted @ 2017-04-11 20:42 aiterator 阅读(157) 评论(0) 推荐(0) 编辑
摘要: Given a m x n grid filled with non negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2017-04-10 13:56 aiterator 阅读(87) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 ··· 14 下一页