LeetCode-3Sum
Given an integer array nums, return all the triplets numsi, numsj, numsk such that i != j, i != k, and j != k, and numsi + numsj + numsk == 0
Ai
LeetCode-Two Sum
Given an array of integers nums and an integer target, return _indices of the two numbers such that they add up to target
Effective Go-5
Do not communication by sharing memory; instead,share memory by communicating
LeetCode-Palindrome Pairs Solution
Given a list of unique words, return all the pairs of the _distinct_ indices (i, j) in the given list, so that the concatenation of the two words words[i] +…
查询和清除文件系统缓存
为了减少磁盘I/O，加快读写速度，Linux内核使用文件系统的Cache，Page Cache。
Effective Go - 1
为了减少格式化问题带来的争议，可以使用 gofmt 程序对源码进行格式化。
LeetCode-Word Search II Solution
LeetCode-Word Search II Solution - Given an m x n board of characters and a list of strings words, return _all words on the board
mount操作导致磁盘数据丢失
cenos7X86_64 + openssh
LeetCode-Maximum XOR of Two Numbers in an Array
Given an integer array nums, return _the maximum result of nums[i] XOR nums[j]_, where 0 ≤ i ≤ j < n. Follow up: Could you do this in O(n) runtime? Example 1…
比特币，区块链与自由软件
这篇文章 Open source money: Bitcoin, blockchain, and free software