java代码移植_ÒÆÖ²Java´úÂëµ½C++µÄ¼¼ÇÉ£¨ÕûºÏ£©

¡¡¡¡Ò»¡¢¹ØÁªÐÔÈÝÆ÷£¨map vs TreeMap£©£º

¡¡¡¡ÎÒÃÇÔÚÓÃJava½øÐбà³Ìʱ¾­³£»áÓõ½MapÕâÑùµÄÈÝÆ÷½Ó¿Ú£¬¶øËüµÄ¾ßÌåʵÏÖÀàÒ»°ãÀ´×ÔÓÚTreeMapºÍHashMap£¬Ç°ÕßÌṩÁËÓÐÐòÐÔ£¬¶øºóÕßÔòÔÚ´æȡЧÂÊ·½ÃæÓÐ×ÅÒ»¶¨µÄÓÅÊÆ¡£Ïà±ÈÓÚJava£¬C++µÄSTLÒ²ÌṩÁËmapÈÝÆ÷£¬Æ书ÄܵÈͬÓÚJavaÖеÄTreeMap£¬ÖÁÓÚHashMap£¬Ëü²¢Ã»ÓнøÈëC++±ê׼ģ°å¿â¡£¶øÐÒÔ˵ÄÊÇ£¬ÏÖÓеÄÖ÷Á÷C++±àÒëÆ÷¹©Ó¦É̾ùÌṩÁ˱ê׼ģ°å¿âµÄÀ©Õ¹°ü£¬²¢ÔÚ¸ÃÀ©Õ¹°üÖÐʵÏÖÁËhash_mapÈÝÆ÷À࣬Æä½Ó¿Ú±ê×¼ºÍSTLÖеÄÈÝÆ÷»ù±¾Ò»Ö¡£

¡¡¡¡ÔÚ±¾ÌõÄ¿ÖÐÎÒÃǽ«Ö÷ÒªÁоÙTreeMap£¨Java£©ºÍmap£¨C++£©ÔÚÉè¼ÆÉϵÄÖ÷Òª²î±ð£¬ÒÔ¼°¹Ø¼ü¹¦ÄÜʵÏÖÉϵÄÃ÷ÏÔ²îÒ죬²¢»ùÓڴ˸ø³öÔÚʵ¼Ê´úÂëÒÆÖ²¹ý³ÌÖиÃÈçºÎÓ¦¶ÔÕâЩ²îÒìËù´øÀ´µÄÖî¶àÎÊÌ⣺

¡¡¡¡1¡¢²åÈëÏàͬ¼üʱÁ½ÖÖÈÝÆ÷±íÏÖ²»Í¬£¬ÆäÖÐJavaµÄTreeMap»á½«ºó²åÈëµÄ¼üÖµ¶ÔÖ±½Ó¸²¸ÇÈÝÆ÷ÖÐÒѾ­´æÔڵļüÖµ¶Ô£¬¶øC++ÖеÄmapÈÝÆ÷ÔòÇ¡Ç¡Ïà·´£¬Ò»µ©ÈÝÆ÷ÖиüüÒѾ­´æÔÚ£¬ÄÇôвåÈëµÄ¼üÖµ¶Ô½«²»»á±»´æÈë¸ÃÈÝÆ÷¶ÔÏóÖУ¬¼ûÈçÏÂJava´úÂë¼°Êä³ö½á¹û¡£

public class MyTest {

private static void testGet() {

TreeMap tm = new TreeMap();

tm.put("Hello"£¬ "World");

if (tm.get("Hello1") == null)

System.out.println("Hello1 is NOT found.");

}

public static void main(String[] args) {

TreeMap tm = new TreeMap();

tm.put(5£¬ 10);

tm.put(5£¬ 20);

Set> entries = tm.entrySet();

Iterator> it = entries.iterator();

while (it.hasNext()) {

Entry e = it.next();

System.out.printf("key = %d£¬ value = %d

"£¬e.getKey().intValue()£¬e.getValue().intValue());

}

}

}

//The count of the TreeMap is 1

//key = 5£¬ value = 20

¡¡¡¡¼ûÈçÏÂC++´úÂë¼°Êä³ö½á¹û¡£

using namespace std;

int main()

{

map m;

m.insert(make_pair(5£¬10));

m.insert(make_pair(5£¬20));

printf("The count of the map is %d.

"£¬m.size());

map::iterator it = m.begin();

for (; it != m.end(); ++it) {

printf("key = %d£¬ value = %d

"£¬(*it).first£¬(*it).second);

}

return 0;

}

//The count of the map is 1

//key = 5£¬ value = 10

¡¡¡¡´ÓÒÔÉϽá¹û±ã¿ÉÒÔÇåÎúµÄ¿´³ö¶þÕßÖ®¼äµÄ²î±ð£¬ÄÇôÎÒÃÇÓÖ¸ÃÈçºÎÐÞ¸ÄC++µÄ´úÂ룬ÒÔʹÆäºÍÔ­ÓеÄJava´úÂëÂß¼­±£³ÖÒ»ÖÂÄØ£¿ÏÖÔÚ´ð°¸ÒѾ­·Ç³£Çå³þÁË£¬ÎÒÃÇÖ»ÐèÔÚ²åÈëÇ°ÏÈÐÐÅжϸüüÊÇ·ñ´æÔÚ£¬Èç¹û´æÔÚÔòɾ³ýÒÑÓмüÖµ¶Ô£¬Ö®ºóÔÙ½«Ð¼üÖµ¶Ô²åÈëµ½¸ÃÈÝÆ÷¶ÔÏóÖУ¬»òÕßͨ¹ýÒÑÓмüµÄµü´úÆ÷·ÃÎʸüüµÄÖµ£¬²¢¸³ÓèÐÂÖµ¡£ÖÁÓÚ¸ÃʹÓÃÄÄÖÖ·½Ê½£¬ÔòÐèÒªÒÀ¾Ýʵ¼ÊÇé¿ö¶ø¶¨£¬Í¨³£¶øÑÔ£¬µÚÒ»ÖÖ·½·¨¿ÉÒÔÓ¦¶ÔËùÓг¡¾°£¬µ«ÊÇЧÂÊÏà±ÈÓÚµÚ¶þÖÖ·½·¨ÒªÂÔµÍһЩ¡£¼ûÈçÏÂÐ޸ĺóµÄC++´úÂ룺

using namespace std;

int main()

{

map m;

m.insert(make_pair(5£¬10));

map::iterator it = m.find(5);

if (it != m.end())

m.erase(it);

m.insert(make_pair(5£¬20));

//»òʵÏÖΪÒÔÏ·½Ê½

//if (it != m.end())

//    it->second = 20;

//else

//    m.insert(make_pair(5£¬20));

printf("The count of the map is %d.

"£¬m.size());

it = m.begin();

for (; it != m.end(); ++it)

printf("key = %d£¬ value = %d

"£¬(*it).first£¬(*it).second);

return 0;

}

//The count of the map is 1

//key = 5£¬ value = 10