Millenoctis

py checkin ```python if not len(nums1): return nums2[len(nums2) // 2] if len(nums2) % 2 else (nums2[len(nums2) // 2 - 1] + nums2[len(nums2) // 2]) / 2 if not len(nums2): return...

按s自动跳转搜索框这是什么神秘设定，都打不了单词了

> > 按s自动跳转搜索框这是什么神秘设定，都打不了单词了 > > @CHIYOI 我刚刚试了一下，不会自动跳转搜索框呀。你是怎么操作的呢？就只按键盘上的字母键 s ？ 英文输入，就只按s，我是macOS11.5，safari

打卡 ```python string = input("input: ") length = 1 if len(string) else 0 index, characterSet = 0, set() for index1, character in enumerate(string): while character in characterSet: characterSet.remove(string[index]) index +=...

python打卡 ```python s = input("Input: s = ") class na: def neko(): stack = [] for character in list(s): opposite = {')': '(', '}': '{', ']': '['} if character in...

> @halfrost > > @yngwiewang > > 请问这道题的时间复杂度为什么是log(N)而不是O(N)? > > 是 O(N) 呀，在哪里看到的 log(N)？ 第二章 2.05 页面上是这么写的。话说小于O(n)的算法真的存在吗？都不用检查完所有输入的？

python check-in ```python if not len(digits): return [] mapping = { '2': 'abc', '3': 'def', '4': 'ghi', '5': 'jkl', '6': 'mno', '7': 'pqrs', '8': 'tuv', '9': 'wxyz' } strings =...

python，求问这是O(n)吗: ```python nums = [int(x) for x in input("Given nums = ").split()] target = int(input("target = ")) dic = {} for idx, num in enumerate(nums): dic[num] = (idx, num) for...

python打卡 ```python class ListNode: def __init__(nacho, val = 0, next = None): nacho.val = val nacho.next = next l1List = [ListNode(int(_)) for _ in input("Input: l1 = ").split()] l2List =...

> Are you behind a proxy of any kind? Proxies often cause issues with sign-in. See the [Unable to Sign In While Using a Proxy section of our wiki](https://github.com/microsoft/vscode-azure-account/wiki/Troubleshooting#unable-to-sign-in-while-using-a-proxy) for...