【CODE】next number && stack

最新推荐文章于 2024-02-23 13:50:53 发布
最新推荐文章于 2024-02-23 13:50:53 发布
阅读量532 收藏
点赞数
分类专栏： C/C++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Li_Jiaqian/article/details/104543873
版权

目录

375. Guess Number Higher or Lower II

294.Flip Game II 

739. Daily Temperatures

503. Next Greater Element II

556. Next Greater Element III

394. Decode String

150. Evaluate Reverse Polish Notation

375. Guess Number Higher or Lower II

Medium

681992Add to ListShare

We are playing the Guess Game. The game is as follows:

I pick a number from 1 to n. You have to guess which number I picked.

Every time you guess wrong, I'll tell you whether the number I picked is higher or lower.

However, when you guess a particular number x, and you guess wrong, you pay $x. You win the game when you guess the number I picked.

Example:

n = 10, I pick 8.

First round:  You guess 5, I tell you that it's higher. You pay $5.
Second round: You guess 7, I tell you that it's higher. You pay $7.
Third round:  You guess 9, I tell you that it's lower. You pay $9.

Game over. 8 is the number I picked.
You end up paying $5 + $7 + $9 = $21.

Given a particular n ≥ 1, find out how much money you need to have to guarantee a win.

#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
/*Runtime: 20 ms, faster than 77.28% of C++ online submissions for Guess Number Higher or Lower II.
Memory Usage : 9 MB, less than 83.33% of C++ online submissions for Guess Number Higher or Lower II.
https://www.cnblogs.com/grandyang/p/5677550.html*/
int getMoneyAmount(int n) {
	vector<vector<int> > dp(n + 1, vector<int>(n + 1));
	//dp[i][j]
	for (int j=2; j <= n; j++) {
		for (int i=j- 1; i >0; i--) {
			int global_min = INT_MAX;
			for (int k = i+1; k < j; k++) {
				int local_max = k + max(dp[i][k - 1], dp[k + 1][j]);
				global_min = min(global_min, local_max);
			}
			if (i==j-1) dp[i][j] = i;
			else dp[i][j] = global_min;
		}
	}
	return dp[1][n];
}
int main() {
	cout << getMoneyAmount(10);
	return 0;
}

294.Flip Game II 

You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take turns to flip two consecutive "++" into "--". The game ends when a person can no longer make a move and therefore the other person will be the winner.

Write a function to determine if the starting player can guarantee a win.

Example:

Input: s = "++++"

Output: true 
Explanation: The starting player can guarantee a win by flipping the middle "++" to become "+--+"

Follow up:
Derive your algorithm's runtime complexity.

#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
/*293.Flip Game：将 ++ 变成 --*/
vector<string> generatePossibleNextMoves1(string s) {
	vector<string> res;
	for (int i = 1; i < s.size(); i++) {
		if (s[i] == '+' && s[i - 1] == '+') {
			s[i] = '-'; s[i - 1] = '-';
			res.push_back(s);
			s[i] = '+'; s[i - 1] = '+';
			/*或者是：res.push_back(s.substr(0,i-1)+"--"+s.substr(i+1))*/
		}
	}
	return res;
}
/*294.Flip Game II：是否先手能保证成功*/
bool canWin1(string s) {
	for (int i = 1; i < s.size(); i++) {
		if (s[i] == '+' && s[i - 1] == '+' && !canWin1(s.substr(0, i - 1) + "--" + s.substr(i + 1)))
			return true;
	}
	return false;
	
}
/*如果遇到"+++"，变成"+--"
没有"+++"，就改变"++"*/
bool canWin2(string s) {
	int win = 0;//先手，奇数win
	int three = s.find("+++");
	while ( three!= -1) {
		s[three + 1] = '-';
		s[three + 2] = '-';
		//"+++" -> "+--"
		win++;
		three = s.find("+++");
	}
	int two = s.find("++");
	while ( two!= -1) {
		//无"+++"
		s[two] = '-';
		s[two + 1] = '-';
		win++;
		int two = s.find("++");
	}
	if (win % 2 == 1) return true;
	else return false;
}
int main() {
	string s = "+++++++";
	cout << canWin1(s) << endl;
	cout << s << endl;
	cout << canWin2(s) << endl;
	return 0;
}

739. Daily Temperatures

Medium

210266Add to ListShare

Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.

For example, given the list of temperatures T = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].

Note: The length of temperatures will be in the range [1, 30000]. Each temperature will be an integer in the range [30, 100].

#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<unordered_map>
using namespace std;
/*739. Daily Temperatures*/
/*1.存放每一个温度出现的位置，例如70之后，只需要找71、72、……、100的位置。
Runtime: 960 ms, faster than 5.07% of C++ online submissions for Daily Temperatures.
Memory Usage: 18.2 MB, less than 8.00% of C++ online submissions for Daily Temperatures.*/
vector<int> dailyTemperatures1(vector<int>& T) {
	unordered_map<int, vector<int> > mp;
	for (int i = 0; i < T.size(); i++) {
		mp[T[i]].push_back(i);
	}
	vector<int> res(T.size());
	for (int i = 0; i < T.size(); i++) {
		int tmp = T[i];
		int minn = 30001;
		for (int j = tmp + 1; j <= 100; j++) {
			if (mp[j].size() > 0 && mp[j].back()>i) {
				int t = upper_bound(mp[j].begin(), mp[j].end(), i) - mp[j].begin();
				cout << mp[j][t] << endl;
				minn = min(minn, mp[j][t] - i);
			}
		}
		if(minn==30001) res[i] =0;
		else res[i] = minn;
	}
	return res;
}
/*2.从结尾遍历到开头
Runtime: 208 ms, faster than 28.27% of C++ online submissions for Daily Temperatures.
Memory Usage: 14.7 MB, less than 100.00% of C++ online submissions for Daily Temperatures.*/
vector<int> dailyTemperatures2(vector<int>& T) {
	vector<int> tmp(101);
	vector<int> res(T.size());
	for (int i = 0; i < 101; i++) tmp[i] = INT_MAX;
	for (int i = T.size() - 1; i >= 0; i--) {
		tmp[T[i]] = i;
		int minn = INT_MAX;
		for (int j = T[i] + 1; j <= 100; j++) {
			if(tmp[j]!=INT_MAX) minn = min(tmp[j] - i, minn);
			if (minn == 1) break;
		}
		if (minn == INT_MAX) res[i] = 0;
		else res[i] = minn;
	}
	return res;
}
/*3.栈，栈中存放索引位置，如果当前遍历到的元素，比栈顶位置对应的元素大，
那么栈顶对应元素最接近位置的较大元素就是当前遍历到的元素。
Runtime: 200 ms, faster than 47.88% of C++ online submissions for Daily Temperatures.
Memory Usage: 16.2 MB, less than 52.00% of C++ online submissions for Daily Temperatures.*/
vector<int> dailyTemperatures3(vector<int>& T) {
	stack<int> s;
	vector<int> res(T.size());
	for (int i = 0; i < T.size(); i++) {
		while (!s.empty() && T[i] > T[s.top()]) {
			res[s.top()] = i-s.top();
			s.pop();
		}
		s.push(i);
	}
	return res;
}
int main() {
	vector<int> T = { 73, 74, 75, 71, 69, 72, 76, 73 };
	vector<int> res = dailyTemperatures3(T);
	for (int i = 0; i < res.size(); i++) cout << res[i] << " ";
	return 0;
}

503. Next Greater Element II

Medium

108956Add to ListShare

Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn't exist, output -1 for this number.

Example 1:

Input: [1,2,1]
Output: [2,-1,2]
Explanation: The first 1's next greater number is 2; 
The number 2 can't find next greater number; 
The second 1's next greater number needs to search circularly, which is also 2.

Note: The length of given array won't exceed 10000.

#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<unordered_map>
using namespace std;
/*496. Next Greater Element I
nums1是nums2的子集，在nums2中找第一个大于nums1[i]的数
Runtime: 8 ms, faster than 98.21% of C++ online submissions for Next Greater Element I.
Memory Usage: 9.5 MB, less than 57.89% of C++ online submissions for Next Greater Element I.*/
vector<int> nextGreaterElement1(vector<int>& nums1, vector<int>& nums2) {
	unordered_map<int, int> mp;
	stack<int> s;
	for (int i = 0; i < nums2.size(); i++) {
		while (!s.empty() && nums2[i] > s.top()) {
			mp[s.top()] = nums2[i];
			s.pop();
		}
		s.push(nums2[i]);
	}
	vector<int> res;
	for (int i = 0; i < nums1.size(); i++) {
		if (mp.find(nums1[i]) != mp.end()) res.push_back(mp[nums1[i]]);
		else res.push_back(-1);
	}
	return res;
}
/*503. Next Greater Element II
循环找，找第一个比自己大的数，找不到是-1，[1,2,1]->[2,-1,2]
Runtime: 84 ms, faster than 93.83% of C++ online submissions for Next Greater Element II.
Memory Usage: 12.6 MB, less than 44.44% of C++ online submissions for Next Greater Element II.*/
typedef struct Node {
	int index;
	int value;
}Node;
vector<int> nextGreaterElements2(vector<int>& nums) {
	vector<int> res(nums.size());
	if (nums.size() == 0) return res;
	stack<Node> s;
	int  n = nums.size();
	int i = 0;
	while(true){
		if (i < n) {
			while (!s.empty() && nums[i] > s.top().value) {
				res[s.top().index] = nums[i];
				s.pop();
			}
			Node tmp;
			tmp.index = i; tmp.value = nums[i];
			s.push(tmp);
			i++;
		}
		else if(i%n != s.top().index){
			while (!s.empty() && nums[i%n] > s.top().value) {
				res[s.top().index] = nums[i%n];
				s.pop();
			}
			i++;
		}
		else break;
	}
	while (!s.empty()) {
		res[s.top().index] = -1;
		s.pop();
	}
	return res;
}
int main() {
	vector<int> nums1 = { 1,1,1,1,1 };
	vector<int> res = nextGreaterElements2(nums1);
	for (int i = 0; i < res.size(); i++) cout << res[i] << " ";
	return 0;
}

556. Next Greater Element III

Medium

498152Add to ListShare

Given a positive 32-bit integer n, you need to find the smallest 32-bit integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive 32-bit integer exists, you need to return -1.

Example 1:

Input: 12
Output: 21

Example 2:

Input: 21
Output: -1
#include"pch.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<unordered_map>
#include<set>
#include<queue>
using namespace std;
/*556. Next Greater Element III
从个位数开始遍历，入大顶堆，
若当前数≥堆顶，说明堆中没有比当前元素大的，当前元素入堆，
否则取当前堆中最小的大于当前值的值，并将该值放在当前遍历到的位置上，当前值入堆，跳出遍历
需要对上述遍历到的值及以前的数值，从堆中选取元素，重新加入
例如：460243 —> 数组：tmp={3，4，2，0，6，4}
入堆：3，4，2（当前元素2，堆中有比它大的元素）
将堆中元素3，4存入数组：4，3，利用upper_bound找到第一个比2大的元素：3，堆中：4，2
将原来2的位置上的数换成3：tmp={3，4，3，0，6，4}，记录下替换的位置tar
跳出遍历，为刚刚遍历过的位置重新赋值：堆中由大到小，为0-（tar-1）重新赋值：{4，2，3，0，6，4}
再倒着计算出res。
这里有一个陷阱！题目说，不会大于32-bit，所以输出res时要判断一下，是否小于32bit，否则返回-1。
Runtime: 0 ms, faster than 100.00% of C++ online submissions for Next Greater Element III.
Memory Usage: 8.4 MB, less than 63.64% of C++ online submissions for Next Greater Element III.*/
int nextGreaterElement(int n) {
	int N = n;
	vector<int> tmp;
	while (n) {
		tmp.push_back(n % 10);
		n /= 10;
	}
	priority_queue<int,vector<int>,less<int> > q;//大顶堆
	vector<int> vec;
	int tar = 0;
	for (int i = 0; i < tmp.size();i++) {
		if (!q.empty()) {
			if (tmp[i] >= q.top()) q.push(tmp[i]);
			else {//优先队列中有比当前值大的数
				int tmpp = tmp[i];
				while (!q.empty()) {
					vec.push_back(q.top());
					q.pop();
				}
				reverse(vec.begin(), vec.end());
				int index=upper_bound(vec.begin(), vec.end(), tmp[i]) - vec.begin();
				tmp[i] = vec[index];
				vec[index] = tmpp;
				tar = i;
				break;
			}
		}
		else q.push(tmp[i]);
	}
	//vec是升序
	for (int i = tar-1, j = 0; i >=0; i--) {
		tmp[i] = vec[j++];
	}
	long long res = 0, cheng = 1;

	for (int i = 0; i < tmp.size(); i++) {
		res += tmp[i]*cheng;
		cheng *= 10;
	}
	if (res == N) return -1;
	else if (res >= 2147483647) return -1;
	return res;
}
int main() {
	cout<<nextGreaterElement(460243);
	return 0;
}

394. Decode String

Medium

2460125Add to ListShare

Given an encoded string, return its decoded string.

The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer.

You may assume that the input string is always valid; No extra white spaces, square brackets are well-formed, etc.

Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, k. For example, there won't be input like 3a or 2[4].

Examples:

s = "3[a]2[bc]", return "aaabcbc".
s = "3[a2[c]]", return "accaccacc".
s = "2[abc]3[cd]ef", return "abcabccdcdcdef".

#include"pch.h"
#include<iostream>
#include<stack>
#include<string>
using namespace std;
/*394. Decode String
栈
s = "3[a]2[bc]", return "aaabcbc".
s = "3[a2[c]]", return "accaccacc".
s = "2[abc]3[cd]ef", return "abcabccdcdcdef".
Runtime: 4 ms, faster than 55.62% of C++ online submissions for Decode String.
Memory Usage: 9 MB, less than 62.74% of C++ online submissions for Decode String.*/
string decodeString(string s) {
	string res = "";
	stack<int> n;
	stack<string> c;
	int num = 0;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] >= '0' && s[i] <= '9') num = num * 10 + (s[i] - '0');
		else if (s[i] == '[') {
			c.push("[");
			n.push(num);
			num = 0;
		}
		else if (s[i] == ']') {
			string tmp = "";
			while (!c.empty() && c.top() != "[") {
				tmp += c.top();
				c.pop();
			}
			if (!c.empty() && c.top() == "[") {
				c.pop();
				int numm = n.top();
				n.pop();
				string str =tmp;
				while (--numm) str += tmp;
				c.push(str);
			}
		}
		else {
			string tmpp = "";
			tmpp.push_back(s[i]);
			c.push(tmpp);
		}
	}
	while (!c.empty()) {
		res += c.top();
		c.pop();
	}
	reverse(res.begin(), res.end());
	cout << res << endl;
	return res;
}
int main() {
	cout << decodeString("100[leetcode]");
	system("pause");
	return 0;
}

150. Evaluate Reverse Polish Notation

Medium

809423Add to ListShare

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +, -, *, /. Each operand may be an integer or another expression.

Note:

  • Division between two integers should truncate toward zero.
  • The given RPN expression is always valid. That means the expression would always evaluate to a result and there won't be any divide by zero operation.

Example 1:

Input: ["2", "1", "+", "3", "*"]
Output: 9
Explanation: ((2 + 1) * 3) = 9

Example 2:

Input: ["4", "13", "5", "/", "+"]
Output: 6
Explanation: (4 + (13 / 5)) = 6

Example 3:

Input: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"]
Output: 22
Explanation: 
  ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
= ((10 * (6 / (12 * -11))) + 17) + 5
= ((10 * (6 / -132)) + 17) + 5
= ((10 * 0) + 17) + 5
= (0 + 17) + 5
= 17 + 5
= 22
#include"pch.h"
#include<iostream>
#include<stack>
#include<string>
#include<vector>
using namespace std;
/*150. Evaluate Reverse Polish Notation
RPN:Reverse Polish Notation,后缀表达式
Runtime: 12 ms, faster than 92.44% of C++ online submissions for Evaluate Reverse Polish Notation.
Memory Usage: 11.6 MB, less than 73.68% of C++ online submissions for Evaluate Reverse Polish Notation.*/
int evalRPN(vector<string>& tokens) {
	stack<int> num;
	for (int i = 0; i < tokens.size(); i++) {
		if (tokens[i] != "-" && tokens[i] != "+" && tokens[i] != "/" && tokens[i] != "*") {
			int n = stoi(tokens[i]);
			num.push(n);
		}
		else {
			int a = num.top();
			num.pop();
			int b = num.top();
			num.pop();
			if (tokens[i] == "-") num.push(b - a);
			else if (tokens[i] == "+") num.push(b + a);
			else if (tokens[i] == "/") num.push(b / a);
			else num.push(b*a);
		}
	}
	return num.top();
}
int main() {
	vector<string> num = { "2", "1", "+", "3", "*" };
	cout << evalRPN(num)<<endl;
	system("pause");
	return 0;
}

 

Li_JiaQian
关注
专栏目录
oracle的sequence的next number值
u012102536的博客
02-24 5743
最佳答案     NEXTNUMBER是序列下一次要缓存的值的起始。即，与cache缓存后面的数字有关，如果cache10，则下一次nextnumber就是11     NEXTVAL是序列取出下一个值，每取出一次，累计一次 1 2 3 4 5 6 CREATE SEQUENCE seq_user
oracle 修改序列 next number,oracle序列详解
weixin_30431923的博客
04-02 1305
}] //最大值[{MINVALUEn|NOMINVALUE}] //最小值[{CYCLE |NOCYCLE}] //循环/不循环[{CACHEn| NOCACHE}];//分配并存入到内存中NEXTVAL 返回序列中下一个有效的值，任何用户都可以引用CURRVAL 中存放序列的当前值NEXTVAL 应在 CURRVAL 之前指定 ，二者应同时有效Create sequence seq...
EtherCAT Slave Stack Code Tool（SSC）使用笔记
最新发布
efei123的博客
02-23 5213
学习EtherCAT有几个月了,准备做一个EtherCAT从站，摸爬滚打一路走来，遇到不少问题，这里仅作学习记录使用。移植过的平台 STM32F103，STM32F407，ari32F103。从站芯片LAN9252。EtherCAT Slave Stack Code Tool (SSC) V5.12(该软件自动生成EtherCAT从站核心代码。
stack&&heap
marsShan的专栏
09-24 1536
Even though with the .NET framework we dont have to actively worry about memory management and garbage collection (GC), we still have to keep memory management and GC in mind in order to optimize the
12题 Min Stack
caomengying的博客
05-21 41
Min Stack Description Implement a stack with following functions: push(val) push val into the stack pop() pop the top element and return it min() return the smallest number in the stack All above should be in O(1) cost class Node { pub
Understanding TCP/IP Network Stack & Writing Network Apps
chengfangang的专栏
04-13 1746
We cannot imagine Internet service without TCP/IP. All Internet services we have developed and used at NHN are based on a solid basis, TCP/IP. Understanding how data is transferred via the network wi
Redis & Redis Sentinel 基本使用
Be yourself.
03-22 6466
Redis &amp; Redis-sentinel 基本使用 本文主要介绍如下几点内容： Redis基本配置 Redis Sentinel基本配置 Redis Client客户端基本内容 Redis Sentinel客户端基本内容 与本文相关的代码与配置文件都已经上传至github上: 地址: https://github.com/SeanYanxml/bigdata Re...
OS&MySQL错误代码
雪辉博客
05-24 4497
OS error code 1: Operation not permitted OS error code 2: No such file or directory OS error code 3: No such process OS error code 4: Interrupted system call OS error code 5: Input/output error OS error code 6: No such device or address O
GCC damangling stack traces
lyc
10-30 1671
GCC damangling stack tracesTons of useful info: this URL is no useful http://www.acsu.buffalo.edu/~charngda/backtrace.html BTW:I’m afraid to lose these pages,so i’ve copied these pages at hereCALL ST
Mysql-error code汇总
热门推荐
文学超的博客
07-03 5万+
OS error code 1: Operation not permitted OS error code 2: No such file or directory OS error code 3: No such process OS error code 4: Interrupted system call OS error code 5: In
Making Games with Python & PyGame.pdf(with code)
10-29
Checking Your Code Online ........................................................................................................ 6 More Info Links on ...
C#中Stack<T>类的使用及部分成员函数的源码分析
一蓑烟雨任平生 也无风雨也无晴
07-29 4276
Stack类 StackT> 作为数组来实现。 StackT> 的容量是 StackT> 可以包含的元素数。 当向 StackT> 中添加元素时，将通过重新分配内部数组来根据需要自动增大容量。 可通过调用 TrimExcess 来减少容量。 如果 Count 小于堆栈的容量，则 Push 的运算复杂度是 O(1)。 如果需要增加容量以容纳新元素，则 Push 的运算复杂度成为 O(n)，
【人工智能】国产开源大模型聊天 AquilaChat 快速开始上手实战&效果评测
程序员光剑
06-13 1万+
Aquila语言大模型在技术上继承了GPT-3、LLaMA等的架构设计优点，替换了一批更高效的底层算子实现、重新设计实现了中英双语的tokenizer，升级了BMTrain并行训练方法，在Aquila的训练过程中实现了比Magtron+DeepSpeed zero-2将近８倍的训练效率。Aquila语言大模型是在中英文高质量语料基础上从０开始训练的，通过数据质量的控制、多种训练的优化方法，实现在更小的数据集、更短的训练时间，获得比其它开源模型更优的性能。
Please write a simply code in python, the requirement is as followed: The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The following figure shows the initial state of the Tower of Hanoi with 5 disks.The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack. 3. No disk may be placed on top of a smaller disk. Assume that initially all the disks are placed on rod A. Write a non-recursive Python function to print out the steps to move all the disks from rod A to rod C via rod B (Hint: a recursive algorithm can be converted into a non-recursive algorithm using stack). The header of the function is: def HanoiTower(n) Here n represents the number of disks. example: when n = 3, the program will output: A -> C next line A -> B next line C -> B next line A -> C next line B -> A next line B -> C next line A -> C 4. simple enough
02-06
stack = [] stack.append((n, 'A', 'C', 'B')) while len(stack) > 0: n, fr, to, via = stack.pop() if n == 1: print(fr, '->', to) else: stack.append((n-1, via, to, fr)) stack.append((1, fr, to, ...
【CODE】01 矩阵（01 Matrix）
Li_Jiaqian的博客
04-15 2143
542. 01 矩阵 难度中等192收藏分享切换为英文关注反馈 给定一个由 0 和 1 组成的矩阵，找出每个元素到最近的 0 的距离。 两个相邻元素间的距离为 1 。 示例 1: 输入: 0 0 0 0 1 0 0 0 0 输出: 0 0 0 0 1 0 0 0 0 示例 2: 输入: 0 0 0 0 1 0 1 1 1 输出: 0 0 0 0 1 0 1 2 ...
【CODE】nSum问题
Li_Jiaqian的博客
03-02 1176
目录 1.Two Sum 15.3Sum 16.3Sum Closest 259. 3Sum Smaller 923.3Sum With Multiplicity 18.4Sum 454.4Sum II 1.Two Sum Easy 13693502Add to ListShare Given an array of integers, returnindi...
【CODE】Top Interview Questions && 并查集
Li_Jiaqian的博客
03-12 1065
目录 78.Subsets 90.Subsets II 825.Friends Of Appropriate Ages 230.Kth Smallest Element in a BST 48.Rotate Image 49.Group Anagrams 328.Odd Even Linked List 725.Split Linked List in Parts ...
【CODE】CoderPad——单链表
Li_Jiaqian的博客
02-14 1019
1.单链表反转 #include<iostream> #include<stdlib.h> using namespace std; typedef struct ListNode{ int value; ListNode *next; }ListNode; void print(ListNode *head){ while(head!=NULL){ ...
【CODE】二分查找 && 二维矩阵问题 && 螺旋矩阵 && 中位数
Li_Jiaqian的博客
03-04 1002
目录 475.Heaters 441.Arranging Coins 363.Max Sum of Rectangle No Larger Than K 240.Search a 2D Matrix II 74.Search a 2D Matrix 54.Spiral Matrix 59.Spiral Matrix II 73.Set Matrix Zeroes ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值