c语言如何判断一个元素是否在集合中 给定一个集合，查找元素是否在集合中出现。求C语言算法
stlset \u5224\u65ad\u4e00\u4e2a\u5143\u7d20\u662f\u5426\u5728\u4e00\u4e2a\u96c6\u5408\u4e2d\u600e\u4e48\u5224\u65ad\uff1fSet\u96c6\u5408\u7684\u5143\u7d20\u4e0d\u533a\u5206\u987a\u5e8f\uff0c\u4e14\u4e0d\u5141\u8bb8\u51fa\u73b0\u76f8\u540c\u5143\u7d20\u3002\u8fd9\u91cc\u540c\u6837\u7684\u5143\u7d20\u6307\u7684\u662f\u4ee5equals()\u65b9\u6cd5\u5224\u65ad\u7684
\u5185\u5bb9\u62d3\u5c55\uff1a
1\u3001STL \u5bf9\u8fd9\u4e2a\u5e8f\u5217\u53ef\u4ee5\u8fdb\u884c\u67e5\u627e\uff0c\u63d2\u5165\u5220\u9664\u5e8f\u5217\u4e2d\u7684\u4efb\u610f\u4e00\u4e2a\u5143\u7d20\uff0c\u800c\u5b8c\u6210\u8fd9\u4e9b\u64cd\u4f5c\u7684\u65f6\u95f4\u540c\u8fd9\u4e2a\u5e8f\u5217\u4e2d\u5143\u7d20\u4e2a\u6570\u7684\u5bf9\u6570\u6210\u6bd4\u4f8b\u5173\u7cfb\uff0c\u5e76\u4e14\u5f53\u6e38\u6807\u6307\u5411\u4e00\u4e2a\u5df2\u5220\u9664\u7684\u5143\u7d20\u65f6\uff0c\u5220\u9664\u64cd\u4f5c\u65e0\u6548\u3002\u800c\u4e00\u4e2a\u7ecf\u8fc7\u66f4\u6b63\u7684\u548c\u66f4\u52a0\u5b9e\u9645\u7684\u5b9a\u4e49\u5e94\u8be5\u662f:\u4e00\u4e2a\u96c6\u5408(set)\u662f\u4e00\u4e2a\u5bb9\u5668\uff0c\u5b83\u5176\u4e2d\u6240\u5305\u542b\u7684\u5143\u7d20\u7684\u503c\u662f\u552f\u4e00\u7684\u3002
2\u3001\u8fd9\u5728\u6536\u96c6\u4e00\u4e2a\u6570\u636e\u7684\u5177\u4f53\u503c\u7684\u65f6\u5019\u662f\u6709\u7528\u7684\u3002\u96c6\u5408\u4e2d\u7684\u5143\u7d20\u6309\u4e00\u5b9a\u7684\u987a\u5e8f\u6392\u5217\uff0c\u5e76\u88ab\u4f5c\u4e3a\u96c6\u5408\u4e2d\u7684\u5b9e\u4f8b\u3002\u4e00\u4e2a\u96c6\u5408\u901a\u8fc7\u4e00\u4e2a\u94fe\u8868\u6765\u7ec4\u7ec7\uff0c\u5728\u63d2\u5165\u64cd\u4f5c\u548c\u5220\u9664\u64cd\u4f5c\u4e0a\u6bd4\u5411\u91cf(vector)\u5feb\uff0c\u4f46\u67e5\u627e\u6216\u6dfb\u52a0\u672b\u5c3e\u7684\u5143\u7d20\u65f6\u4f1a\u6709\u4e9b\u6162\u3002
3\u3001\u5177\u4f53\u5b9e\u73b0\u91c7\u7528\u4e86\u7ea2\u9ed1\u6811\u7684\u5e73\u8861\u4e8c\u53c9\u6811\u7684\u6570\u636e\u7ed3\u6784\u3002\u4e00\u4e2a\u96c6\u5408(set)\u662f\u4e00\u4e2a\u5bb9\u5668\uff0c\u5b83\u5176\u4e2d\u6240\u5305\u542b\u7684\u5143\u7d20\u7684\u503c\u662f\u552f\u4e00\u7684\u3002
4\u3001\u96c6\u548c\u591a\u96c6\u7684\u533a\u522b\u662f:set\u652f\u6301\u552f\u4e00\u952e\u503c\uff0cset\u4e2d\u7684\u503c\u90fd\u662f\u7279\u5b9a\u7684\uff0c\u800c\u4e14\u53ea\u51fa\u73b0\u4e00\u6b21;\u800cmultiset\u4e2d\u53ef\u4ee5\u51fa\u73b0\u526f\u672c\u952e\uff0c\u540c\u4e00\u503c\u53ef\u4ee5\u51fa\u73b0\u591a\u6b21\u3002
#include
int main()
{
int num[10]={0,1,2,3,4,5,6,7,8,9};
int temp;
bool flag=false;
printf("\u8bf7\u8f93\u5165\u4e00\u4e2a\u8981\u67e5\u627e\u7684\u6570\uff1a");
scanf("%d",&temp);
for(int i=0;i<10;i++)
{
if(temp==num[i]){printf("%d\u5728\u96c6\u5408\u91cc\u51fa\u73b0\uff01\n",temp);flag=true;}
}
if(flag==false)printf("%d\u4e0d\u5728\u96c6\u5408\u91cc\u51fa\u73b0\uff01\n",temp);
}
如定义一个数组.
#include <stdio.h>
void main()
{
int array[ 10 ] = { 0,2,3,4,5,6,7,8,9,24} ;
int num ;
scanf(" num = %d ", &num) ;
for( int i = 0 ; i < 10 ; i++ )
if( array[ i ] == num )
printf("您查找的数在集合array中.") ;
}
绛旓細if( array[ i ] == num )printf("鎮ㄦ煡鎵剧殑鏁鍦ㄩ泦鍚array涓.") ;}
绛旓細int findarray(int*p,int len,int val);int main(void){ int len; //鏁扮粍涓鍏冪礌涓暟 int i=0; //鏁扮粍鍏冪礌涓嬫爣 int val; //瑕佹悳绱㈢殑鏁 printf("璇蜂负涓涓闅忔満鏁版暟缁勮瀹氬厓绱犱釜鏁發en=");scanf("%d", &len);int*p = (int*)malloc(sizeof(int)*(len+1));for (i = 0; i ...
绛旓細锛1锛夎緭鍏鐨勫厓绱犱釜鏁帮紝骞惰緭鍏ュ悇涓厓绱狅紱锛2锛夎緭鍏鐨勫厓绱犱釜鏁帮紝骞惰緭鍏ュ悇涓厓绱锛涳紙3锛夌湅A閲嶅厓绱犳槸鍚﹀叏閮ㄥ湪B涓紝鍦ㄥ氨杈撳嚭鈥淎鏄疊瀛愰泦鈥濓紱鍚﹀垯杈撳嚭鈥淎涓嶆槸B瀛愰泦鈥漣nclude <stdio.h> int main(){ int a[20] = { 0 }, b[30] = { 0 }, n, m, i, j,cnt = 0;//杈撳叆闆嗗悎a鐨勫厓绱...
绛旓細绗簩绌哄～锛歛dd include<stdio.h> int main(){ int i,n;printf("璇疯緭鍏涓涓姝ｆ暣鏁:");scanf("%d",&n);for (i=2;i<n;i++){ if (n%i==0) break;} if(i>=n){ printf("1");}else{ printf("0");} return 0;}
绛旓細//A[low]~~A[high]鍖洪棿鍐呬簩鍒嗘煡鎵惧叧閿瓧涓 key 鐨鍏冪礌锛//low 鍜 high 鐨勫垵濮嬪煎垎鍒搴0 锛宯-1 int Binsch(int A[], int low, int high,int key){ if( key > 13) return -1;//琛ㄧず鍖归厤涓嶆垚鍔 if(low <= high){ int mid = (low + high)/ 2;if(key == A[mid])return...
绛旓細int 鏁扮粍[]={1,2,3,4,5,6,7,8,9,0},搴(0);do{scanf_s("%d",&鏁存暟);if(鏁存暟==鏁扮粍[搴++]){printf("瀛樺湪鍏冪礌%d锛",鏁存暟);break;}}while(搴<10);printf("涓嶅瓨鍦ㄥ厓绱%d锛",鏁存暟);浠ヤ笂鎵嬪啓鍘熺悊鏈繍琛岋紝濡傛灉杩愯鏈夐棶棰樺啀璇淬
绛旓細)%100;if(F)for(i=0;i<N;i++)printf("%d ",a[i]);printf("\n璇疯緭鍏涓涓鏁帮細");scanf("%d",&num);for(i=0;i<N;i++)if(a[i]==num){ flag=1;printf("%d鍦ㄦ暟鍒楃%d涓厓绱鐨勪綅缃甛n",num,i+1);break;} if(!flag)printf("%d涓嶅湪鏁板垪涓璡n",num);} return 1;} ...
绛旓細import org.apache.commons.lang.ArrayUtils;public boolean isDupInArray(Object[]array){ if(ArrayUtils.isEmpty(array)==true){ return false;} for(Object obj:array){ if(ArrayUtils.indexOf(array,obj)!=ArrayUtils.lastIndexOf(array,obj)){ return true;} } return false;} ...
绛旓細i;float t,x,a[10],i;/*t鐢ㄤ綔鍒ゆ柇鏍囪瘑,x鏄鍒ゆ柇鐨勬暟,i琛ㄧず寰幆鎺у埗鍙橀噺*/ printf("璇疯緭鍏ヨ鍒ゆ柇鐨勬诞鐐规暟:\n");scanf("%f",&x);printf("璇疯緭鍏ユ诞鐐规暟缁鍏冪礌:\n");for (i=0;i<10;i++)scanf("%f",&a[i]);for (i=0;i<10;i++)printf("%5.2f",a[i]);/*鍏冪礌浠5涓...
绛旓細NULL琛ㄧず鏄┖锛屽嵆浠涔堜篃娌℃湁銆傚垰璁剧珛涓涓鏁扮粍鏃讹紝閲岄潰鐨鍏冪礌鏄綘瀹氫箟鏁扮粍鐨勭被鍨嬶紝鏁板间笉纭畾 渚嬪锛歝har ch[4];鐜板湪閲岄潰鏄殢鏈哄硷紝鍚寃k_wangkui鐨勫洖绛旓紝memset锛坈h,'0',sizeof(char)*4);杩欐椂ch閲岀殑鏁板兼槸瀛楃鍨嬬殑鈥0鈥欍
