![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
实习刷题笔记
麻花不好吃
这个作者很懒,什么都没留下…
展开
-
LeetCode周赛159
1232. Check If It Is a Straight Line检查是否为直线,暴力算斜率,但要注意分母为0的情况class Solution {public: bool checkStraightLine(vector<vector<int>>& coordinates) { double n1 = coordinates[1...原创 2019-10-21 21:08:15 · 142 阅读 · 0 评论 -
LeetCode双周赛11
1228. Missing Number In Arithmetic Progression等差数列找出缺项。class Solution {public: int missingNumber(vector<int>& arr) { int vsize = arr.size(); int n = (arr[vsize - 1] - ...原创 2019-10-20 10:28:35 · 323 阅读 · 0 评论 -
LeetCode周赛158
今天周赛就是暴力出奇迹。。。1221. Split a String in Balanced Strings类似于括号匹配,不用括号匹配做也行,用sum统计遇到L,++,else --,sum == 0就为一个子串。class Solution {public: int balancedStringSplit(string s) { stack<char>...原创 2019-10-13 17:25:18 · 108 阅读 · 0 评论 -
LeetCode周赛155
1200. Minimum Absolute Difference[1200.MinimumAbsoluteDifference]最小绝对差,遍历找出最小差,插入vector即可。class Solution {public: vector<vector<int>> minimumAbsDifference(vector<int>& arr)...原创 2019-09-23 16:24:17 · 146 阅读 · 0 评论 -
LeetCode周赛156
1207. Unique Number of Occurrences两次计数,比较出现次数是否唯一class Solution {public: bool uniqueOccurrences(vector<int>& arr) { map<int, int> m; for (int i = 0; i < arr.s...原创 2019-09-30 15:43:42 · 97 阅读 · 0 评论 -
LeetCode周赛157
1217. Play with Chips奇数移动cost1,偶数移动cost0class Solution {public: int cnt[2]; int minCostToMoveChips(vector<int>& chips) { for (int i = 0; i < chips.size(); i++) ...原创 2019-10-07 09:10:00 · 105 阅读 · 0 评论 -
LeetCode刷题复习
内容参考CYC大佬的LeetCode复习指南算法思想复习1.1双指针双指针求和,先使数组有序,然后根据大小判断哪个指针移动。叠加时需要考虑是否爆int甚至是大数运算。L633需要考虑从0开始,两个数相等也可,爆int。字母注意大小写的考虑。指针在数组或容器中移动,需要考虑,所指是否溢出。...原创 2019-10-11 20:14:44 · 245 阅读 · 0 评论