C# ²ËÄñ¼ÌÐøÌáÎÊ£¡ - .NET¼¼Êõ / C#
×ö¸öС¶«Î÷£¬ÔËÐйý³ÌÖлáµÃµ½Ò»¸öintÊý¾Ý£¬ÎÒÏë°ÑÕâ¸öÊý¾ÝÁí´æÎªÎÊÌ⣬Ï´θóÌÐòÔÙÔËÐÐʱ¿ÉÒÔʹÓã¡XML,TXTµÈ¶¼ÐУ¡ÔõôÉú³É£¬Éú³ÉÁËÔõô¸üУ¬Ôõô¶ÁÈ¡£¡Ïà¶Ô·¾¶£¡
Äã·Åµ½±¾µØµÄÒ»¸ötxtÎļþÀ³ÌÐò¹Ø±Õʱ°Ñ¸ÃÎļþ´ò¿ª£¬¸üУ¬³ÌÐò¿ªÆôʽ´ò¿ª¶ÁÈ¡
Èç¹û¾ÍÖ»ÓиöÊý¾ÝµÄ»°£¬ÄǾʹæ¸ötxt°É¡£
web:
д£º
using (StreamWriter sw = File.CreateText(Server.MapPath(Ïà¶Ô·¾¶)))
{
sw.WriteLine("Hello");
sw.WriteLine("And");
sw.WriteLine("Welcome");
}
¶Á£º
using (StreamReader sr = File.OpenText(Server.MapPath(Ïà¶Ô·¾¶)))
{
string s = "";
while ((s = sr.ReadLine()) != null)
{
Console.WriteLine(s);
}
}
up
¹Ø±Õʱ¸üÐÂ
C# code:
// it will be done when the form close.
private void Form1_FormClosed(object sender, FormClosedEventArgs e)
{
FileStream file = File.Open(@"C:\dataBegin.txt", FileMode.Open);
StreamWriter sWriter = new StreamWriter(file);
//change the record in the file.
sWr
Ïà¹ØÎÊ´ð£º
ÎÒÕâÀïÓÐÒ»¸öµÇ½WIFIÍøÂçµÄÒ³Ãæ¡£ÓÉÓÚWIFI¾³£¶ÏÏߣ¬ËùÒÔÒª·´¸´µØÔÚÕâ¸öÍøÒ³Éϵǽ£¬Ã»·¨ÎÞÈËÖµÊØ¡£
ËùÒÔ£¬ÎÒÏë×öÒ»¸öC#³ÌÐò£¬·ÅÒ»¸öwebbrowser¿Ø¼þ£¬×Ô¶¯Ìî±í²¢×Ô¶¯µã»÷Ìá½»°´Å¥¡£
ÎÊÌâÒ»£º
»ù±¾ÕÕÍøÉÏÕҵijÌÐò ......
ÈçÌ⣬C/C++ÖеÄexeclÔõôµ÷ÓÃдºÃµÄjava³ÌÐò£¬
execl("/opt/java1.5/bin/java","MyClass",NULL);
ÕâÑùµÄ²»ÐÐŶ¡£
²»»á.
ÔËÐÐjava³ÌÐò
ÕÒ¹¤¾ß²é¿´Ò»ÏÂÄǸö³ÌÐòµÄÃüÁîÐÐ
ËÑË÷Ï£ºjni ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
°ï°ï棬лл~
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 ......