zoukankan      html  css  js  c++  java
  • 获取*所在地

    请直接看代码:
    private  static string[] GetMobileInfo(string number)
            {
                try
                {
                    XmlDocument xmlDocument = new XmlDocument();
                    xmlDocument.Load("http://api.showji.com/Locating/default.aspx?m=" + number);
                    XmlNamespaceManager cx = new XmlNamespaceManager(xmlDocument.NameTable);
                    cx.AddNamespace("content""http://api.showji.com/Locating/");
                    XmlNodeList nodes = xmlDocument.SelectNodes("//content:QueryResult|//content:Mobile|//content:Province|//content:City|//content:Corp|//content:Card|//content:AreaCode|//content:PostCode", cx);
                    if (nodes.Count == 8)
                    {
                        if ("True".Equals(nodes[1].InnerText))
                        {
                            return new string[]
                                       {
                                           nodes[0].InnerText, nodes[2].InnerText, nodes[3].InnerText, nodes[4].InnerText,
                                           nodes[5].InnerText, nodes[6].InnerText + nodes[7].InnerText
                                       };
                        }
                    }
                    return new string[] { "false" };
                }
                catch (Exception)
                {
                    return new string[] { "false" };
                }
            }
            private void button1_Click(object sender, EventArgs e)
            {
                try
                {
                    string[] num = GetMobileInfo(textBox1.Text);
                    MessageBox.Show("所查号码:" + num[0] + "\n归属省份:" + num[1] + "\n归属城市:" + num[2] + "\n城市区号:" + num[3] + "\n城市邮编:" +
                                    num[4] + "\n卡 类 型:" + num[5], "查询结果", MessageBoxButtons.OK, MessageBoxIcon.Information);
                }
                catch (Exception ex)
                {
                    MessageBox.Show(ex.Message,"错误提示",MessageBoxButtons.OK,MessageBoxIcon.Warning);
                }
            }
  • 相关阅读:
    51 Nod 1086 多重背包问题(单调队列优化)
    51 Nod 1086 多重背包问题(二进制优化)
    51 Nod 1085 01背包问题
    poj 2559 Largest Rectangle(单调栈)
    51 Nod 1089 最长回文子串(Manacher算法)
    51 Nod N的阶乘的长度 (斯特林近似)
    51 Nod 1134 最长递增子序列(经典问题回顾)
    51 Nod 1020 逆序排列
    PCA-主成分分析(Principal components analysis)
    Python中cPickle
  • 原文地址:https://www.cnblogs.com/bober/p/2311904.html
Copyright © 2011-2022 走看看