Python爬虫实战之爬取web网易云音乐——解析
找到存储歌曲地址的url界面
首先我们要进入网易云的web页面在页面中我们随意选择一首歌曲，打开开发者工具查看响应的界面。
在这些页面中我们需要查找存储有音乐文件的url，这是我们可以打开全局搜索直接搜索与音频文件后缀相关的文件。(当然这这里可能会白忙活)
因为我们打开媒体文件，看见的后缀是.m4a，这也是类属于音频文件的一种只是划分的更细一点。(媒体文件一般包括音频和视频)
我们知道了返回的音频的格式，这时我们就知道我们需要找什么样的返回格式了，直接ctrl+f搜索.m4a,我们可以看见这样一个界面
如果想更直观的观看就点击预览：
这时我们就知道在这个页面中返回了一些什么参数，code：200成功请求，歌曲的id号也可以说是歌曲的省份证，类型url地址，还有一些不知道干什么的参数，我们都可以通过键名猜测它是干嘛的，（如果还不放心也可以直接复制url地址打开看一看）
确定了返回的界面我们的第一步就已经完成了。
对比寻找我们需要的传递解密的参数
第二步我们就需要尝试多请求几首不同的歌曲发现里面有什么不同的参数。
可以看到post传递的参数有两个params和ensSeckey，哪里面的内容是什么呢，我们如何才能够传递像浏览器一样的参数，那是我们下一个需要解决的问题。
如果我们把自己想象为网页的负责人，一定不想让爬虫顺利的爬取我们网页的内容把，这时我们就会设置措施，这就是反爬，我们又想要数据这就是对抗。这里不得不提醒下爬虫需要注意的三个准则。
1.经常的看爬取网站的君子协议（Robots.txt协议，里面也可以看见网页允许什么样的请求头，那样我们的爬虫体验将是一种新待遇）
2.在不影响服务器端正常运行的前提下进行爬虫
3.不要使用爬虫进行不当得利，这样会违背不当竞争，如果东窗事发一告一个准。
说了这么多的题外话，就是希望我们在每一次爬虫时都要构造请求头，这里需要注意到是一个浏览器自带的代理地址，还有一个是cookie，cookie是一个有时效性的身份认证，里面有时也会带有必要的参数，需要我们去破解。
而在这里我们可以使用插件工具进行在线测试，在页面中我没有对请求头传入任何数据，值传递了post参数也能够完成请求，所以我们在这里可以不用构造请求头，但是作为一个有专业素养的爬虫高手，习惯的写上去了。
插件的名字叫Talend API Tester – Free Edition
如有需要自行下载：密码：1kbc(需要解压点击crx文件压缩，edg开发者模式自行配置路径)
https://pan.baidu.com/s/1uFadnzIq10WDbiYNRqpRrg?pwd=1kbc
到了这里我们我们知道只需要向网页传递post的数据返回值里面就会有音乐的源文件地址，第二步我们也完成了。
分析post表单数据
输出模块
我们如何知道这数据是怎么来的呢？
第一种关键字查找，我们可以使用CTRL+shift+f进行全局搜索params:和encSecKey:的一个
搜索直接带我们返回到了源代码的这儿，而且params:和encSecKey:还是成对出现的，只能说很大概率是这里，要确定就需要我们进一步的验证，这就是断点调试看见了返回页面需要经过这里。
这时我们就需要对这里的js代码进行分析了，可以看出有一个函数传入四个参数然后赋值于bVe7X，之后我们传递的参数带入到bVe7X，返回我们的post参数。这里我们就需要去研究这个window.asrsea函数的内部构造。
点击跳转我们到了这样一个函数体中，我们把断点打在这里不断的调试，
这里一共有五个函数，a函数是生成16给字符的随机字符串 ，b函数传入两个值进行加密模块，这里是AES对称加密，下面的偏移和模块CBC都是常见的加密方式。我们可以经过不断的尝试把这三个函数一python代码表示出来，我们知道在界面的post数据是如何输出的，接下来我们就需要知道我们需要输入什么数据了。
输入数据
在不断的尝试中我知道了window.asrsea函数中传入的4个参数有三个是固定值，那还有一个是确定歌曲的唯一标识。
那还有一个是确定歌曲的唯一标识。
可以看出传递的参数可以设定歌曲的音质，ids号。。。
到这里我们的分析就结束了下一节是我的代码阶段，明天在续写。
第一次写python爬虫实战，写的坎坎坷坷的，有种心有余而力不足的感觉，见谅！！！
先把代码发出来js代码
let window = {};
var CryptoJS = CryptoJS || function(u, p) {
var d = {}
, l = d.lib = {}
, s = function() {}
, t = l.Base = {
extend: function(a) {
s.prototype = this;
var c = new s;
a && c.mixIn(a);
c.hasOwnProperty("init") || (c.init = function() {
c.$super.init.apply(this, arguments)
}
);
c.init.prototype = c;
c.$super = this;
return c
},
create: function() {
var a = this.extend();
a.init.apply(a, arguments);
return a
},
init: function() {},
mixIn: function(a) {
for (var c in a)
a.hasOwnProperty(c) && (this[c] = a[c]);
a.hasOwnProperty("toString") && (this.toString = a.toString)
},
clone: function() {
return this.init.prototype.extend(this)
}
}
, r = l.WordArray = t.extend({
init: function(a, c) {
a = this.words = a || [];
this.sigBytes = c != p ? c : 4 * a.length
},
toString: function(a) {
return (a || v).stringify(this)
},
concat: function(a) {
var c = this.words
, e = a.words
, j = this.sigBytes;
a = a.sigBytes;
this.clamp();
if (j % 4)
for (var k = 0; k >> 2] |= (e[k >>> 2] >>> 24 - 8 * (k % 4) & 255) << 24 - 8 * ((j + k) % 4);
else if (65535 < e.length)
for (k = 0; k >> 2] = e[k >>> 2];
else
c.push.apply(c, e);
this.sigBytes += a;
return this
},
clamp: function() {
var a = this.words
, c = this.sigBytes;
a[c >>> 2] &= 4294967295 << 32 - 8 * (c % 4);
a.length = u.ceil(c / 4)
},
clone: function() {
var a = t.clone.call(this);
a.words = this.words.slice(0);
return a
},
random: function(a) {
for (var c = [], e = 0; e < a; e += 4)
c.push(4294967296 * u.random() | 0);
return new r.init(c,a)
}
})
, w = d.enc = {}
, v = w.Hex = {
stringify: function(a) {
var c = a.words;
a = a.sigBytes;
for (var e = [], j = 0; j >> 2] >>> 24 - 8 * (j % 4) & 255;
e.push((k >>> 4).toString(16));
e.push((k & 15).toString(16))
}
return e.join("")
},
parse: function(a) {
for (var c = a.length, e = [], j = 0; j >> 3] |= parseInt(a.substr(j, 2), 16) << 24 - 4 * (j % 8);
return new r.init(e,c / 2)
}
}
, b = w.Latin1 = {
stringify: function(a) {
var c = a.words;
a = a.sigBytes;
for (var e = [], j = 0; j >> 2] >>> 24 - 8 * (j % 4) & 255));
return e.join("")
},
parse: function(a) {
for (var c = a.length, e = [], j = 0; j >> 2] |= (a.charCodeAt(j) & 255) << 24 - 8 * (j % 4);
return new r.init(e,c)
}
}
, x = w.Utf8 = {
stringify: function(a) {
try {
return decodeURIComponent(escape(b.stringify(a)))
} catch (c) {
throw Error("Malformed UTF-8 data")
}
},
parse: function(a) {
return b.parse(unescape(encodeURIComponent(a)))
}
}
, q = l.BufferedBlockAlgorithm = t.extend({
reset: function() {
this.i4m = new r.init;
this.yL2x = 0
},
AE9v: function(a) {
"string" == typeof a && (a = x.parse(a));
this.i4m.concat(a);
this.yL2x += a.sigBytes
},
mD8v: function(a) {
var c = this.i4m
, e = c.words
, j = c.sigBytes
, k = this.blockSize
, b = j / (4 * k)
, b = a ? u.ceil(b) : u.max((b | 0) - this.Vr8j, 0);
a = b * k;
j = u.min(4 * a, j);
if (a) {
for (var q = 0; q < a; q += k)
this.tt1x(e, q);
q = e.splice(0, a);
c.sigBytes -= j
}
return new r.init(q,j)
},
clone: function() {
var a = t.clone.call(this);
a.i4m = this.i4m.clone();
return a
},
Vr8j: 0
});
l.Hasher = q.extend({
cfg: t.extend(),
init: function(a) {
this.cfg = this.cfg.extend(a);
this.reset()
},
reset: function() {
q.reset.call(this);
this.mj8b()
},
update: function(a) {
this.AE9v(a);
this.mD8v();
return this
},
finalize: function(a) {
a && this.AE9v(a);
return this.nZ9Q()
},
blockSize: 16,
mE8w: function(a) {
return function(b, e) {
return (new a.init(e)).finalize(b)
}
},
yK2x: function(a) {
return function(b, e) {
return (new n.HMAC.init(a,e)).finalize(b)
}
}
});
var n = d.algo = {};
return d
}(Math);
(function() {
var u = CryptoJS
, p = u.lib.WordArray;
u.enc.Base64 = {
stringify: function(d) {
var l = d.words
, p = d.sigBytes
, t = this.bD5I;
d.clamp();
d = [];
for (var r = 0; r >> 2] >>> 24 - 8 * (r % 4) & 255) <>> 2] >>> 24 - 8 * ((r + 1) % 4) & 255) <>> 2] >>> 24 - 8 * ((r + 2) % 4) & 255, v = 0; 4 > v && r + .75 * v
>> 6 * (3 - v) & 63)); if (l = t.charAt(64)) for (; d.length % 4; ) d.push(l); return d.join("") }, parse: function(d) { var l = d.length , s = this.bD5I , t = s.charAt(64); t && (t = d.indexOf(t), -1 != t && (l = t)); for (var t = [], r = 0, w = 0; w < l; w++) if (w % 4) { var v = s.indexOf(d.charAt(w - 1)) <>> 6 - 2 * (w % 4); t[r >>> 2] |= (v | b) << 24 - 8 * (r % 4); r++ } return p.create(t, r) }, bD5I: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=" }})();(function(u) { function p(b, n, a, c, e, j, k) { b = b + (n & a | ~n & c) + e + k; return (b <>> 32 - j) + n } function d(b, n, a, c, e, j, k) { b = b + (n & c | a & ~c) + e + k; return (b <>> 32 - j) + n } function l(b, n, a, c, e, j, k) { b = b + (n ^ a ^ c) + e + k; return (b <>> 32 - j) + n } function s(b, n, a, c, e, j, k) { b = b + (a ^ (n | ~c)) + e + k; return (b <>> 32 - j) + n } for (var t = CryptoJS, r = t.lib, w = r.WordArray, v = r.Hasher, r = t.algo, b = [], x = 0; 64 > x; x++) b[x] = 4294967296 * u.abs(u.sin(x + 1)) | 0; r = r.MD5 = v.extend({ mj8b: function() { this.cU5Z = new w.init([1732584193, 4023233417, 2562383102, 271733878]) }, tt1x: function(q, n) { for (var a = 0; 16 > a; a++) { var c = n + a , e = q[c]; q[c] = (e <>> 24) & 16711935 | (e <>> 8) & 4278255360 } var a = this.cU5Z.words , c = q[n + 0] , e = q[n + 1] , j = q[n + 2] , k = q[n + 3] , z = q[n + 4] , r = q[n + 5] , t = q[n + 6] , w = q[n + 7] , v = q[n + 8] , A = q[n + 9] , B = q[n + 10] , C = q[n + 11] , u = q[n + 12] , D = q[n + 13] , E = q[n + 14] , x = q[n + 15] , f = a[0] , m = a[1] , g = a[2] , h = a[3] , f = p(f, m, g, h, c, 7, b[0]) , h = p(h, f, m, g, e, 12, b[1]) , g = p(g, h, f, m, j, 17, b[2]) , m = p(m, g, h, f, k, 22, b[3]) , f = p(f, m, g, h, z, 7, b[4]) , h = p(h, f, m, g, r, 12, b[5]) , g = p(g, h, f, m, t, 17, b[6]) , m = p(m, g, h, f, w, 22, b[7]) , f = p(f, m, g, h, v, 7, b[8]) , h = p(h, f, m, g, A, 12, b[9]) , g = p(g, h, f, m, B, 17, b[10]) , m = p(m, g, h, f, C, 22, b[11]) , f = p(f, m, g, h, u, 7, b[12]) , h = p(h, f, m, g, D, 12, b[13]) , g = p(g, h, f, m, E, 17, b[14]) , m = p(m, g, h, f, x, 22, b[15]) , f = d(f, m, g, h, e, 5, b[16]) , h = d(h, f, m, g, t, 9, b[17]) , g = d(g, h, f, m, C, 14, b[18]) , m = d(m, g, h, f, c, 20, b[19]) , f = d(f, m, g, h, r, 5, b[20]) , h = d(h, f, m, g, B, 9, b[21]) , g = d(g, h, f, m, x, 14, b[22]) , m = d(m, g, h, f, z, 20, b[23]) , f = d(f, m, g, h, A, 5, b[24]) , h = d(h, f, m, g, E, 9, b[25]) , g = d(g, h, f, m, k, 14, b[26]) , m = d(m, g, h, f, v, 20, b[27]) , f = d(f, m, g, h, D, 5, b[28]) , h = d(h, f, m, g, j, 9, b[29]) , g = d(g, h, f, m, w, 14, b[30]) , m = d(m, g, h, f, u, 20, b[31]) , f = l(f, m, g, h, r, 4, b[32]) , h = l(h, f, m, g, v, 11, b[33]) , g = l(g, h, f, m, C, 16, b[34]) , m = l(m, g, h, f, E, 23, b[35]) , f = l(f, m, g, h, e, 4, b[36]) , h = l(h, f, m, g, z, 11, b[37]) , g = l(g, h, f, m, w, 16, b[38]) , m = l(m, g, h, f, B, 23, b[39]) , f = l(f, m, g, h, D, 4, b[40]) , h = l(h, f, m, g, c, 11, b[41]) , g = l(g, h, f, m, k, 16, b[42]) , m = l(m, g, h, f, t, 23, b[43]) , f = l(f, m, g, h, A, 4, b[44]) , h = l(h, f, m, g, u, 11, b[45]) , g = l(g, h, f, m, x, 16, b[46]) , m = l(m, g, h, f, j, 23, b[47]) , f = s(f, m, g, h, c, 6, b[48]) , h = s(h, f, m, g, w, 10, b[49]) , g = s(g, h, f, m, E, 15, b[50]) , m = s(m, g, h, f, r, 21, b[51]) , f = s(f, m, g, h, u, 6, b[52]) , h = s(h, f, m, g, k, 10, b[53]) , g = s(g, h, f, m, B, 15, b[54]) , m = s(m, g, h, f, e, 21, b[55]) , f = s(f, m, g, h, v, 6, b[56]) , h = s(h, f, m, g, x, 10, b[57]) , g = s(g, h, f, m, t, 15, b[58]) , m = s(m, g, h, f, D, 21, b[59]) , f = s(f, m, g, h, z, 6, b[60]) , h = s(h, f, m, g, C, 10, b[61]) , g = s(g, h, f, m, j, 15, b[62]) , m = s(m, g, h, f, A, 21, b[63]); a[0] = a[0] + f | 0; a[1] = a[1] + m | 0; a[2] = a[2] + g | 0; a[3] = a[3] + h | 0 }, nZ9Q: function() { var b = this.i4m , n = b.words , a = 8 * this.yL2x , c = 8 * b.sigBytes; n[c >>> 5] |= 128 <>> 9 << 4) + 15] = (e <>> 24) & 16711935 | (e <>> 8) & 4278255360; n[(c + 64 >>> 9 << 4) + 14] = (a <>> 24) & 16711935 | (a <>> 8) & 4278255360; b.sigBytes = 4 * (n.length + 1); this.mD8v(); b = this.cU5Z; n = b.words; for (a = 0; 4 > a; a++) c = n[a], n[a] = (c <>> 24) & 16711935 | (c <>> 8) & 4278255360; return b }, clone: function() { var b = v.clone.call(this); b.cU5Z = this.cU5Z.clone(); return b } }); t.MD5 = v.mE8w(r); t.HmacMD5 = v.yK2x(r)})(Math);(function() { var u = CryptoJS , p = u.lib , d = p.Base , l = p.WordArray , p = u.algo , s = p.EvpKDF = d.extend({ cfg: d.extend({ keySize: 4, hasher: p.MD5, iterations: 1 }), init: function(d) { this.cfg = this.cfg.extend(d) }, compute: function(d, r) { for (var p = this.cfg, s = p.hasher.create(), b = l.create(), u = b.words, q = p.keySize, p = p.iterations; u.length < q; ) { n && s.update(n); var n = s.update(d).finalize(r); s.reset(); for (var a = 1; a < p; a++) n = s.finalize(n), s.reset(); b.concat(n) } b.sigBytes = 4 * q; return b } }); u.EvpKDF = function(d, l, p) { return s.create(p).compute(d, l) }})();CryptoJS.lib.Cipher || function(u) { var p = CryptoJS , d = p.lib , l = d.Base , s = d.WordArray , t = d.BufferedBlockAlgorithm , r = p.enc.Base64 , w = p.algo.EvpKDF , v = d.Cipher = t.extend({ cfg: l.extend(), createEncryptor: function(e, a) { return this.create(this.IX5c, e, a) }, createDecryptor: function(e, a) { return this.create(this.brC8u, e, a) }, init: function(e, a, b) { this.cfg = this.cfg.extend(b); this.Vv8n = e; this.J5O = a; this.reset() }, reset: function() { t.reset.call(this); this.mj8b() }, process: function(e) { this.AE9v(e); return this.mD8v() }, finalize: function(e) { e && this.AE9v(e); return this.nZ9Q() }, keySize: 4, ivSize: 4, IX5c: 1, brC8u: 2, mE8w: function(e) { return { encrypt: function(b, k, d) { return ("string" == typeof k ? c : a).encrypt(e, b, k, d) }, decrypt: function(b, k, d) { return ("string" == typeof k ? c : a).decrypt(e, b, k, d) } } } }); d.StreamCipher = v.extend({ nZ9Q: function() { return this.mD8v(!0) }, blockSize: 1 }); var b = p.mode = {} , x = function(e, a, b) { var c = this.tB1x; c ? this.tB1x = u : c = this.DB0x; for (var d = 0; d < b; d++) e[a + d] ^= c[d] } , q = (d.BlockCipherMode = l.extend({ createEncryptor: function(e, a) { return this.Encryptor.create(e, a) }, createDecryptor: function(e, a) { return this.Decryptor.create(e, a) }, init: function(e, a) { this.ud1x = e; this.tB1x = a } })).extend(); q.Encryptor = q.extend({ processBlock: function(e, a) { var b = this.ud1x , c = b.blockSize; x.call(this, e, a, c); b.encryptBlock(e, a); this.DB0x = e.slice(a, a + c) } }); q.Decryptor = q.extend({ processBlock: function(e, a) { var b = this.ud1x , c = b.blockSize , d = e.slice(a, a + c); b.decryptBlock(e, a); x.call(this, e, a, c); this.DB0x = d } }); b = b.CBC = q; q = (p.pad = {}).Pkcs7 = { pad: function(a, b) { for (var c = 4 * b, c = c - a.sigBytes % c, d = c << 24 | c << 16 | c << 8 | c, l = [], n = 0; n >> 2] & 255 } }; d.BlockCipher = v.extend({ cfg: v.cfg.extend({ mode: b, padding: q }), reset: function() { v.reset.call(this); var a = this.cfg , b = a.iv , a = a.mode; if (this.Vv8n == this.IX5c) var c = a.createEncryptor; else c = a.createDecryptor, this.Vr8j = 1; this.eU6O = c.call(a, this, b && b.words) }, tt1x: function(a, b) { this.eU6O.processBlock(a, b) }, nZ9Q: function() { var a = this.cfg.padding; if (this.Vv8n == this.IX5c) { a.pad(this.i4m, this.blockSize); var b = this.mD8v(!0) } else b = this.mD8v(!0), a.unpad(b); return b }, blockSize: 4 }); var n = d.CipherParams = l.extend({ init: function(a) { this.mixIn(a) }, toString: function(a) { return (a || this.formatter).stringify(this) } }) , b = (p.format = {}).OpenSSL = { stringify: function(a) { var b = a.ciphertext; a = a.salt; return (a ? s.create([1398893684, 1701076831]).concat(a).concat(b) : b).toString(r) }, parse: function(a) { a = r.parse(a); var b = a.words; if (1398893684 == b[0] && 1701076831 == b[1]) { var c = s.create(b.slice(2, 4)); b.splice(0, 4); a.sigBytes -= 16 } return n.create({ ciphertext: a, salt: c }) } } , a = d.SerializableCipher = l.extend({ cfg: l.extend({ format: b }), encrypt: function(a, b, c, d) { d = this.cfg.extend(d); var l = a.createEncryptor(c, d); b = l.finalize(b); l = l.cfg; return n.create({ ciphertext: b, key: c, iv: l.iv, algorithm: a, mode: l.mode, padding: l.padding, blockSize: a.blockSize, formatter: d.format }) }, decrypt: function(a, b, c, d) { d = this.cfg.extend(d); b = this.Hf1x(b, d.format); return a.createDecryptor(c, d).finalize(b.ciphertext) }, Hf1x: function(a, b) { return "string" == typeof a ? b.parse(a, this) : a } }) , p = (p.kdf = {}).OpenSSL = { execute: function(a, b, c, d) { d || (d = s.random(8)); a = w.create({ keySize: b + c }).compute(a, d); c = s.create(a.words.slice(b), 4 * c); a.sigBytes = 4 * b; return n.create({ key: a, iv: c, salt: d }) } } , c = d.PasswordBasedCipher = a.extend({ cfg: a.cfg.extend({ kdf: p }), encrypt: function(b, c, d, l) { l = this.cfg.extend(l); d = l.kdf.execute(d, b.keySize, b.ivSize); l.iv = d.iv; b = a.encrypt.call(this, b, c, d.key, l); b.mixIn(d); return b }, decrypt: function(b, c, d, l) { l = this.cfg.extend(l); c = this.Hf1x(c, l.format); d = l.kdf.execute(d, b.keySize, b.ivSize, c.salt); l.iv = d.iv; return a.decrypt.call(this, b, c, d.key, l) } })}();(function() { for (var u = CryptoJS, p = u.lib.BlockCipher, d = u.algo, l = [], s = [], t = [], r = [], w = [], v = [], b = [], x = [], q = [], n = [], a = [], c = 0; 256 > c; c++) a[c] = 128 > c ? c << 1 : c < c; c++) { var k = j ^ j << 1 ^ j << 2 ^ j << 3 ^ j <>> 8 ^ k & 255 ^ 99; l[e] = k; s[k] = e; var z = a[e] , F = a[z] , G = a[F] , y = 257 * a[k] ^ 16843008 * k; t[e] = y <>> 8; r[e] = y <>> 16; w[e] = y <>> 24; v[e] = y; y = 16843009 * G ^ 65537 * F ^ 257 * z ^ 16843008 * e; b[k] = y <>> 8; x[k] = y <>> 16; q[k] = y <>> 24; n[k] = y; e ? (e = z ^ a[a[a[G ^ z]]], j ^= a[a[j]]) : e = j = 1 } var H = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54] , d = d.AES = p.extend({ mj8b: function() { for (var a = this.J5O, c = a.words, d = a.sigBytes / 4, a = 4 * ((this.bbn9e = d + 6) + 1), e = this.bsg8Y = [], j = 0; j < a; j++) if (j < d) e[j] = c[j]; else { var k = e[j - 1]; j % d ? 6 >> 24] <>> 16 & 255] <>> 8 & 255] << 8 | l[k & 255]) : (k = k <>> 24, k = l[k >>> 24] <>> 16 & 255] <>> 8 & 255] << 8 | l[k & 255], k ^= H[j / d | 0] << 24); e[j] = e[j - d] ^ k } c = this.bsh8Z = []; for (d = 0; d d || 4 >= j ? k : b[l[k >>> 24]] ^ x[l[k >>> 16 & 255]] ^ q[l[k >>> 8 & 255]] ^ n[l[k & 255]] }, encryptBlock: function(a, b) { this.DE0x(a, b, this.bsg8Y, t, r, w, v, l) }, decryptBlock: function(a, c) { var d = a[c + 1]; a[c + 1] = a[c + 3]; a[c + 3] = d; this.DE0x(a, c, this.bsh8Z, b, x, q, n, s); d = a[c + 1]; a[c + 1] = a[c + 3]; a[c + 3] = d }, DE0x: function(a, b, c, d, e, j, l, f) { for (var m = this.bbn9e, g = a[b] ^ c[0], h = a[b + 1] ^ c[1], k = a[b + 2] ^ c[2], n = a[b + 3] ^ c[3], p = 4, r = 1; r >> 24] ^ e[h >>> 16 & 255] ^ j[k >>> 8 & 255] ^ l[n & 255] ^ c[p++] , s = d[h >>> 24] ^ e[k >>> 16 & 255] ^ j[n >>> 8 & 255] ^ l[g & 255] ^ c[p++] , t = d[k >>> 24] ^ e[n >>> 16 & 255] ^ j[g >>> 8 & 255] ^ l[h & 255] ^ c[p++] , n = d[n >>> 24] ^ e[g >>> 16 & 255] ^ j[h >>> 8 & 255] ^ l[k & 255] ^ c[p++] , g = q , h = s , k = t; q = (f[g >>> 24] <>> 16 & 255] <>> 8 & 255] <>> 24] <>> 16 & 255] <>> 8 & 255] <>> 24] <>> 16 & 255] <>> 8 & 255] <>> 24] <>> 16 & 255] <>> 8 & 255] < a ? "0" : "") + String(a)}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 decryptedString(a, b) { var e, f, g, h, c = b.split(" "), d = ""; for (e = 0; e < c.length; ++e) for (h = 16 == a.radix ? biFromHex(c[e]) : biFromString(c[e], a.radix), g = a.barrett.powMod(h, a.d), f = 0; f > 8); return 0 == d.charCodeAt(d.length - 1) && (d = d.substring(0, d.length - 1)), d}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}function BigInt(a) { this.digits = "boolean" == typeof a && 1 == a ? null : ZERO_ARRAY.slice(0), this.isNeg = !1}function biFromDecimal(a) { for (var d, e, f, b = "-" == a.charAt(0), c = b ? 1 : 0; c < a.length && "0" == a.charAt(c); ) ++c; if (c == a.length) d = new BigInt; else { for (e = a.length - c, f = e % dpl10, 0 == f && (f = dpl10), d = biFromNumber(Number(a.substr(c, f))), c += f; c a, a = Math.abs(a), c = 0; a > 0; ) b.digits[c++] = a & maxDigitVal, a >>= biRadixBits; return b}function reverseStr(a) { var c, b = ""; for (c = a.length - 1; c > -1; --c) b += a.charAt(c); return b}function biToString(a, b) { var d, e, c = new BigInt; for (c.digits[0] = b, d = biDivideModulo(a, c), e = hexatrigesimalToChar[d[1].digits[0]]; 1 == biCompare(d[0], bigZero); ) d = biDivideModulo(d[0], c), digit = d[1].digits[0], e += hexatrigesimalToChar[d[1].digits[0]]; return (a.isNeg ? "-" : "") + reverseStr(e)}function biToDecimal(a) { var c, d, b = new BigInt; for (b.digits[0] = 10, c = biDivideModulo(a, b), d = String(c[1].digits[0]); 1 == biCompare(c[0], bigZero); ) c = biDivideModulo(c[0], b), d += String(c[1].digits[0]); return (a.isNeg ? "-" : "") + reverseStr(d)}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 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 < 0; d -= 4, ++e) b.digits[e] = hexToDigit(a.substr(Math.max(d - 4, 0), Math.min(d, 4))); return b}function biFromString(a, b) { var g, h, i, j, c = "-" == a.charAt(0), d = c ? 1 : 0, e = new BigInt, f = new BigInt; for (f.digits[0] = 1, g = a.length - 1; g >= d; g--) h = a.charCodeAt(g), i = charToHex(h), j = biMultiplyDigit(f, i), e = biAdd(e, j), f = biMultiplyDigit(f, b); return e.isNeg = c, e}function biDump(a) { return (a.isNeg ? "-" : "") + a.digits.join(" ")}function biAdd(a, b) { var c, d, e, f; if (a.isNeg != b.isNeg) b.isNeg = !b.isNeg, c = biSubtract(a, b), b.isNeg = !b.isNeg; else { for (c = new BigInt, d = 0, f = 0; f = biRadix); c.isNeg = a.isNeg } return c}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] 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] d); c.isNeg = !a.isNeg } else c.isNeg = a.isNeg } return c}function biHighIndex(a) { for (var b = a.digits.length - 1; b > 0 && 0 == a.digits[b]; ) --b; 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 <= 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 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 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] <>> f; return d.digits[0] = d.digits[g] << e & maxDigitVal, d.isNeg = a.isNeg, d}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 >> e | (d.digits[h] & lowBitMasks[e]) <>>= e, d.isNeg = a.isNeg, d}function biMultiplyByRadixPower(a, b) { var c = new BigInt; return arrayCopy(a.digits, 0, c.digits, b, c.digits.length - b), c}function biDivideByRadixPower(a, b) { var c = new BigInt; return arrayCopy(a.digits, b, c.digits, 0, c.digits.length - b), c}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] 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] 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 biDivide(a, b) { return biDivideModulo(a, b)[0]}function biModulo(a, b) { return biDivideModulo(a, b)[1]}function biMultiplyMod(a, b, c) { return biModulo(biMultiply(a, b), c)}function biPow(a, b) { for (var c = bigOne, d = a; ; ) { if (0 != (1 & b) && (c = biMultiply(c, d)), b >>= 1, 0 == b) break; d = biMultiply(d, d) } return c}function biPowMod(a, b, c) { for (var d = bigOne, e = a, f = b; ; ) { if (0 != (1 & f.digits[0]) && (d = biMultiplyMod(d, e, c)), f = biShiftRight(f, 1), 0 == f.digits[0] && 0 == biHighIndex(f)) break; e = biMultiplyMod(e, e, c) } return d}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 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 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}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() { 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 d(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 } window.asrsea = d, window.ecnonasr = e}();function encryptoMusicData(id) { let requestBody = `{"ids": "[${id}]", "level": "standard", "encodeType": "aac", "csrf_token": ""}`; let result = window.asrsea( requestBody, '010001', '00e0b509f6259df8642dbc35662901477df22677ec152b5ff68ace615bb7b725152b3ab17a876aea8a5aa76d2e417629ec4ee341f56135fccf695280104e0312ecbda92557c93870114af6c9d05c4f7f0c3685b7a46bee255932575cce10b424d813cfe4875d3e82047b97ddef52741d546b8e289dc6935b3ece0462db0a22b8e7', '0CoJUm6Qyw8W8jud' ); return { params: result.encText, encSecKey: result.encSecKey }}function Music_playlist_comment(rid) { let requestBody1 = `{"rid":"A_PL_0_${rid}","threadId":"A_PL_0_${rid}","pageNo":"1","pageSize":"20","cursor":"-1","offset":"0","orderType":"1","csrf_token":""}`; let result = window.asrsea( requestBody1, '010001', '00e0b509f6259df8642dbc35662901477df22677ec152b5ff68ace615bb7b725152b3ab17a876aea8a5aa76d2e417629ec4ee341f56135fccf695280104e0312ecbda92557c93870114af6c9d05c4f7f0c3685b7a46bee255932575cce10b424d813cfe4875d3e82047b97ddef52741d546b8e289dc6935b3ece0462db0a22b8e7', '0CoJUm6Qyw8W8jud' ); return { params: result.encText, encSecKey: result.encSecKey }}function Music_single_comment(rid) { let requestBody1 = `{"rid":"R_SO_4_${rid}","threadId":"R_SO_4_${rid}","pageNo":"1","pageSize":"1000","cursor":"-1","offset":"0","orderType":"1","csrf_token":""}`; let result = window.asrsea( requestBody1, '010001', '00e0b509f6259df8642dbc35662901477df22677ec152b5ff68ace615bb7b725152b3ab17a876aea8a5aa76d2e417629ec4ee341f56135fccf695280104e0312ecbda92557c93870114af6c9d05c4f7f0c3685b7a46bee255932575cce10b424d813cfe4875d3e82047b97ddef52741d546b8e289dc6935b3ece0462db0a22b8e7', '0CoJUm6Qyw8W8jud' ); return { params: result.encText, encSecKey: result.encSecKey }}
python代码
import sys
import execjs
import requests
import json
import csv
from snownlp import SnowNLP
def get_music():
code=""
with open("encrypet.js", "r",encoding='utf-8') as f:
code = f.read()
run =execjs.compile(code)
ID = input("输入歌曲的id：")
result = run.call(
"encryptoMusicData",
ID
)
url = 'https://music.163.com/weapi/song/enhance/player/url/v1?csrf_token='
header = {
'User-Agent': 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/114.0.0.0 Safari/537.36 Edg/114.0.1823.67'
}
post_data = {
'params': result.get('params'),
'encSecKey': result.get('encSecKey')
}
res = requests.post(url=url, headers=header, data=post_data)
rulest = res.json()
print(rulest['data'][0]['url'])
print("是否要下载音乐到本地。如果下载请输入y，不下载输入其它字符")
word = input('输入字符')
if word == 'y' or word == 'Y' :
response = requests.get(url=rulest['data'][0]['url'])
name = input("输入音频姓名")
with open(f'./{name}.mp3', 'wb') as f:
f.write(response.content)
else:
print('欢迎使用')
# print(res.text)
def get_playlist_commt():#歌单评论
code = ""
with open("encrypet.js", "r", encoding='utf-8') as f:
code = f.read()
run = execjs.compile(code)
ID = input("输入歌单的id：")
result = run.call(
"Music_comment",
ID
)
# print(result)
url = 'https://music.163.com/weapi/comment/resource/comments/get?csrf_token='
header = {
'User-Agent': 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/114.0.0.0 Safari/537.36 Edg/114.0.1823.67'
}
post_data = {
'params': result.get('params'),
'encSecKey': result.get('encSecKey')
}
res = requests.post(url=url, headers=header, data=post_data)
rulest = res.json()
# print(rulest['data']['comments'][0]['content'])
for i in rulest['data']['comments']:
print(i['content'])
# print(res.text)
return 0
def get_singal_commt():#歌单评论
code = ""
with open("encrypet.js", "r", encoding='utf-8') as f:
code = f.read()
run = execjs.compile(code)
ID = input("输入歌曲的id：")
result = run.call(
"Music_single_comment",
ID
)
# print(result)
url = 'https://music.163.com/weapi/comment/resource/comments/get?csrf_token='
header = {
'User-Agent': 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/114.0.0.0 Safari/537.36 Edg/114.0.1823.67'
}
post_data = {
'params': result.get('params'),
'encSecKey': result.get('encSecKey')
}
res = requests.post(url=url, headers=header, data=post_data)
rulest = res.json()
# print(rulest['data']['comments'][0]['content'])
index = 0
for i in rulest['data']['comments']:
index += 1
print(index,i['content'])
# print(res.text)
return 0
def write_csv():
code = ""
with open("encrypet.js", "r", encoding='utf-8') as f:
code = f.read()
run = execjs.compile(code)
ID = input("输入歌曲的id：")
result = run.call(
"Music_single_comment",
ID
)
# print(result)
url = 'https://music.163.com/weapi/comment/resource/comments/get?csrf_token='
header = {
'User-Agent': 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/114.0.0.0 Safari/537.36 Edg/114.0.1823.67'
}
post_data = {
'params': result.get('params'),
'encSecKey': result.get('encSecKey')
}
res = requests.post(url=url, headers=header, data=post_data)
rulest = res.json()
with open('single_comment.csv', 'w', encoding='utf-8', newline='') as w:
csv_writer = csv.writer(w)
for i in rulest['data']['comments']:
index += 1
content = i['content'].replace('\n', '').strip()
sen = SnowNLP(i['content'])
data = [str(index), content, sen.sentiments] # 将元组改为列表
csv_writer.writerow(data)
print('完成')
return 0
def main():
write_csv()
return
if __name__ == '__main__':
sys.exit(main())
本文来自网络，不代表协通编程立场，如若转载，请注明出处：https://net2asp.com/fbb5a1425d.html
相关推荐
-
数据库课设—学生宿舍管理系统(sql server+C#)
1.引言 1.1 内容及要求 设计内容：设计学生宿舍管理系统。 设计要求： （1）数据库应用系统开发的需求分析，写出比较完善系统功能。 （2）数据库概念模型设计、逻辑模型设计以及物…
-
【Python】cv2.error: OpenCV(4.8.0) :-1: error: (-5:Bad argument) in function ‘cvtColor‘ ＞ Overload res
代码片段为： # 将图片转换为灰度图 image1 = cv2.cvtColor(origin_iamge, cv2.COLOR_BGR2GRAY) image2 = cv2.cv…
-
Python玫瑰花
目录 系列文章 前言 Turtle画图 普通玫瑰花 立体玫瑰花 四季玫瑰花 尾声 系列文章 序号 文章目录 直达链接 表白系列 1 无法拒绝的表白界面 https://want59…
-
Java Heap Space问题解析与解决方案（InsCode AI 创作助手）
Heap Space问题是Java开发中常见的内存溢出问题之一，我们需要理解其原因和表现形式，然后通过优化代码、增加JVM内存和使用垃圾回收机制等方法来解决。 一、常见报错 jav…
-
python 数据、曲线平滑处理——基于Numpy.convolve实现滑动平均滤波——详解
文章目录 1 基于Numpy.convolve实现滑动平均滤波 1.1 滑动平均概念 1.2 滑动平均的数学原理 1.3 语法 1.4 滑动平均滤波示例 2 曲线平滑处理——Sav…
-
全面理解java中的构造方法以及this关键字的用法（超详细）
Hello，各位铁汁们！我是小🐟儿哈！今天我又来更新我的Java基础学习博客了。 本篇主要内容概述： 1、🍚如何用构造方法初始化对象 2、…
-
已解决requests.exceptions.JSONDecodeError: Expecting value: line 1 column 1 (char 0)
已解决requests.exceptions.JSONDecodeError: Expecting value: line 1 column 1 (char 0) 文章目录 报错问…
-
阿里开发手册规范(JAVA)
目录 一、编程规约 (一) 命名规范 (二) 常量定义 (三) 代码格式 (四) OOP规约 (五) 日期时间 (六) 集合处理 (七) 并发处理 (八) 控制语句 (九) …
-
如何使用Java支付宝沙箱环境并公网调用sdk创建支付单服
Java支付宝沙箱环境支付，SDK接口远程调试【内网穿透】 1.测试环境 Maven Spring boot Jdk 1.8 2.本地配置 获取支付宝支付Java SDK,mave…
-
基于Java外卖点餐系统设计实现(源码+lw+部署文档+讲解等)
博主介绍：✌全网粉丝30W+,csdn特邀作者、博客专家、CSDN新星计划导师、Java领域优质创作者,博客之星、掘金/华为云/阿里云/InfoQ等平台优质作者、专注于Java技术…
