引证

MIT +1. Unlike the GPL, MIT license is not viral, we can add to or otherwise modify fibjs, just keep its copyright notice.

这道题可能太简单了没人过来，我来捧个场，其实链表这个很容易想到做一次单循环相加即可，原理就是小学一年级的加法算式，余1进1，所以时间和空间复杂度都和l1和l2的长度相关，O(max(l1,l2)) 。 ```javascript var addTwoNumbers = function(l1, l2) { var carry = 0,ret = new ListNode(0),l3 = ret; while(l1!==null || l2!==null){ if(l1) {carry += l1.val;l1=l1.next;} if(l2) {carry += l2.val;l2=l2.next;} l3.next...

通哥厉害👍 不过有两个小细节没写到： 1. ToPrimitive其实先调用 valueOf()，如果没有原始值再调用toString()，如果依旧不是原始值会报错。 2. `[] == false`其实并不等价于`'' == false`，在spec里，ToPrimitive的优先度是在ToNumber之后的，所以其实是 `[] == false` ==> `[] == 0` ==> `'' == 0` ==> `0 == 0`

Can you trigger the ecosystem CI again? I feel a bit confused after looking at these error messages from the test suites, and I'm not even sure if they are...

With regards to Naive-UI and Nuxt, it seems likely that the issue is related to their own support for the current version of Vue 3.3.0-alpha.4 and not caused by my...