还缺人吗？

attachment

1m 约等于 10^30 => log(2, 1m) 约等于 30 。文件在磁盘里排序对齐，一直打开文件不要关闭，相当于每秒位移 数千*30 次。如果没有写入文件，用 tree 不能减少搜索的复杂度，反而会增加常量时间

builder 模式，静态工厂，java 的 socket 里还有个 serOption，不知道叫啥模式

@linvaux 游戏不要用中文名，否则被收录到和谐字典里的时候会后悔的

单应用可以用这个

https://stackoverflow.com/questions/5639870/simple-java-name-based-locks

All those answers I see are way too complicated. Why not simply use:

public void executeInNamedLock(String lockName, Runnable runnable) {
synchronized(lockName.intern()) {
runnable.run();
}
}
The key point is the method intern: it ensures that the String returned is a global unique object, and so it can be used as a vm-instance-wide mutex. All interned Strings are held in a global pool, so that's your static cache you were talking about in your original question. Don't worry about memleaks; those strings will be gc'ed if no other thread references it. Note however, that up to and including Java6 this pool is kept in PermGen space instead of the heap, so you might have to increase it.

There's a problem though if some other code in your vm locks on the same string for completely different reasons, but a) this is very unlikely, and b) you can get around it by introducing namespaces, e.g. executeInNamedLock(this.getClass().getName() + "_" + myLockName);

完成（弱化版）希尔伯特计划

可以加一个《魔方和数学建模》

“狙公赋芧曰：‘朝三而莫四。’众狙皆怒。”曰：'然则朝四而暮三。'众狙皆悦。

https://zh.m.wikipedia.org/zh-hans/国家机器 五险一金是国家机器的一环，不爽不要玩

王垠就这点水平吗？爱了爱了

定义一个 function 接口，继承 serializable 。比如 Serializable fun =(Serializable & Function<>) Dome::createTime 。反射 fun 的 writeReplace 方法，SerializableLambda metadata = (SerializableLambda) fun.writeReplace()//使用反射因为这是个 private 方法
SerializableLambda 中可以获得 Dome 和 creatTime

fft dft dct

ps 上面这个算法是针对主楼的，不是 leetcode 的

不需要栈
for(int i=0;i< (i<<n);i++){
如果 i 的第 m 位是 0 就是左括号，否则就是右括号
}

这是个很大的问题，计算机图形学的核心问题之一