当前位置:网站首页>Preliminary practice of niuke.com (9)
Preliminary practice of niuke.com (9)
2022-07-07 05:31:00 【Deer nine pills】
Catalog
1. Deletes the specified number from the sequence
2. Integer de duplication in sequence
1. Deletes the specified number from the sequence
#include<stdio.h> int main() { int n = 0; int arr[50] = { 0 }; int delete = 0; scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &arr[i]); } scanf("%d", &delete); int i = 0; int j = 0; for (i = 0, j = 0; i < n; i++) {//i The role of : Traversal array //j The role of : Record the subscript where the data is stored if (arr[i] != delete) { arr[j++] = arr[i]; } // At this time j The data stored in is the number of elements left after deleting elements } for (int i = 0; i < j; i++) { printf("%d ", arr[i]); } return 0; }
2. Integer de duplication in sequence
Method 1:
( Compare with the previous elements )
#include<stdio.h> int main() { int n = 0; int arr[1000] = { 0 }; scanf("%d", &n); int i = 0; int j = 0; for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } // duplicate removal j = 1; for (i = 1; i < n; i++)// Start traversing from the second { int flag = 0; for (int k = 0; k < i; k++) { if (arr[k] == arr[i]) { flag = 1; } } if (flag != 1) { arr[j++] = arr[i]; }// The method here is similar to that of the above question } for (int i = 0; i < j; i++) { printf("%d ", arr[i]); } return 0; }
Method 2:
#include<stdio.h> int main() { int n = 0; int arr[1000] = { 0 }; scanf("%d", &n); int i = 0; int j = 0; for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } // duplicate removal for (i = 0; i < n; i++) { // Judge arr[i] Has it ever appeared in the back int j = 0; for (j = i + 1; j < n; j++) { if (arr[i] == arr[j]) { // duplicate removal , That is, the following elements cover the front int k = 0; for (k = j; k < n - 1; k++) { arr[k] = arr[k + 1]; } n--; j--;// Prevent the covering up from still being the same as the front arr[i] Elements repeat } } } for (int i = 0; i < n; i++) { printf("%d ", arr[i]); } return 0; }
3. Ordered sequence merging
#include<stdio.h> #include<malloc.h> int main() { int n = 0; int m = 0; int all = m+n; int i = 0; // Input n and m scanf("%d %d",&n,&m); int *arr1 = (int *)malloc(sizeof(int)*n); int *arr2 = (int *)malloc(sizeof(int)*m); int *arr3 = (int *)malloc(sizeof(int)*(m+n)); // Enter two ordered arrays for(int i = 0;i<n;i++) { scanf("%d",&arr1[i]); } for(int i = 0;i<m;i++) { scanf("%d",&arr2[i]); } // Merge array i = 0; int j = 0; int k = 0; while(i<n&&j<m) { if(arr1[i]<arr2[j]) { arr3[k++] = arr1[i++]; } else { arr3[k++] = arr2[j++]; } } if(i==n) { for(;j<m;j++) { arr3[k++] = arr2[j]; } } else { for(;i<n;i++) { arr3[k++] = arr1[i]; } } for( i =0;i<k;i++) { printf("%d ",arr3[i]); } return 0; }
边栏推荐
- Simulate thread communication
- 删除文件时提示‘源文件名长度大于系统支持的长度’无法删除解决办法
- Let f (x) = Σ x^n/n^2, prove that f (x) + F (1-x) + lnxln (1-x) = Σ 1/n^2
- Leetcode (417) -- Pacific Atlantic current problem
- Knapsack problem unrelated to profit (depth first search)
- App clear data source code tracking
- Scheduledexecutorservice timer
- 照片选择器CollectionView
- Design, configuration and points for attention of network specified source multicast (SSM) simulation using OPNET
- Timer create timer
猜你喜欢
Leetcode (417) -- Pacific Atlantic current problem
Is the human body sensor easy to use? How to use it? Which do you buy between aqara green rice and Xiaomi
利用OPNET进行网络单播(一服务器多客户端)仿真的设计、配置及注意点
Leakage relay llj-100fs
Make web content editable
《2》 Label
张平安:加快云上数字创新,共建产业智慧生态
利用OPNET进行网络仿真时网络层协议(以QoS为例)的使用、配置及注意点
论文阅读【Sensor-Augmented Egocentric-Video Captioning with Dynamic Modal Attention】
The navigation bar changes colors according to the route
随机推荐
AIDL 与Service
高压漏电继电器BLD-20
Linkedblockingqueue source code analysis - initialization
阿里云的神龙架构是怎么工作的 | 科普图解
Most commonly used high number formula
Vector and class copy constructors
Torch optimizer small parsing
DFS,BFS以及图的遍历搜索
基于 hugging face 预训练模型的实体识别智能标注方案:生成doccano要求json格式
Knapsack problem (01 knapsack, complete knapsack, dynamic programming)
痛心啊 收到教训了
Full link voltage test: the dispute between shadow database and shadow table
Use, configuration and points for attention of network layer protocol (taking QoS as an example) when using OPNET for network simulation
Intelligent annotation scheme of entity recognition based on hugging Face Pre training model: generate doccano request JSON format
Codeforces Round #416 (Div. 2) D. Vladik and Favorite Game
Jhok-zbl1 leakage relay
什么是依赖注入(DI)
Leetcode (417) -- Pacific Atlantic current problem
创始人负债10亿,开课吧即将“下课”?
Is the human body sensor easy to use? How to use it? Which do you buy between aqara green rice and Xiaomi