下載某云音樂源文件.mp4格式

首先隨便點進一首歌，如圖所示獲取該音樂id，然后點擊播放鍵，打開F12進行查詢XHR

由此可知，實際請求網(wǎng)址是

https://music.163.com/weapi/song/enhance/player/url/v1?csrf_token=「你的token」url需帶上token，請求參數(shù)有兩個：params、encSecKey返回json里的id就是該音樂id，url就是本次的目標音樂源文件鏈接

繼續(xù)查看啟動器，查看該路由的調(diào)用堆棧信息，找到關鍵位置打斷點，不會找斷點的就每個堆棧全部點進去設置斷點，然后看哪一個斷點結(jié)束后url已完成請求的就是關鍵位置，從下圖的文件中可知，核心文件是core_xxxxx.js，可以直接下載到本地方便查看代碼。（堆棧執(zhí)行順序是由下至上）

第一步，已成功定位到請求路由，e7d.data里已經(jīng)帶有(params、encSecKey)，后續(xù)就直接會請求了，那么就繼續(xù)向上一個堆棧找此函數(shù)的參數(shù)（x7q，e7d）中的e7d是從哪里傳的。

PS：請注意，一定要找到我們要找的核心url是否由此斷點發(fā)出的，由于一些方法會被反復調(diào)用，參數(shù)值是不一定的。

第二步，上圖已封裝好了e7d，且參數(shù)params、encSecKey已出現(xiàn)，是由window.asrsea產(chǎn)生的，繼續(xù)查找window.asrsea是哪個方法。

window.asrsea(JSON.stringify(i7b), bsc2x(["流淚", "強"]), bsc2x(RU7N.md), bsc2x(["愛心", "女孩", "驚恐", "大笑"]));

鼠標懸浮該方法后定位至這里，核心就是這個function d，接受4個參數(shù)，分別對應上面的4個值。

其中第一個參數(shù)i7b是以下參數(shù)構成music_id = XXXXXX
song_data = {"ids": f"[{music_id}]","level": "standard","encodeType": "aac","csrf_token": csrf_token
}第三個參數(shù)md是一個固定列表，第二、第四個參數(shù)也是一個短列表值。

核心方法已找到，就是function d()，剩下的工作就是把d方法里需要涉及到的所有function全部找出來，比如function b、c，然后繼續(xù)從b、c里繼續(xù)遞歸找方法，這一步工作比較繁瑣需要耐心。直至自己用js能把function d給跑通就算成功。

通過js里的方法可知，里面算法還涉及到了加密，需要用到crypto-js庫，上網(wǎng)百度搜一下直接下載該庫的代碼保存本地。

以下是js文件代碼：

var CryptoJS = require('./package/crypto-js.js');var bd7W = {};var maxDigits,ZERO_ARRAY,bigZero,bigOne,dpl10,lr10,hexatrigesimalToChar,hexToChar,highBitMasks,lowBitMasks,biRadixBase = 2,biRadixBits = 16,bitsPerDigit = biRadixBits,biRadix = 65536,biHalfRadix = biRadix >>> 1,biRadixSquared = biRadix * biRadix,maxDigitVal = biRadix - 1,maxInteger = 9999999999999998;setMaxDigits(20),dpl10 = 15,lr10 = biFromNumber(1e15),hexatrigesimalToChar = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"),hexToChar = new Array("0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f"),highBitMasks = new Array(0, 32768, 49152, 57344, 61440, 63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535),lowBitMasks = new Array(0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535);function encryptedString(a, b) {for (var f, g, h, i, j, k, l, c = new Array, d = b.length, e = 0; d > e;)c[e] = b.charCodeAt(e),e++;for (; 0 != c.length % a.chunkSize;)c[e++] = 0;for (f = c.length, g = "", e = 0; f > e; e += a.chunkSize) {for (j = new BigInt, h = 0, i = e; i < e + a.chunkSize; ++h)j.digits[h] = c[i++],j.digits[h] += c[i++] << 8;k = a.barrett.powMod(j, a.e),l = 16 == a.radix ? biToHex(k) : biToString(k, a.radix),g += l + " "}return g.substring(0, g.length - 1)
}function biSubtract(a, b) {var c,d,e,f;if (a.isNeg != b.isNeg)b.isNeg = !b.isNeg,c = biAdd(a, b),b.isNeg = !b.isNeg;else {for (c = new BigInt, e = 0, f = 0; f < a.digits.length; ++f)d = a.digits[f] - b.digits[f] + e,c.digits[f] = 65535 & d,c.digits[f] < 0 && (c.digits[f] += biRadix),e = 0 - Number(0 > d);if (-1 == e) {for (e = 0, f = 0; f < a.digits.length; ++f)d = 0 - c.digits[f] + e,c.digits[f] = 65535 & d,c.digits[f] < 0 && (c.digits[f] += biRadix),e = 0 - Number(0 > d);c.isNeg = !a.isNeg} elsec.isNeg = a.isNeg}return c
}function biCompare(a, b) {if (a.isNeg != b.isNeg)return 1 - 2 * Number(a.isNeg);for (var c = a.digits.length - 1; c >= 0; --c)if (a.digits[c] != b.digits[c])return a.isNeg ? 1 - 2 * Number(a.digits[c] > b.digits[c]) : 1 - 2 * Number(a.digits[c] < b.digits[c]);return 0}function biMultiplyByRadixPower(a, b) {var c = new BigInt;return arrayCopy(a.digits, 0, c.digits, b, c.digits.length - b), c}function arrayCopy(a, b, c, d, e) {var g,h,f = Math.min(b + e, a.length);for (g = b, h = d; f > g; ++g, ++h)c[h] = a[g]}function biShiftLeft(a, b) {var e,f,g,h,c = Math.floor(b / bitsPerDigit),d = new BigInt;for (arrayCopy(a.digits, 0, d.digits, c, d.digits.length - c), e = b % bitsPerDigit, f = bitsPerDigit - e, g = d.digits.length - 1, h = g - 1; g > 0; --g, --h)d.digits[g] = d.digits[g] << e & maxDigitVal | (d.digits[h] & highBitMasks[e]) >>> f;return d.digits[0] = d.digits[g] << e & maxDigitVal, d.isNeg = a.isNeg, d}function biFromNumber(a) {var c,b = new BigInt;for (b.isNeg = 0 > a, a = Math.abs(a), c = 0; a > 0;)b.digits[c++] = a & maxDigitVal,a >>= biRadixBits;return b}function biNumBits(a) {var e,b = biHighIndex(a),c = a.digits[b],d = (b + 1) * bitsPerDigit;for (e = d; e > d - bitsPerDigit && 0 == (32768 & c); --e)c <<= 1;return e}function biDivideModulo(a, b) {var f,g,h,i,j,k,l,m,n,o,p,q,r,s,c = biNumBits(a),d = biNumBits(b),e = b.isNeg;if (d > c)return a.isNeg ? (f = biCopy(bigOne), f.isNeg = !b.isNeg, a.isNeg = !1, b.isNeg = !1, g = biSubtract(b, a), a.isNeg = !0, b.isNeg = e) : (f = new BigInt, g = biCopy(a)), new Array(f, g);for (f = new BigInt, g = a, h = Math.ceil(d / bitsPerDigit) - 1, i = 0; b.digits[h] < biHalfRadix;)b = biShiftLeft(b, 1),++i,++d,h = Math.ceil(d / bitsPerDigit) - 1;for (g = biShiftLeft(g, i), c += i, j = Math.ceil(c / bitsPerDigit) - 1, k = biMultiplyByRadixPower(b, j - h); -1 != biCompare(g, k);)++f.digits[j - h],g = biSubtract(g, k);for (l = j; l > h; --l) {for (m = l >= g.digits.length ? 0 : g.digits[l], n = l - 1 >= g.digits.length ? 0 : g.digits[l - 1], o = l - 2 >= g.digits.length ? 0 : g.digits[l - 2], p = h >= b.digits.length ? 0 : b.digits[h], q = h - 1 >= b.digits.length ? 0 : b.digits[h - 1], f.digits[l - h - 1] = m == p ? maxDigitVal : Math.floor((m * biRadix + n) / p), r = f.digits[l - h - 1] * (p * biRadix + q), s = m * biRadixSquared + (n * biRadix + o); r > s;)--f.digits[l - h - 1],r = f.digits[l - h - 1] * (p * biRadix | q),s = m * biRadix * biRadix + (n * biRadix + o);k = biMultiplyByRadixPower(b, l - h - 1),g = biSubtract(g, biMultiplyDigit(k, f.digits[l - h - 1])),g.isNeg && (g = biAdd(g, k), --f.digits[l - h - 1])}return g = biShiftRight(g, i), f.isNeg = a.isNeg != e, a.isNeg && (f = e ? biAdd(f, bigOne) : biSubtract(f, bigOne), b = biShiftRight(b, i), g = biSubtract(b, g)), 0 == g.digits[0] && 0 == biHighIndex(g) && (g.isNeg = !1), new Array(f, g)}function BarrettMu_modulo(a) {var i,b = biDivideByRadixPower(a, this.k - 1),c = biMultiply(b, this.mu),d = biDivideByRadixPower(c, this.k + 1),e = biModuloByRadixPower(a, this.k + 1),f = biMultiply(d, this.modulus),g = biModuloByRadixPower(f, this.k + 1),h = biSubtract(e, g);for (h.isNeg && (h = biAdd(h, this.bkplus1)), i = biCompare(h, this.modulus) >= 0; i;)h = biSubtract(h, this.modulus),i = biCompare(h, this.modulus) >= 0;return h}function BarrettMu_multiplyMod(a, b) {var c = biMultiply(a, b);return this.modulo(c)}function biDivideByRadixPower(a, b) {var c = new BigInt;return arrayCopy(a.digits, b, c.digits, 0, c.digits.length - b), c}function reverseStr(a) {var c,b = "";for (c = a.length - 1; c > -1; --c)b += a.charAt(c);return b}function digitToHex(a) {var b = 15,c = "";for (i = 0; 4 > i; ++i)c += hexToChar[a & b],a >>>= 4;return reverseStr(c)}function biToHex(a) {var d,b = "";for (biHighIndex(a), d = biHighIndex(a); d > -1; --d)b += digitToHex(a.digits[d]);return b}function biModuloByRadixPower(a, b) {var c = new BigInt;return arrayCopy(a.digits, 0, c.digits, 0, b), c}function biCompare(a, b) {if (a.isNeg != b.isNeg)return 1 - 2 * Number(a.isNeg);for (var c = a.digits.length - 1; c >= 0; --c)if (a.digits[c] != b.digits[c])return a.isNeg ? 1 - 2 * Number(a.digits[c] > b.digits[c]) : 1 - 2 * Number(a.digits[c] < b.digits[c]);return 0}function biMultiply(a, b) {var d,h,i,k,c = new BigInt,e = biHighIndex(a),f = biHighIndex(b);for (k = 0; f >= k; ++k) {for (d = 0, i = k, j = 0; e >= j; ++j, ++i)h = c.digits[i] + a.digits[j] * b.digits[k] + d,c.digits[i] = h & maxDigitVal,d = h >>> biRadixBits;c.digits[k + e + 1] = d}return c.isNeg = a.isNeg != b.isNeg, c}function BarrettMu_powMod(a, b) {var d,e,c = new BigInt;for (c.digits[0] = 1, d = a, e = b;;) {if (0 != (1 & e.digits[0]) && (c = this.multiplyMod(c, d)), e = biShiftRight(e, 1), 0 == e.digits[0] && 0 == biHighIndex(e))break;d = this.multiplyMod(d, d)}return c}function biShiftRight(a, b) {var e,f,g,h,c = Math.floor(b / bitsPerDigit),d = new BigInt;for (arrayCopy(a.digits, c, d.digits, 0, a.digits.length - c), e = b % bitsPerDigit, f = bitsPerDigit - e, g = 0, h = g + 1; g < d.digits.length - 1; ++g, ++h)d.digits[g] = d.digits[g] >>> e | (d.digits[h] & lowBitMasks[e]) << f;return d.digits[d.digits.length - 1] >>>= e, d.isNeg = a.isNeg, d}function biMultiplyDigit(a, b) {var c,d,e,f;for (result = new BigInt, c = biHighIndex(a), d = 0, f = 0; c >= f; ++f)e = result.digits[f] + a.digits[f] * b + d,result.digits[f] = e & maxDigitVal,d = e >>> biRadixBits;return result.digits[1 + c] = d, result}function biDivide(a, b) {return biDivideModulo(a, b)[0]}function biCopy(a) {var b = new BigInt(!0);return b.digits = a.digits.slice(0), b.isNeg = a.isNeg, b}function BarrettMu(a) {this.modulus = biCopy(a),this.k = biHighIndex(this.modulus) + 1;var b = new BigInt;b.digits[2 * this.k] = 1,this.mu = biDivide(b, this.modulus),this.bkplus1 = new BigInt,this.bkplus1.digits[this.k + 1] = 1,this.modulo = BarrettMu_modulo,this.multiplyMod = BarrettMu_multiplyMod,this.powMod = BarrettMu_powMod}function BigInt(a) {this.digits = "boolean" == typeof a && 1 == a ? null : ZERO_ARRAY.slice(0),this.isNeg = !1}function charToHex(a) {var h,b = 48,c = b + 9,d = 97,e = d + 25,f = 65,g = 90;return h = a >= b && c >= a ? a - b : a >= f && g >= a ? 10 + a - f : a >= d && e >= a ? 10 + a - d : 0}function hexToDigit(a) {var d,b = 0,c = Math.min(a.length, 4);for (d = 0; c > d; ++d)b <<= 4,b |= charToHex(a.charCodeAt(d));return b
}function biFromHex(a) {var d,e,b = new BigInt,c = a.length;for (d = c, e = 0; d > 0; d -= 4, ++e)b.digits[e] = hexToDigit(a.substr(Math.max(d - 4, 0), Math.min(d, 4)));return b}function RSAKeyPair(a, b, c) {this.e = biFromHex(a),this.d = biFromHex(b),this.m = biFromHex(c),this.chunkSize = 2 * biHighIndex(this.m),this.radix = 16,this.barrett = new BarrettMu(this.m)}function biHighIndex(a) {for (var b = a.digits.length - 1; b > 0 && 0 == a.digits[b];)--b;return b}function setMaxDigits(a) {maxDigits = a,ZERO_ARRAY = new Array(maxDigits);for (var b = 0; b < ZERO_ARRAY.length; b++)ZERO_ARRAY[b] = 0;bigZero = new BigInt,bigOne = new BigInt,bigOne.digits[0] = 1}var Hb6V = function(i7b, u7n) {try {u7n = u7n.toLowerCase();if (i7b === null)return u7n == "null";if (i7b === undefined)return u7n == "undefined";return bd7W.toString.call(i7b).toLowerCase() == "[object " + u7n + "]"} catch (e) {console.log(e)return !1}};var md = ["色", "流感", "這邊", "弱", "嘴唇", "親", "開心", "呲牙", "憨笑", "貓", "皺眉", "幽靈", "蛋糕", "發(fā)怒", "大哭", "兔子", "星星", "鐘情", "牽手", "公雞", "愛意", "禁止", "狗", "親親", "叉", "禮物", "暈", "呆", "生病", "鉆石", "拜", "怒", "示愛", "汗", "小雞", "痛苦", "撇嘴", "惶恐", "口罩", "吐舌", "心碎", "生氣", "可愛", "鬼臉", "跳舞", "男孩", "奸笑", "豬", "圈", "便便", "外星", "圣誕"]var emj =  {"色": "00e0b","流感": "509f6","這邊": "259df","弱": "8642d","嘴唇": "bc356","親": "62901","開心": "477df","呲牙": "22677","憨笑": "ec152","貓": "b5ff6","皺眉": "8ace6","幽靈": "15bb7","蛋糕": "b7251","發(fā)怒": "52b3a","大哭": "b17a8","兔子": "76aea","星星": "8a5aa","鐘情": "76d2e","牽手": "41762","公雞": "9ec4e","愛意": "e341f","禁止": "56135","狗": "fccf6","親親": "95280","叉": "104e0","禮物": "312ec","暈": "bda92","呆": "557c9","生病": "38701","鉆石": "14af6","拜": "c9d05","怒": "c4f7f","示愛": "0c368","汗": "5b7a4","小雞": "6bee2","痛苦": "55932","撇嘴": "575cc","惶恐": "e10b4","口罩": "24d81","吐舌": "3cfe4","心碎": "875d3","生氣": "e8204","可愛": "7b97d","鬼臉": "def52","跳舞": "741d5","男孩": "46b8e","奸笑": "289dc","豬": "6935b","圈": "3ece0","便便": "462db","外星": "0a22b","圣誕": "8e7","流淚": "01000","強": "1","愛心": "0CoJU","女孩": "m6Qyw","驚恐": "8W8ju","大笑": "d"}var gO9F =  function(i7b) {return Hb6V(i7b, "function")}var bh7a =  function(k7d, cH8z, O7H) {if (!k7d || !k7d.length || !gO9F(cH8z))return this;if (!!k7d.forEach) {k7d.forEach(cH8z, O7H);return this}for (var i = 0, l = k7d.length; i < l; i++)cH8z.call(O7H, k7d[i], i, k7d);return this}var bsc2x = function(cya8S) {var m7f = [];bh7a(cya8S, function(cxZ8R) {m7f.push(emj[cxZ8R])});return m7f.join("")};function a(a) {var d,e,b = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789",c = "";for (d = 0; a > d; d += 1)e = Math.random() * b.length,e = Math.floor(e),c += b.charAt(e);return c}function b(a, b) {var c = CryptoJS.enc.Utf8.parse(b),d = CryptoJS.enc.Utf8.parse("0102030405060708"),e = CryptoJS.enc.Utf8.parse(a),f = CryptoJS.AES.encrypt(e, c, {iv: d,mode: CryptoJS.mode.CBC});return f.toString()}function c(a, b, c) {var d,e;return setMaxDigits(131), d = new RSAKeyPair(b, "", c), e = encryptedString(d, a)}function decrypt(d, e, f, g) {var h = {}, i = a(16);return h.encText = b(d, g),h.encText = b(h.encText, i),h.encSecKey = c(i, e, f),h}function e(a, b, d, e) {var f = {};return f.encText = c(a + e, b, d), f}function get_efg(){var r = {}r.e = bsc2x(["流淚", "強"])r.f = bsc2x(md)r.g = bsc2x(["愛心", "女孩", "驚恐", "大笑"])return r}

以下是python部分代碼，由于要用到js，需要用到execjs庫，自行百度pip install。

import traceback
import json
import requests
import execjswith open("wangyiyun.js") as f:jscode = f.read()
js = execjs.compile(jscode)csrf_token = "your_token"
url = f"https://music.163.com/weapi/song/enhance/player/url/v1?csrf_token={csrf_token}"headers = {"Accept": "*/*","Host": "music.163.com","Accept-Language": "zh-CN,zh-Hans;q=0.9","Content-Type": "application/x-www-form-urlencoded","Accept-Encoding": "gzip, deflate, br","User-Agent": "Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/16.2 Safari/605.1.15","Referer": "https://music.163.com/","Connection": "keep-alive","Cookie": "ntes_kaola_ad=1; JSESSIONID-WYYY=NNam6ZvnitTQAIxhjcnkVGOJe1CSrnqIOsBnuOzx405%2FJAUSng5IDkYIFo00Xb%2BoUldg8unn3ikRohd8TEg%2F5A9IF0d3vIrPq0ggue%2BD%2FCFTwZBaj%2FfbHOgwt15v2R4uXH8%2FJuMri%2F3zPb%2Bl7TH%2B4XFVYq9BghtkAelO6p5uAC4QQxNh%3A1735613258319; _iuqxldmzr_=32; playerid=96541318; WEVNSM=1.0.0; WM_TID=%2FnYekZpayJFEEEVQRRfHMEPNaHmTqyHZ; MUSIC_U=006C5AF78BF74B16F27E5B57A85731911569EB8ABB9380E9315B54803127FFDF3C459640CCB0E2BDE8425D2EE33764BC1DB30AA186B850E1CED2B79EF2436E56F8786A63776BFC2243956C5AC987B3A85797BC545993FB84F14E3C4C66EF506A087542A5DE0B218EEA044FDCED41F7037A2EA93679113D60D72EAD7603A7B74BAF1EA4753BF65B585F5130F58CC7711D5EB79F559AD803761591C3D9AB83F967DDFA019B5C6C58BB126197139D1D4BB311DED63FECC8F6651349C211AEE6BB2A772FFCB717C731082DE27A19C5F24FB6A3311D4B585E8FA92DF7D35A41F4FCCA7129B921D0ABA174034FCDB36CAE4BB69011E30F7A7A657B1D74C7DCE0CCEB7B01E6F34CE848E3627CAF9D536C3255A80CF5B8064216064E40C7AD67CDF74EC118D8F2D4B6D4A0031A2969ABF5BB2FC4CFDE6E679AA4CB5609C96901D706E9500E94B86D80E4A6A3065227ED8690F5686FF885DC3BB6F1DA7467CEB7D4D42A10B4; __csrf=ca6ddf56d40cc8a27f331f202fe4b326; gdxidpyhxdE=4xfjyEeg4lc3N%5Ch2d%5Cmuya67isI3pZMPzyE5piBKE4MbnmjX8cO%2BUPnScJ7ZVrK8%2FyENi%2FPm%2FUJ%5C7Jt7%2Fu%5CxVq0KD8x%2Bs2uyBrRX6bcW9sjSWg%5Cw%2F7KNEkKk%5C6Mn6dM0bzaQBt%2F06wgBdKtOe3TuWkbDmcE6EvqXOdSnvvjBjs44kdz0%3A1735610638700; __snaker__id=1FPbd4ulJdEVbVUp; ntes_utid=tid._.m%252BLT1NjmAjZAUkFUAAaSMBOdaWzOWutc._.0; sDeviceId=YD-YPiVIvIe3u5EAxABBUfFxyhoxuMxXPie; WNMCID=scyqtk.1735609723331.01.0; WM_NI=AvJ1%2BaTN%2Bars6kp4BqZR6lew0ErnCxDEjplQcna1dpw2o38u%2BYsJZfwf7oZZx3RYpR1b0M2XDa5vbBs0LlSAcWKBQpCU5WBUbXnW%2BM%2BjOjngWravnIJ5CDCtziN4QsN0MW8%3D; WM_NIKE=9ca17ae2e6ffcda170e2e6eea6fb4089be9ab8f74483eb8ab3c55f928f8e83d769869482b1c73985abb6a5e72af0fea7c3b92a83aa86d2aa6b9892e582f179f6b5c0d5c17b9a8efa8de87df49bbe8fc274889ba691ef5ba1b2afd2e77cb5eea1d4bb7fe987bdabd96eb5baf990d952bced9ebaf35af3be00aeb15488bffb97e14ab1f0848dd24ba18985a3d47c818bfbb8c15fa288a2b8aa47e9b6818bed6d95aeaf97ed438aeb8da5c280bab782d5d4798ef083b8bb37e2a3; _ntes_nnid=0abb01037659f4b4a2020921c96bcfd4,1735609718336; _ntes_nuid=0abb01037659f4b4a2020921c96bcfd4; NMTID=00Ob7X1eXe08UIQIk_Bl7cELz7aKHkAAAGQCjtDIA",
}# 音樂id
music_id = 2122122972
song_data = {"ids": f"[{music_id}]","level": "standard","encodeType": "aac","csrf_token": csrf_token
}# 獲取js運行的結(jié)果
try:efg_obj = js.call("get_efg")res = js.call("decrypt", *(json.dumps(song_data), efg_obj["e"], efg_obj["f"], efg_obj["g"]))
except:print(traceback.format_exc())data = {"params": res["encText"],"encSecKey": res["encSecKey"],
}resp = requests.post(url, headers=headers, data=data)print(resp.status_code)
print(resp.text)music = requests.get(url=resp.json()["data"][0]["url"])
with open(f"{music_id}.m4a", "wb") as f:f.write(music.content)