随笔分类 -  搜索

121. Best Time to Buy and Sell Stock——Leetcode
摘要：Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2018-09-14 11:13 丶Blank 阅读(241) 评论(0) 推荐(0)
4Sum——LeetCode
摘要：Given an arraySofnintegers, are there elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in the array which gives the sum of ... 阅读全文
posted @ 2015-04-08 00:24 丶Blank 阅读(150) 评论(0) 推荐(0)
Word Ladder——LeetCode
摘要：Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be ... 阅读全文
posted @ 2015-04-06 19:49 丶Blank 阅读(219) 评论(0) 推荐(0)
Search a 2D Matrix ——LeetCode
摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文
posted @ 2015-04-05 20:47 丶Blank 阅读(268) 评论(0) 推荐(0)
3Sum——LeetCode
摘要：Given an arraySofnintegers, are there elementsa,b,cinSsuch thata+b+c= 0? Find all unique triplets in the array which gives the sum of zero.Note:Elemen... 阅读全文
posted @ 2015-03-29 20:30 丶Blank 阅读(204) 评论(0) 推荐(0)
题目1384：二维数组中的查找
摘要：题目描述：在一个二维数组中，每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。输入：输入可能包含多个测试样例，对于每个测试案例，输入的第一行为两个整数m和n(1#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define REP(i,j,k) for(int i = j ; i =1); ... 阅读全文
posted @ 2013-07-11 21:59 丶Blank 阅读(265) 评论(0) 推荐(0)