它将显示用户输入的给定集中缺失的值
Given : array = {88, 105, 3, 2, 200, 0, 10};Output : 1 4-9 11-87 89-99
算法
STARTSTEP 1-> Take an array with elements, bool flag[MAX] to Fale, int i, j, n to size of arrayStep 2-> Loop For from I to 0 and i<n and i++ IF array[i] =0 Set flag[array[i]]=true End IFStep 3 -> End For LoopStep 4 -> Loop For from i to 0 and i<MAX and ++i IF flag[i] == false Set j=i+1 Loop While j End For LoopSTOP
示例
#include #define MAX 100int main(int argc, char const *argv[]) { int array[] = {88, 105, 3, 2, 200, 0, 10}; bool flag[MAX] = { false }; //Initializing all the values of flag as false int i, j, n; n = sizeof(array)/sizeof(array[0]); for (i = 0; i < n; i++) { if (array[i] =0) { flag[array[i]] = true; //Making the value of the elements present in an array as true, So missing will remain false } } for (i = 0; i < MAX; ++i) { if(flag[i] == false) { //Checking for false values j = i+1; //Giving the value of the next iteration while(j<MAX && flag[j] == false) //Checking the value of flag[j] is false j++; if (j==i+1) //For printing the missing number printf("%d", i); else //For printing the missing range printf("%d-%d
", i, j-1); i = j; //Initializing the range's last value to start from that number } } return 0;}
输出
如果我们运行上面的程序，它将生成以下输出
14-911-8789-99
以上就是打印出在范围0-99之间缺失的元素的详细内容，更多请关注创想鸟其它相关文章！
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。
如发现本站有涉嫌抄袭侵权/违法违规的内容， 请发送邮件至 chuangxiangniao@163.com 举报，一经查实，本站将立刻删除。
发布者：程序猿，转转请注明出处：https://www.chuangxiangniao.com/p/1444443.html
微信扫一扫 
支付宝扫一扫 
