LeetCode查找问题
文章平均质量分 83
大疯疯
这个作者很懒,什么都没留下…
展开
-
LeetCode 242. Valid Anagram (map使用)
一、题目Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.Note:You m原创 2017-05-05 20:50:32 · 366 阅读 · 0 评论 -
LeetCode 1.Two Sum map 初次使用Markdown*****
外传 经过室友推荐blog转战Markdown编辑,初次使用还觉得挺不方便需要那么多快捷键,不如鼠标点的快。今天这一篇文章才写一半就觉得很好用,就像电脑操作用鼠标点击和windows快捷键操作一样爽,在此向还没转战的朋友推荐,顺便练习自己的操作。 不方便的是代码高亮显示不好。 参考快速上手 记录插入链接格式 题目题意注意思路1代码原创 2017-05-10 14:44:09 · 1007 阅读 · 0 评论 -
LeetCode 451. Sort Characters By Frequency ***** map按值排序转vector,优先队列,频率当下标
一、题目Given a string, sort it in decreasing order based on the frequency of characters.Example 1:Input:"tree"Output:"eert"Explanation:'e' appears twice while 'r' and 't' both appear once.原创 2017-05-08 21:49:13 · 539 阅读 · 0 评论 -
LeetCode 290. Word Pattern 双map *****
一、题目Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter inpattern and a non-empty word in str原创 2017-05-07 15:30:26 · 306 阅读 · 0 评论 -
LeetCode 220. Contains Duplicate III *****理解条件,查找表
题目题意注意思路代码结果题目 Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the原创 2017-05-18 11:15:42 · 443 阅读 · 0 评论 -
LeetCode 219. Contains Duplicate II ***** 滑动窗口,查找表 217.Contains Duplicate
219题目题意注意思路代码结果217Contains Duplicate 题目题意思路代码结果219题目 Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nu原创 2017-05-18 10:51:51 · 356 阅读 · 0 评论 -
LeetCode 149. Max Points on a Line **** 灵活键,查找表
题目题意注意思路代码结果题目 Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. Subscribe to see which companies asked this question.题意 在一个2D平面内有n个点,找到原创 2017-05-17 14:53:25 · 223 阅读 · 0 评论 -
LeetCode 349. Intersection of Two Arrays 350. Intersection of Two Arrays II set map使用 ****
之前LeetCode的题主要是对数字,字符串处理,从今天开始做一些查找方面的题。同时需要熟练掌握C++标准库STL为我们提供的容器,算法,主要是map,set,unordered_set,unordered_map的使用。两道题都挺简单,放在一块来写。一、第一题题目Given two arrays, write a function to compute their intersect原创 2017-05-04 21:40:20 · 328 阅读 · 0 评论 -
LeetCode 447. Number of Boomerangs ***** 灵活键,查找表
题目题意注意思路代码结果题目 Given n points in the plane that are all pairwise distinct, a “boomerang” is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k原创 2017-05-16 20:56:52 · 464 阅读 · 0 评论 -
LeetCode 49. Group Anagrams ***** multiset
题目题意注意我的思路实现不好代码结果参考思路实现multiset代码结果题目 Given an array of strings, group anagrams together. For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Return: [ [“ate”,原创 2017-05-16 15:41:07 · 262 阅读 · 0 评论 -
LeetCode 454. 4Sum II ***** 灵活的设定键
题目题意注意思路代码结果区别于184Sum题目 Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero. To make problem a bit eas原创 2017-05-16 14:29:39 · 412 阅读 · 0 评论 -
LeectCode 16. 3Sum Closest *** 对撞指针
题目 Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exa原创 2017-05-16 11:30:28 · 232 阅读 · 0 评论 -
LeetCode 202. Happy Number
一、题目Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the s原创 2017-05-05 21:03:39 · 280 阅读 · 0 评论 -
LeetCode 15.3Sum 18.4Sum 对撞指针 ****
题目 15-3Sum题意注意思路代码结果题目 18-4Sum题意注意思路代码结果题目 15-3Sum Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which give原创 2017-05-11 22:10:48 · 502 阅读 · 0 评论