摘要：
For this task, I did not complete it during the contest. This is taged by easy! class Solution { public int movesToMakeZigzag(int[] nums) { int[] res 阅读全文
摘要：
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 阅读全文
摘要：
openssl rand -base64 12 // Generate random password in Linux CLI // Generate a random password quickly in CLI using openssl // Generate random passwor 阅读全文
摘要：
http://www.lintcode.com/en/problem/maximum-average-subarray/ Given an array with positive and negative numbers, find the maximum average subarray whic 阅读全文
摘要：
Given a target number, a non-negative integer k and an integer array A sorted in ascending order, find the k closest numbers to target in A, sorted in 阅读全文
摘要：
Given a mountain sequence of n integers which increase firstly and then decrease, find the mountain top. Example Given nums = [1, 2, 4, 8, 6, 3] retur 阅读全文