L-Xu-L

Results 5 comments of L-Xu-L

[Feature] 多个账号有IP风控风险吗？

同问

examples：play from disk，panic：illegal base64 data at input byte 4092

module：Data Channels I got succed，Browser Gen SDP ：eyJ0eXBlIjoib2ZmZXIiLCJzZHAiOiJ2PTBcclxubz0tIDUzNjYxODE3MTA5MzY2NzgyODQgMiBJTiBJUDQgMTI3LjAuMC4xXHJcbnM9LVxyXG50PTAgMFxyXG5hPWdyb3VwOkJVTkRMRSAwXHJcbmE9ZXh0bWFwLWFsbG93LW1peGVkXHJcbmE9bXNpZC1zZW1hbnRpYzogV01TXHJcbm09YXBwbGljYXRpb24gMzgwOTQgVURQL0RUTFMvU0NUUCB3ZWJydGMtZGF0YWNoYW5uZWxcclxuYz1JTiBJUDQgMTE2LjMwLjEwMS4yNDJcclxuYT1jYW5kaWRhdGU6MjU4MjI5NDgyNSAxIHVkcCAyMTEzOTM3MTUxIDU0MzQ5YzNkLWM3M2UtNGM2Ni04Yjg3LTM4MDZhNjAxZjVkMi5sb2NhbCA1ODE3NSB0eXAgaG9zdCBnZW5lcmF0aW9uIDAgbmV0d29yay1jb3N0IDk5OVxyXG5hPWNhbmRpZGF0ZTozMTE5NDk0Nzc4IDEgdWRwIDE2Nzc3Mjk1MzUgMTE2LjMwLjEwMS4yNDIgMzgwOTQgdHlwIHNyZmx4IHJhZGRyIDAuMC4wLjAgcnBvcnQgMCBnZW5lcmF0aW9uIDAgbmV0d29yay1jb3N0IDk5OVxyXG5hPWljZS11ZnJhZzovMnRnXHJcbmE9aWNlLXB3ZDpnb0lrTWpKb2lVb0J1TGF1OWNpdGgyemdcclxuYT1pY2Utb3B0aW9uczp0cmlja2xlXHJcbmE9ZmluZ2VycHJpbnQ6c2hhLTI1NiBDNToyNzo2MDo2ODpCNDpGODo4RjpDODpFNjo5NTpFMDpDQjo1QTpFODo4RDo4MTo1NTowQjoxNzo2Qzo0Rjo3RToyMjowMDoyOTo0NDo2RTpDQjo4NzpFQzpBNjo2QVxyXG5hPXNldHVwOmFjdHBhc3NcclxuYT1taWQ6MFxyXG5hPXNjdHAtcG9ydDo1MDAwXHJcbmE9bWF4LW1lc3NhZ2Utc2l6ZToyNjIxNDRcclxuIn0= I don't konw why the SDP sometimes this，sometimes that

面试题7：重建二叉树

> 66-67行代码 > `if(rootInorder == endInorder && *rootInorder != rootValue)` > `throw std::exception("Invalid input.");` > 这句没有用吧！ 判断前序遍历找到的根的值 跟中序遍历里的根的值 是否相等吧

面试题14：剪绳子，题目存在问题

> 对的，还有动态规划的代码也有问题，lenght为3时输出是3还是2 lenght为3输出的是2 这里的lenght是指绳子的长度，由于题目要求至少得剪一刀，所以输出的是2 。 至于代码下面的products[3] = 3 是指 若绳子大于3 ，把该绳子剪成n段，若其中一段为3 ，则这段的最优解为3（不需要再剪一段）

问题解锁的步骤出现了问题！

应该是弹出了个错误页面了，This action could not be completed. Your request could not be completed because of an error. Try again later. 但目前没找到解决办法