判断一个数是否存在一个数组中

一:判断存在及在数组的位子,使用Array.BinarySearch 方法

None.gif     string  item  =   " 1,2,3,4,5 " ;
ExpandedBlockStart.gif        
string [] array  =  item.Split(  new   char []  ',' }  );
None.gif        
string  a  =   " 1 " ;
None.gif        
int  b  =  Array.BinarySearch( array, a );
None.gif        
if ( b < 0  )
ExpandedBlockStart.gif        
{
InBlock.gif            Response.Write( 
"不存在!" );
ExpandedBlockEnd.gif        }

None.gif        
else
ExpandedBlockStart.gif        
{
InBlock.gif            Response.Write( 
"在数组的第" + b + "位!" );
ExpandedBlockEnd.gif        }


None.gif     string  item  =   " 1,2,3,4,5 " ;
ExpandedBlockStart.gifContractedBlock.gif        
string [] array  =  item.Split(  new   char []  dot.gif ',' }  );
None.gif        
string  a  =   " 1 " ;
None.gif        
for int  i  =   0 ; i  <  array.Length; i ++  )
ExpandedBlockStart.gif        
{
InBlock.gif            
if( array[ i ].Equals( a ) )
ExpandedSubBlockStart.gif            
{
InBlock.gif                Response.Write( 
"存在" );
InBlock.gif                
break;
ExpandedSubBlockEnd.gif            }
            
ExpandedBlockEnd.gif        }

你可能感兴趣的:(判断一个数是否存在一个数组中)