zoukankan      html  css  js  c++  java
  • 下载地址转换工具代码

    因为我有时候下H片是迅雷的地址而我又不是迅雷会员,无法离线下载。我QQ旋风又可以离线下载,于是乎在网上搜了一下参考代码,写了一个转换器。以后下H片就不怕不怕拉。

    using System;
    using System.Collections.Generic;
    using System.Text;

    namespace DownloadConvert
    {
    public class ConvertClass
    {
    public ConvertClass()
    {

    }

    /// <summary>
    /// 下载地址转换方法
    /// </summary>
    /// <param name="ZHLX">转换类型</param>
    /// <param name="In_Address">输入地址</param>
    /// <returns></returns>
    public static string ConvertStr(string ZHLX,string In_Address)
    {
    string Out_Address = "";//存储输出地址
    int index = In_Address.Trim().ToLower().LastIndexOf("/");
    string StrTo = In_Address.ToLower();

    if(StrTo.StartsWith("thunder://"))//如果当前输入下载地址是迅雷下载地址
    {
    byte[] output = { };
    output
    = Convert.FromBase64String(In_Address.Substring(index +1));
    string str = Encoding.Default.GetString(output);
    string strSub = str.Substring(2,str.Length - 4);
    switch(ZHLX)
    {
    case "普通HTTP":
    Out_Address
    = strSub;
    break;
    case "迅雷地址":
    Out_Address
    = In_Address;
    break;
    case "旋风地址":
    byte[] byte_XF = Encoding.Default.GetBytes(strSub);
    Out_Address
    = "qqdl://" + Convert.ToBase64String(byte_XF);
    break;
    case "快车地址":
    string App = "[FLASHGET]" + strSub + "[FLASHGET]";
    byte[] byte_KC = Encoding.Default.GetBytes(App);
    Out_Address
    = "flashget://" + Convert.ToBase64String(byte_KC) + "&JiangZheng711";
    break;

    }
    }
    else if (StrTo.StartsWith("qqdl://"))
    {
    byte[] output = { };
    output
    = Convert.FromBase64String(In_Address.Substring(index + 1));
    string str = Encoding.Default.GetString(output);
    switch (ZHLX)
    {
    case "普通HTTP":
    Out_Address
    = str;
    break;
    case "迅雷地址":
    string App = "AA" + str + "ZZ";
    byte[] bytes_XL = Encoding.Default.GetBytes(App);
    Out_Address
    = "thunder://" + Convert.ToBase64String(bytes_XL);
    break;
    case "旋风地址":
    Out_Address
    = In_Address;
    break;
    case "快车地址":
    string AppStr = "[FLASHGET]" + str + "[FLASHGET]";
    byte[] byte_KC = Encoding.Default.GetBytes(AppStr);
    Out_Address
    = "flashget://" + Convert.ToBase64String(byte_KC) + "&JiangZheng711";
    break;
    }
    }
    else if (StrTo.StartsWith("flashget://"))
    {
    byte[] outputb = { };
    int FlashSpe = In_Address.Trim().IndexOf("&");
    outputb
    = Convert.FromBase64String(In_Address.Trim().Substring(index + 1, FlashSpe - "flashget://".Length));
    string str = Encoding.Default.GetString(outputb);
    int indexS = str.IndexOf("]");
    int indexE = str.LastIndexOf("[");
    string strSub = str.Substring(indexS + 1, indexE - indexS - 1);

    switch (ZHLX)
    {
    case "普通HTTP":
    Out_Address
    = strSub;
    break;
    case "迅雷地址":
    string App = "AA" + str + "ZZ";
    byte[] bytes_XL = Encoding.Default.GetBytes(App);
    Out_Address
    = "thunder://" + Convert.ToBase64String(bytes_XL);
    break;
    case "快车地址":
    Out_Address
    = In_Address;
    break;
    case "旋风地址":
    byte[] byte_XF = Encoding.Default.GetBytes(strSub);
    Out_Address
    = "qqdl://" + Convert.ToBase64String(byte_XF);
    break;
    }
    }
    else
    {
    switch (ZHLX)
    {
    case "普通HTTP":
    Out_Address
    = In_Address;
    break;
    case "迅雷地址":
    string App = "AA" + In_Address + "ZZ";
    byte[] bytes_XL = Encoding.Default.GetBytes(App);
    Out_Address
    = "thunder://" + Convert.ToBase64String(bytes_XL);
    break;
    case "快车地址":
    string AppS = "[FLASHGET]" + In_Address + "[FLASHGET]";
    byte[] byte_KC = Encoding.Default.GetBytes(AppS);
    Out_Address
    = "flashget://" + Convert.ToBase64String(byte_KC) + "&JiangZheng711";
    break;
    case "旋风地址":
    byte[] byte_XF = Encoding.Default.GetBytes(In_Address);
    Out_Address
    = "qqdl://" + Convert.ToBase64String(byte_XF);
    break;
    }
    }
    return Out_Address;
    }
    }
    }

    点击下载源代码

  • 相关阅读:
    51Nod-1013 3的幂的和【快速模幂+逆元】
    51Nod-1082 与7无关的数【进制+打表】
    51Nod-1080 两个数的平方和【暴力法】
    51Nod-1015 水仙花数【进制+查表搜索】
    51Nod-1003 阶乘后面0的数量【分析思维】
    51Nod-1002 数塔取数问题【DP】
    51Nod-1179 最大的最大公约数【暴力】
    51Nod-1018 排序【排序】
    51Nod-1126 求递推序列的第N项【递推序列+模除】
    51Nod-1031 骨牌覆盖【递推】
  • 原文地址:https://www.cnblogs.com/junjie94wan/p/2127995.html
Copyright © 2011-2022 走看看