摘要：
算法 1 设半径为$R$。 $x = r \ast cos(\theta)$ $y = r \ast sin(\theta)$ 其中 $0\leqslant r \leqslant R$，$t$为0-1均匀分布产生的随机数，$r = sqrt(t) \ast R$，$\theta = 2\pi \a 阅读全文
摘要：
Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts". The length of each 阅读全文
摘要：
You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contai 阅读全文