数据结构篇
数据结构篇
桑榆207
在最终的结果到来之前,任何肯定会赢之类的话都是虚无缥缈的。
展开
-
LeetCode 402. 移掉K位数字 单调栈
思路:给出一串数字,移除k个,例如:num = "1432219", k = 3,那么我们可以发现,需要移除的是4 3 2这三个数字。我们发现,如果维护一个单调递增的栈,如果while当前元素小于栈顶元素,那么就不停出栈。我们发现如果“12345” k=2怎么办?我们先将输入的数字最后面的位置填充一个0,就可以处理这种情况,这样可以保证答案的正确性。代码:class Soluti...原创 2020-04-16 21:59:54 · 184 阅读 · 0 评论 -
LeetCode 113. 路径总和 II 二叉树搜索+记录路径
思路:当搜索到叶子节点时,我们看当前的s是否为0即可。代码:/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left...原创 2020-04-07 22:03:52 · 174 阅读 · 0 评论 -
LeetCode 437. 路径总和 III 树上前缀和+DFS
思路:因为要求的是树上连续的和值,类似于字段和,可以用前缀和来求解。每走到一个层次,我们看当前的层次和上面的哪一个层之间的和值为给定值即可。代码:/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode ...原创 2020-04-07 21:47:14 · 265 阅读 · 0 评论 -
华东师范大学 2018 研究生面试机考 (软件工程) 题解
A#include<bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<=b;i++)#define dep(i,a,b) for(int i=a;i>=b;i--)#define LL long long#define INF 0x3f3f3f3f3fusing namespace std;int dx[10]=...原创 2020-03-29 16:31:49 · 1538 阅读 · 0 评论 -
LeetCode 最长不含重复字符的子字符串 尺取法
问题:请从字符串中找出一个最长的不包含重复字符的子字符串,计算该最长子字符串的长度思路1:枚举每一个字符si,维持左指针left,代表最后一个重复的字符所在的位置,而且sbe+1~si-1之间没有重复的字符。当cntsi>left时,我们会更新left=cnti,每次我们更新字符si所在的最大位置cntsi=i。每次我们会得到以第i个字符结尾的不重复字符的串的长度,每次取最大...原创 2020-03-28 20:25:37 · 300 阅读 · 0 评论 -
LeetCode 11. 盛最多水的容器 尺取法
11. 盛最多水的容器难度中等1206给你n个非负整数a1,a2,...,an,每个数代表坐标中的一个点(i,ai) 。在坐标内画n条垂直线,垂直线i的两个端点分别为(i,ai) 和 (i, 0)。找出其中的两条线,使得它们与x轴共同构成的容器可以容纳最多的水。说明:你不能倾斜容器,且n的值至少为 2。图中垂直线代表输入数组 [1,8,6,2...原创 2020-03-17 22:32:38 · 146 阅读 · 0 评论 -
Tree Recovery POJ - 2255 前中缀求后缀 DFS
题意:已知二叉树的前中序,求后序。思路:例如 PRE=DBACEGF IN=ABCDEFG首先,我们会把这棵树分成三部分ROOT=PRE[0]、左子树(BAC),右子树(EFG),后序遍历即为左子树、右子树、根。那么我们再把左子树、右子树(若仍然存在)分解了,就可以得到整个树的后序遍历了。这是个递归的过程。代码:#include<bits/stdc++.h...原创 2020-03-15 16:15:18 · 137 阅读 · 0 评论 -
Complicated Expressions HDU - 1123 中缀、后缀表达式互转
题意:给出表达式,可能会有多余的括号,去掉这些多余的括号。思路:先把表达式转化成后缀,不带括号,再利用后缀转化成中缀,带上括号,要注意括号的位置。代码:#include<bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<=b;i++)#define dep(i,a,b) for(int i=a;i>=b;...原创 2020-03-14 20:45:46 · 245 阅读 · 1 评论 -
数据结构--+、-、*、/、(、)表达式求值
以(3+5)*100+22*2+34/2 为例1、当遇到数字时,入数字栈。2、当遇到左括号(或者是符号优先级比栈顶优先级高的时候,入符号栈。3、当栈顶为(,当前符号为),出符号栈。4、若当前符号优先级小于栈顶优先级,则连续出两个数字,一个运算符,进行运算后,压入数字栈。最好一开始在符号栈内压入一个'\0',当栈顶为'\0'且当前符号也为'\0',运算结束。#incl...原创 2020-03-14 17:38:31 · 885 阅读 · 0 评论 -
LeetCode 209. 长度最小的子数组 尺取法
难度中等203给定一个含有n个正整数的数组和一个正整数s ,找出该数组中满足其和≥ s的长度最小的连续子数组。如果不存在符合条件的连续子数组,返回 0。示例:输入: s = 7, nums = [2,3,1,2,4,3]输出: 2解释: 子数组[4,3]是该条件下的长度最小的连续子数组。思路:利用尺取法,i作为右端点,left作为左端点,当累加的前缀和&g...原创 2020-03-13 12:34:48 · 142 阅读 · 0 评论 -
1265. 数星星 树状数组
思路:因为给定的坐标已经按照纵坐标排好序了,那么对于每个点(x,y),它是第几层取决于它左下部有多少个点,因为他的纵坐标是最大的,那么我们就利用树状数组求出前缀和s(每次在x位置处,单点修改此点的值+1),即第s层的星星数+1。再把这个点放入树状数组中即可。代码:#include<iostream>#include<algorithm>#define re...原创 2020-02-25 23:26:08 · 204 阅读 · 0 评论 -
并查集 JAVA
An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the n...原创 2019-02-20 10:39:05 · 273 阅读 · 0 评论 -
并查集 JAVA
Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to s...原创 2019-02-20 10:40:23 · 285 阅读 · 0 评论 -
字典树 增删查改变式
度熊手上有一本神奇的字典,你可以在它里面做如下三个操作: 1、insert : 往神奇字典中插入一个单词 2、delete: 在神奇字典中删除所有前缀等于给定字符串的单词 3、search: 查询是否在神奇字典中有一个字符串的前缀等于给定的字符串 Input这里仅有一组测试数据。第一行输入一个正整数N(1≤N≤100000)N(1≤N≤100000),代表度熊对于字典的操...原创 2019-02-20 17:27:57 · 212 阅读 · 0 评论 -
贪心 || 贪心+并查集
A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the s...原创 2019-02-20 17:38:21 · 228 阅读 · 0 评论 -
并查集 逆向思考
In order to strengthen the defense ability, many stars in galaxy allied together and built many bidirectional tunnels to exchange messages. However, when the Galaxy War began, some tunnels were destro...原创 2019-02-20 20:48:57 · 202 阅读 · 0 评论 -
带权并查集 离散化思想 并查集路径方向
An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the n...原创 2019-02-20 21:53:02 · 146 阅读 · 0 评论 -
hdu 5806 乘法原理 || 尺取法 || 二分法
DescriptionNanoApe, the Retired Dog, has returned back to prepare for for the National Higher Education Entrance Examination!In math class, NanoApe picked up sequences once again. He wrote down a ...原创 2019-02-17 23:04:37 · 148 阅读 · 0 评论 -
POJ 2566 尺取法+前缀和排序
Signals of most probably extra-terrestrial origin have been received and digitalized by The Aeronautic and Space Administration (that must be going through a defiant phase: "But I want to use feet, no...原创 2019-02-17 21:47:10 · 148 阅读 · 0 评论 -
hdu 1542 Atlantis 扫描线+线段树+离散化
There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps describe diff...原创 2019-02-17 13:55:41 · 179 阅读 · 0 评论 -
POJ 1195 Mobile phones 二维树状数组模板
Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and columns numbe...原创 2019-02-17 15:16:26 · 161 阅读 · 0 评论 -
二分 最小值最大化
【问题描述】记得上学那会, Fbs同学经常会欺负萝卜同学。有一次,他出了这么一道题目,想为难一下萝卜同学。题目是这样的: 有N个整数X_i, X_i值的范围从0到1000000000。要从中选出C个数( 2<=C<=N),使得任意两个数差的绝对值的最小值尽可能大,求这个最大值。 由于数据太大, 这次萝卜同学的确被难住了,怎么办呢,请你来帮帮萝卜同学吧! 【输入格式】 第一行是N和...原创 2019-02-17 16:29:45 · 519 阅读 · 0 评论 -
POJ 1064 二分+小数转化整数控制精度 错了n次
http://poj.org/problem?id=1064DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the m...原创 2019-02-17 17:55:41 · 187 阅读 · 0 评论 -
POJ 2109 double大数模拟 || 二分
http://poj.org/problem?id=2109Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the...原创 2019-02-17 16:54:54 · 105 阅读 · 0 评论 -
规律 求数方的末位
Given a positive integer N, you should output the most right digit of N^N. InputThe input contains several test cases. The first line of the input is a single integer T which is the number of test...原创 2019-02-16 21:42:33 · 113 阅读 · 0 评论 -
尺取法
John has nn points on the X axis, and their coordinates are (x[i],0),(i=0,1,2,…,n−1)(x[i],0),(i=0,1,2,…,n−1). He wants to know how many pairs<a,b><a,b>that |x[b]−x[a]|≤k.(a<b)|x[b]−x[a]...原创 2019-02-16 21:39:08 · 221 阅读 · 0 评论 -
STL二分 数组合并思想
The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b + c + d = 0 . In th...原创 2019-02-16 20:42:32 · 144 阅读 · 0 评论 -
HDU 3183 A Magic Lamp 贪心+逆向思维
Kiki likes traveling. One day she finds a magic lamp, unfortunately the genie in the lamp is not so kind. Kiki must answer a question, and then the genie will realize one of her dreams. The question ...原创 2019-02-16 17:44:24 · 130 阅读 · 0 评论 -
二分+数组合并思想
Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X. InputThere...原创 2019-02-16 20:10:46 · 139 阅读 · 1 评论 -
模拟 仔细分析下复杂度
In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to be n plus the sum of the digits of n. (The d stands for dig...原创 2019-02-16 20:34:31 · 110 阅读 · 0 评论 -
二分 最大值最小化
球球大作战Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem Description小Z最近迷上了球球大作战,他准备出一个与球球大作战相似的题目来考考大家...原创 2019-02-16 16:12:21 · 437 阅读 · 0 评论 -
HDU1540:Tunnel Warfare 线段树+思维转化(最小最大值)
During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a line. Except t...原创 2019-02-16 15:43:00 · 213 阅读 · 0 评论 -
HDU 6315 Naive Operations 线段树+转化思想
In a galaxy far, far away, there are two integer sequence a and b of length n. b is a static permutation of 1 to n. Initially a is filled with zeroes. There are two kind of operations: 1. add l r: ...原创 2019-02-16 14:43:27 · 137 阅读 · 0 评论 -
导数二分 求最值
Now, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100) Can you find the minimum value when x is between 0 and 100.InputThe first line of the input contains an intege...原创 2019-02-15 23:34:58 · 188 阅读 · 0 评论 -
二分 确定精度
Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100; Now please try your lucky.InputThe first line of the input contains an integer T(1<=T&l...原创 2019-02-15 23:33:28 · 334 阅读 · 0 评论 -
二维RMQ模板题
Paul draw a big m*n matrix A last month, whose entries Ai,j are all integer numbers ( 1 <= i <= m, 1 <= j <= n ). Now he selects some sub-matrices, hoping to find the maximum number. Then ...原创 2019-02-15 23:32:25 · 123 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers 线段树区间同时加、区间求和
http://poj.org/problem?id=3468DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a...原创 2019-02-14 21:17:36 · 97 阅读 · 0 评论 -
POJ 2456 Aggressive cows 二分+贪心
Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000). His C (2 <=...原创 2019-02-12 22:21:40 · 202 阅读 · 0 评论 -
POJ 1905 Expanding Rods 二分+计算几何
When a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where C is the coefficient of heat expansion. When a thin rod is mounted on two solid walls and then heate...原创 2019-02-12 22:00:37 · 127 阅读 · 0 评论 -
POJ 3258 River Hopscotch (最小值最大化 二分+贪心)
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a ro...原创 2019-02-12 16:23:47 · 183 阅读 · 0 评论