¸÷λ´ó¸çÇë°ï°ï棬һ¸ö¼òµ¥µÄDelphi C/S½á¹¹³ÌÐò
СµÜ×î½ü¼±×Å×öÒ»¸öC/S½á¹¹µÄС³ÌÐò£¬¾ÍÊÇÔÚ¾ÖÓòÍøÄÚ£¬Ó÷þÎñÆ÷¶Ë³ÌÐòʵÏÖ·¢²¼ÐÅÏ¢ , ÐÅÏ¢±íÖ»ÐèÒª ±àºÅ(ID),·¢±íʱ¼ä£¨time£©ºÍÄÚÈÝ(Content) ¾ÍOKÁË£¬¿Í»§¶Ë°²×°ÔÚ¾ÖÓòÍøµÄÆäËüµçÄÔ£¬µ±ÕâЩװÓпͻ§¶ËµÄµçÄÔÆô¶¯ºó£¬×Ô¶¯ÔËÐпͻ§¶Ë³ÌÐò£¬µ¯³öÒ»´°¿ÚÏÔʾ×îÐÂÒ»ÌõÏûÏ¢ÄÚÈÝ£¡ СµÜÒòºÜ¾ÃÒÔǰѧ¹ýһЩDelphiµÄƤ룬ûÓÐ×ö¹ýC/S½á¹¹Á¬½ÓÊý¾Ý¿âµÄ³ÌÐò£¡ÔÚÍøÉÏËÑË÷Ïà¹ØÈëÃÅѧϰ×ÊÁÏÒ»¸öÉÏÎçҲûÓÐÒ»µãÍ·Ð÷£¬Ï£Íû¸÷λ´ó¸ç£¬°ïæ½²ÊöÒ»¸öÔõÑù´´½¨ÕâÑùÒ»¸ö³ÌÐò£¡Ô½ÏêϸԽºÃ£¬Ð¡µÜ²»Ð˸м¤¡£ÈçÄÜÌṩһЩÏà¹ØµÄѧϰÎĵµÒ²ÐУ¡ £¡Ï£Íû¸÷λ´ó¸ç°ï°ïæ
¿Í»§¶ËÁ¬½ÓÄã·þÎñ¶ËµÄÊý¾Ý¿â ²éÄãÒªÏÔʾµÄ¶«Î÷ ·þÎñÆ÷·ÅÊý¾Ý¿âºÍ·þÎñ¶Ë³ÌÐò£¬¿Í»§¶ËÖ»ÐèÒªÁ¬½ÓÊý¾Ý¿â¼´¿É£¬Á¬½Óºó¸ú²Ù×÷±¾µØÊý¾ÝÀàËÆ ÈκÎÒ»¸öÁ¬½ÓµÄÊý¾Ý¿â²Ù×÷¶¼ÄÜÂú×ãÄãµÄÐèÇó ÓÃsocket À´ÊµÏÖ¡£ ÓÃADO¾ÍÐа¡,Á¬½ÓÊý¾Ý¿âÖ®ºó¾ÍÐÐÁË.. Äܲ»ÄÜÂé·³¸÷λ´ó¸ç£¬¸øÒ»¸öÏà¹ØµÄʾÀý£¬»òÕßÏà¹ØµÄѧϰÎÄÕÂ×ÊÁϰ¡ ʵʱ·¢²¼¾ÍÓÃsocket Ö»ÊDz鿴Êý¾Ý¿â¼Ç¼ÄÇô¡°¿Í»§¶ËÖ»ÐèÒªÁ¬½ÓÊý¾Ý¿â¼´¿É£¬Á¬½Óºó¸ú²Ù×÷±¾µØÊý¾ÝÀàËÆ¡± ·Á˺ܶàÊ飬ÀûDCOMʵÏÖÁËÈý²ãϵͳ·þÎñÆ÷¶ËÀûÓÃADOÁ¬½ÓÁËÒ»¸öAccessµÄÊý¾Ý¿â£¬¿Í»§¶ËÁ¬½Ó¶ÁÈ¡·þÎñÆ÷¶ËÊý¾Ý£¬µ«Êǿͻ§¶ËÔÚ±¾µØ¿ÉÒÔʵÏÖÁ¬½Ó£¬¶ø¿½±´µ½¾ÖÓòÍøµÄÆäËüµçÄÔÔËÐÐÈ´Á¬½Ó²»ÁË·þÎñÆ÷£¿ÒýÓà ·Á˺ܶàÊ飬ÀûDCOMʵÏÖÁËÈý²ãϵͳ·þÎñÆ÷¶ËÀûÓÃADOÁ¬½ÓÁËÒ»¸öAccessµÄÊý¾Ý¿â£¬¿Í»§¶ËÁ¬½Ó¶ÁÈ¡·þÎñÆ÷¶ËÊý¾Ý£¬µ«Êǿͻ§¶ËÔÚ±¾µØ¿ÉÒÔʵÏÖÁ¬½Ó£¬¶ø¿½±´µ½¾ÖÓòÍøµÄÆäËüµçÄÔÔËÐÐÈ´Á¬½Ó²»ÁË·þÎñÆ÷£¿ Èç¹ûÖ»ÊǶÁÈ¡ºÍÏÔʾÏûÏ¢£¬ÓÃÁ½²ã¶¼¿ÉÒÔÁË Á¬½Ó²»ÁË·þÎñ¶Ë£¬ÄãÊÇÈçºÎÁ¬½ÓµÄ£¿
Ïà¹ØÎÊ´ð£º
QQȺ 29152388 ÓÑÇéUP °ï¶¥ up °ïup up Ö§³Ö£¡ up jf ...ÄѵÀÓзÖ..? up up up Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£ Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ ¼ÓÁË¡£ ¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......
ÒÑÖªPython ÖУº s = unicode("²âÊÔ", "gb2312") s = u'\u6d4b\u8bd5' print s ²âÊÔ ÔÚDelphiÀïÃæÈçºÎ½«\u6d4b\u8bd5ÕâÑùµÄ»¹Ô³ÉGb2312µÄºº×ÖÄØ£¿ ÕÒµ½¸ö·½·¨ ......
¾ÍÊÇÒ»¸ö·þÎñ¶ËºÍÒ»¸ö¿Í»§¶Ë£¬Àï±ßÓÐһЩ¹²Óõ¥Ôª £¬ÎÒÔÚ ¹¤³ÌµÄSEARCH PATHÀïÉèÖõÄ·¾¶£¬ Àï±ßÓиö½á¹¹Ì壬ÎÒÔÚ·þÎñ¶Ë´ò¿ª£¬¼ÓÁ˳ÉÔ±£¬µ«ÊÇÎÒÔÚ¿Í»§¶ËÆäËûµ¥Ôª·ÃÎʲ»µ½ÎÒмӵģ¬ÎÒÔÚ¿Í»§¶Ë´ò¿ªÄǸöµ¥Ôª£¬È·Êµ¼ÓÁ ......
·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º ¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print. ×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ Ñ§Ï°£¬¿´¿´ ¼ÌÐø¶¥Å¶ ѧϰÁË¡£ go o ......
°ï°ï棬лл~ 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 ......