zoukankan      html  css  js  c++  java
  • C# HTTP

    /// <summary>
      /// 返回URL内容,带POST数据提交
      /// </summary>
      /// <param name="url"></param>
      /// <param name="data"></param>
      /// <param name="method">GET/POST(默认)</param>
      /// <returns></returns>
      public static string SendData(string url,string data,string method)
      {
       WebRequest wr = WebRequest.Create(url);//http://192.168.0.179:57/test1.aspx
       wr.Method = method;
       wr.ContentType = "application/x-www-form-urlencoded";
       char[] reserved = {'?', '=', '&'};
       StringBuilder UrlEncoded = new StringBuilder();
       byte[] SomeBytes = null;
       if (data != null) 
       {
        SomeBytes = EncodedData(data);
        wr.ContentLength = SomeBytes.Length;
        Stream newStream = wr.GetRequestStream();
        newStream.Write(SomeBytes, 0, SomeBytes.Length);
        newStream.Close();
       }
       else
       {
        wr.ContentLength = 0;
       }
       string re = "";
       try
       {
        WebResponse result = wr.GetResponse();
        Stream ReceiveStream = result.GetResponseStream();

        Byte[] read = new Byte[512];
        int bytes = ReceiveStream.Read(read, 0, 512);

        re = "";
        while (bytes > 0)
        {

         // 注意:
         // 下面假定响应使用 UTF-8 作为编码方式。
         // 如果内容以 ANSI 代码页形式(例如,932)发送,则使用类似下面的语句:
         //  Encoding encode = System.Text.Encoding.GetEncoding("shift-jis");
         Encoding encode = System.Text.Encoding.GetEncoding("gb2312");
         re += encode.GetString(read, 0, bytes);
         bytes = ReceiveStream.Read(read, 0, 512);
        }
       }
       catch(Exception e)
       {
        re = e.Message;
       }
       return re;
      }
  • 相关阅读:
    笔记35 跨重定向请求传递数
    判断邮箱的正则表达式
    按钮
    async await 的用法
    笔记34 Spring MVC的高级技术——处理multipart形式的数据
    Convert Sorted Array to Binary Search Tree
    Binary Tree Zigzag Level Order Traversal
    Unique Binary Search Trees,Unique Binary Search Trees II
    Validate Binary Search Tree
    Populating Next Right Pointers in Each Node,Populating Next Right Pointers in Each Node II
  • 原文地址:https://www.cnblogs.com/BungeeJumping/p/3384295.html
Copyright © 2011-2022 走看看