java
BitSet bitSet = new BitSet ( 128 ) ;
判断字符c是否已出现 if ( ! bitSet. get ( c) )
未出现就设置为已出现 bitSet. set ( c) ;
统计有多少字符已出现过 System . out. println ( bitSet. cardinality ( ) ) ;
C++ 的set,s. insert ( text[ i] ) 不重复
java的hashset不重复 hs. add ( temp)
C++ 的unordered_set . cout计数
StringBuffer strb = new StringBuffer ( str) ; java的strbu才能reverse
str. reverse ( ) ;
string str = to_string ( nums) ; C++
reverse ( str. begin ( ) , str. end ( ) ) ;
String str = Integer . toBinaryString ( num) ; java
String newStr = str. replaceAll ( "1" , "" ) ;
bitset< 4 > bitset1;
bitset< 8 > bitset2 ( 12 ) ;
string s = "100101" ;
bitset< 10 > bitset3 ( s) ;
biset. count
stringstream ss ( str) ; C++
getline ( ss, stri, ';' )
regex_match ( stri, regex ( "[ASWD][0-9]*" ) ) 匹配
stri[ i] . matches ( "[AWSD][0-9]{1,2}" ) 匹配 java
Integer . valueOf ( str)
Pattern p1 = Pattern . compile ( "[^a-zA-Z0-9]" ) ;
if ( p1. matcher ( str) . find ( ) )
str1. contains ( str2)
if ( 0 == s. compare ( i, max_substr_len, s, j, max_substr_len) ) 判断字符串相同
Map < Character , Integer > map = new HashMap < > ( ) ;
for ( char ch : str. toCharArray ( ) ) {
map. put ( ch, map. getOrDefault ( ch, 0 ) + 1 ) ;
}
int min = Integer . MAX_VALUE;
for ( int times : map. values ( ) ) {
min = Math . min ( min, times) ;
}
vector< int > I ( v1) ;
for ( auto & t: I) {
cin>> t;
}
sort ( I. begin ( ) , I. end ( ) ) ;
set< int > st ( I. begin ( ) , I. end ( ) ) ;
I. assign ( st. begin ( ) , st. end ( ) ) ;
if ( to_string ( I[ j] ) . find ( to_string ( R[ i] ) ) != string:: npos)
array[ i] = String . valueOf ( sc. nextInt ( ) ) ;
Treeset 去重排序
for ( Map. Entry < Integer , String > entry : map. entrySet ( ) )
java:
Math . abs ( Math . pow ( x, 3 ) - num) > 1e-3 abs、pow
System . out. println ( String . format ( "%.1f" , x) ) format
C++
# include <iomanip>
cout<< setprecision ( 1 ) << fixed<< x<< endl;
str. reverse ( )
reverse ( str. begin ( ) , str. end ( ) ) ;
C++
map< char , int > mp;
vector< pair< char , int > > v ( mp. begin ( ) , mp. end ( ) ) ;
sort ( v. begin ( ) , v. end ( ) , cmp) ;
bool cmp ( pair< char , int > a, pair< char , int > b) {
return a. second> b. second;
}
C++
sort ( v. begin ( ) , v. end ( ) , greater < int > ( ) ) ;
reverse ( v. begin ( ) , v. end ( ) ) ;
java
Arrays . sort ( arr, new Comparator < Integer > ( ) {
public int compare ( Integer o1, Integer o2) {
return o1- o2;
}
} ) ;
java
String stri= String . valueOf ( i) ;
if ( strii. endsWith ( stri) )
C++
if ( s2. find ( s1, pos) != - 1 )