Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

ÔÚC++³ÌÐòÖÐÈçºÎʹÓÃpythonº¯ÊýËù·µ»ØµÄ×Öµä

ÎÒÔÚpythonÖж¨ÒåÁËÒ»¸öº¯Êý£¬º¯Êý·µ»ØÒ»¸ö×ֵ䣬¿´ÆðÀ´´óÌåÊÇÕâ¸öÑù×ӵģº

def get_a_dic():
    dic = {}
    #ÔÚÕâÀï¶Ô×ֵ佸ÐвÙ×÷
    ¡­¡­
    return dic

È»ºóÔÙC++Öе÷ÓÃÕâ¸öº¯Êý
µÃµ½Ò»¸öPyObject* pDic
ÎÒ¸ÃÔõôʹÓÃÕâ¸öpDic£¿
ÎÒÏë»ñµÃÀïÃæµÄËùÓÐKeyºÍ¶ÔÓ¦µÄvalue£¬°ÑÕâ¸ö×ÖµäÖеÄËùÓÐitemµ¼Èëµ½Ò»¸ömapÖУ¬Ó¦¸ÃÔõô×ö£¿

ÎÒÊÇÓõÄÊÇpython3.0£¬eclipse3.5 ¹Ò½Ómingw±àÒë»·¾³£¬Ã»ÓÐʹÓÃboost¿â¡£

Çë¸ßÊÖÖ¸½Ì£¡
¿´¿´http://docs.python.org/c-api/dict.html

ͬѧһÏÂ

ѧϰѧϰ


×òÌì¼Ó°àûʱ¼äÉÏCSDN
Ê®·Ö¸Ðл¸÷λµÄ»Ø´ð£¡

ÌØ±ðÃùл notax£¡


Ïà¹ØÎÊ´ð£º

C ³ÌÐòÎÊÌâ (¶þ) - C/C++ / CÓïÑÔ

ÎÊһϣº
#include <stdio.h>
int main()
{
  char x, y, z;
  int i;
  int a[16];
  for(i=0; i<=16; i++)
  {
  a[i] = 0;
  ......

C ³ÌÐòÎÊÌâ (Èý) - C/C++ / CÓïÑÔ

ÎÊÌâÒ»£º
ÔÚ¶ÔÆëΪ4µÄÇé¿öÏÂ
struct BBB
{
long num£»
char *name;
short int data;
char ha;
short ba[5];
}*p;
p=0x1000000;
p+0x200=____;
(Ulong)p+0x200=____;
(char*)p+0x200=____;
¼ÙÉèÔÚ32λC ......

Çóc³ÌÐò - C/C++ / CÓïÑÔ

CÓïÑÔ±à³Ì ´Ó¼üÅÌÉÏÊäÒ»¸öµ¥´Ê Åжϵ¥´ÊÊÇ·ñÔÚ´Ê¿âÓУ¬´Ê¿âÊÇÒ»¸öÎı¾¡£
scanf("%c",&c);
if()ÅжϾÍÐÐÁË¡£
ÇÀSF¡£
дµÄ¶Ì

ÒýÓÃ
scanf("%c",&c);
if()ÅжϾÍÐÐÁË¡£
ÇÀSF¡£ ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......

¶®pythonµÄjava¸ßÊÖÇë½Ì - Java / Java SE

ÇëÎʸßÊÖ£¬pythonÀïµÄpopenÀàËÆjavaÀïµÄÄĸöÀà»òÕß·½·¨ÄØ£¿£¿ÁíÍâjython¿ª·¢java¸ÃÈçºÎʹÓÃjythonÄØ£¿£¿
1.¿ÉÄܺÍjavaÀïµÄRuntime.getRuntime().exec£¨"ϵͳÃüÁî"£©; Æô¶¯½ø³Ì
2.eclipseÏÂÔØjython ²å¼ ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ