当前位置:网站首页>删除数组中的某几个元素
删除数组中的某几个元素
2022-07-05 17:23:00 【-西门吹雪】
需求描述如下
- 一个顶层指针指向一个结构体
CCPoints
数组,这里存放了n个结构 - 给定一个另外一个结构体
Point
数组 - 从1中删除数组2中的满足条件的元素
代码实现如下:
#include <iostream>
#include <memory>
#include <string.h>
using namespace std;
typedef struct {
int x;
int y;
} Point;
typedef struct {
Point point;
int Times;
} CCPoints;
int main() {
int n;
CCPoints aa[10];
for (int i = 0; i < 10; i++) {
aa[i].point = {
i, i};
aa[i].Times = i + 2;
}
for (int i = 0; i < 10; i++) {
cout << "i = " << i << " " << aa[i].point.x << " " << aa[i].point.y
<< " " << aa[i].Times << endl;
}
cout << endl;
const CCPoints* bb = aa;
Point tt[3];
tt[0] = {
2, 2};
tt[1] = {
4, 4};
tt[2] = {
7, 7};
auto* cc = new CCPoints[10];
for(int i = 0 ;i<10;i++){
cc[i].point = {
bb[i].point.x,bb[i].point.y};
cc[i].Times = bb[i].Times;
}
int ps2 = 0, cnts = 0;
int j = 0;
int len = 10;
for (int ps = 0; ps < 3; ps++) {
ps2 = 0;
for (int cs = 0; cs < len; cs++) {
if (cc[cs].point.x != tt[ps].x || cc[cs].point.y != tt[ps].y) {
cc[ps2] = cc[cs];
ps2++;
}else{
cnts++;
}
}
}
cout << " cnts " << cnts << endl << endl << endl;
for (int i = 0; i < len-3; i++) {
cout << " i " << cc[i].point.x << " " << cc[i].point.y << " "
<< cc[i].Times << endl;
}
delete[] cc;
}
运行结果
i = 0 0 0 2
i = 1 1 1 3
i = 2 2 2 4
i = 3 3 3 5
i = 4 4 4 6
i = 5 5 5 7
i = 6 6 6 8
i = 7 7 7 9
i = 8 8 8 10
i = 9 9 9 11
cnts 3
i 0 0 2
i 1 1 3
i 3 3 5
i 5 5 7
i 6 6 8
i 8 8 10
i 9 9 11
边栏推荐
- Rider set the highlighted side of the selected word, remove the warning and suggest highlighting
- MySQL之知识点(六)
- IDEA 项目启动报错 Shorten the command line via JAR manifest or via a classpath file and rerun.
- Cartoon: how to multiply large integers? (next)
- PMP认证需具备哪些条件啊?费用多少啊?
- Oracle缩表空间的完整解决实例
- 使用QT设计师界面类创建2个界面,通过按键从界面1切换到界面2
- 如何保存训练好的神经网络模型(pytorch版本)
- 力扣解法汇总729-我的日程安排表 I
- Cartoon: looking for the k-th element of an unordered array (Revised)
猜你喜欢
Alpha conversion from gamma space to linner space under URP (II) -- multi alpha map superposition
ICML 2022 | Meta propose une méthode robuste d'optimisation bayésienne Multi - objectifs pour faire face efficacement au bruit d'entrée
Thesis reading_ Medical NLP model_ EMBERT
Oracle Recovery Tools ----oracle数据库恢复利器
Knowledge points of MySQL (7)
mongodb(快速上手)(一)
服务器配置 jupyter环境
企业数字化发展中的六个安全陋习,每一个都很危险!
Oracle缩表空间的完整解决实例
leetcode每日一练:旋转数组
随机推荐
leetcode每日一题:字符串中的第一个唯一字符
漫画:一道数学题引发的血案
ICML 2022 | meta proposes a robust multi-objective Bayesian optimization method to effectively deal with input noise
Tips for extracting JSON fields from MySQL
提高应用程序性能的7个DevOps实践
Clickhouse (03) how to install and deploy Clickhouse
Thesis reading_ Chinese NLP_ LTP
Webapp development - Google official tutorial
Read the history of it development in one breath
CVPR 2022最佳学生论文:单张图像估计物体在3D空间中的位姿估计
Please tell me why some tables can find data by writing SQL, but they can't be found in the data map, and the table structure can't be found
mongodb(快速上手)(一)
证券网上开户安全吗?证券融资利率一般是多少?
Is it safe to open an account online? What is the general interest rate of securities financing?
云主机oracle异常恢复----惜分飞
力扣解法汇总729-我的日程安排表 I
Cartoon: a bloody case caused by a math problem
ICML 2022 | Meta propose une méthode robuste d'optimisation bayésienne Multi - objectifs pour faire face efficacement au bruit d'entrée
2022新版PMP考试有哪些变化?
Check the WiFi password connected to your computer