OJ
DXT00
这个作者很懒,什么都没留下…
展开
-
电话号码去重
11位电话号码,由于都以1开头,求出每个号码与100,0000,0000的差值 (offset)然后用100,0000,0000bit位图,记录这个电话号是否重复。存储空间:100,0000,0000/8B 约为1.16G#include <iostream>using namespace std;#define SET_BIT(x,n) x|=(1<<...原创 2019-03-13 10:35:18 · 1914 阅读 · 0 评论 -
Leetcode -- 337. House Robber III -- 递归
337.House Robber IIIMedium165733FavoriteShareThe thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each h...转载 2019-08-10 15:20:33 · 172 阅读 · 0 评论 -
判断平衡二叉树
#include<algorithm>#include<vector>using namespace std;struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL)...原创 2019-08-12 11:00:00 · 183 阅读 · 0 评论 -
最小栈的实现
用一个栈存储数据再用另外一个栈统计每次push后的最小值。pop()时两个栈同时popgetMin()返回最小栈的栈顶元素#include<stack>#include<algorithm>#include<vector>#include<iostream>using namespace std;#define...原创 2019-08-21 09:50:42 · 147 阅读 · 0 评论 -
剑指offer -- 树
二叉树的下一个结点 - trick题目描述给定一个二叉树和其中的一个结点,请找出中序遍历顺序的下一个结点并且返回。注意,树中的结点不仅包含左右子结点,同时包含指向父结点的指针。参考:https://www.nowcoder.com/questionTerminal/9023a0c988684a53960365b889ceaf5e?f=discussion来源:牛客网思路:首先...转载 2019-08-12 15:30:36 · 146 阅读 · 0 评论 -
判断一个数是否是2的整数次幂
2的整数次幂右 2,4,8,16,32....他们的二进制数可表示为:2 0010 4 0100 8 1000 16 1,0000 32 10,0000 他们的二进制数减一可表示为:2 0001 4 0011 8 0111 16 0,1111 32 01,1111 所以只要判断一个...原创 2019-08-21 13:59:56 · 1371 阅读 · 1 评论 -
Leetcode --- 684. Redundant Connection 判断是否有环 /并查集
684.Redundant ConnectionMedium727196FavoriteShareIn this problem, a tree is anundirectedgraph that is connected and has no cycles.The given input is a graph that started as a tree with N n...转载 2019-08-14 19:29:58 · 310 阅读 · 0 评论 -
Leetcode--394. Decode String 递归
394.Decode StringGiven an encoded string, return its decoded string.The encoding rule is:k[encoded_string], where theencoded_stringinside the square brackets is being repeated exactlyktim...原创 2019-08-10 11:35:46 · 252 阅读 · 0 评论 -
剑指offer
变态跳台阶题目描述一只青蛙一次可以跳上1级台阶,也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。class Solution {public: int jumpFloorII(int number) { vector<int>cur(number + 1, 0); vector<vector<int...原创 2019-06-28 16:49:40 · 631 阅读 · 0 评论 -
字节跳动OJ
链接:https://www.nowcoder.com/questionTerminal/c0803540c94848baac03096745b55b9b来源:牛客网[编程题]万万没想到之抓捕孔连顺 -- 动态规划我叫王大锤,是一名特工。我刚刚接到任务:在字节跳动大街进行埋伏,抓捕恐怖分子孔连顺。和我一起行动的还有另外两名特工,我提议1. 我们在字节跳动大街的N个建筑中选...原创 2019-06-29 16:09:29 · 2589 阅读 · 0 评论 -
Leetcode--树
236.Lowest Common Ancestor of a Binary TreeGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to thedefinition of LCA on Wikipedia: “The lowest ...原创 2019-08-04 10:47:38 · 186 阅读 · 0 评论 -
Leetcode --621. Task Scheduler
621.Task SchedulerMedium1799314FavoriteShareGiven a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks. Tasks cou...转载 2019-08-05 10:15:41 · 159 阅读 · 0 评论 -
Leetcode动态规划 二
560.Subarray Sum Equals KGiven an array of integers and an integerk, you need to find the total number of continuous subarrays whose sum equals tok.Example 1:Input:nums = [1,1,1], k = 2O...转载 2019-08-02 10:46:00 · 116 阅读 · 0 评论 -
剑指offer -- 滑动窗口的最大值--双向队列deque
滑动窗口的最大值题目描述给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3,那么一共存在6个滑动窗口,他们的最大值分别为{4,4,6,6,6,5}; 针对数组{2,3,4,2,6,2,5,1}的滑动窗口有以下6个: {[2,3,4],2,6,2,5,1}, {2,[3,4,2],6,2,5,1}, {2,3,...转载 2019-08-13 15:08:09 · 250 阅读 · 0 评论 -
剑指offer -- 优先级队列/大顶堆,小顶堆
数据流中的中位数题目描述如何得到一个数据流中的中位数?如果从数据流中读出奇数个数值,那么中位数就是所有数值排序之后位于中间的数值。如果从数据流中读出偶数个数值,那么中位数就是所有数值排序之后中间两个数的平均值。我们使用Insert()方法读取数据流,使用GetMedian()方法获取当前读取数据的中位数。参考:https://www.nowcoder.com/questionTermi...转载 2019-08-13 16:26:56 · 683 阅读 · 0 评论 -
Leetcode 622-设计循环队列
622.Design Circular QueueDesign your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) pr...原创 2019-08-14 10:15:49 · 157 阅读 · 0 评论 -
Leetcode -- 332. Reconstruct Itinerary --优先级队列 / 图的后序遍历
332.Reconstruct ItineraryGiven a list of airline tickets represented by pairs of departure and arrival airports[from, to], reconstruct the itinerary in order. All of the tickets belong to a man w...原创 2019-08-14 14:17:10 · 261 阅读 · 0 评论 -
Leetcode -- 842. Split Array into Fibonacci Sequence
842.Split Array into Fibonacci SequenceMedium296102FavoriteShareGiven a stringSof digits, such asS = "123456579", we can split it into aFibonacci-like sequence[123, 456, 579].Formally, a...转载 2019-09-11 20:53:04 · 141 阅读 · 0 评论