摘要：The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n = 0. Given n, return the value of Tn. 我写的c 阅读全文

摘要：蹉跎岁月 岁月里蹉跎。今天补交一个题。 这个题在leetcode里是easy的难度，我确没有写完，真不愿意来承认啊。 题目如下： Given a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d]  阅读全文

该文被密码保护。

摘要：https://leetcode.com/contest/weekly-contest-143/problems/path-in-zigzag-labelled-binary-tree/ https://leetcode.com/contest/weekly-contest-143/problems 阅读全文