闲文
又是一年IO大会。自从乔布斯带火了科技产品发布会，越来越多非技术相关的小伙伴开始关注WWDC，Build，还有IO这类的科技产品发布会了。 昨天科技圈的老大哥发布了微软终端，24小时内github点星超过6000，俨然有官方逼死同人的节奏（默哀putty 两秒）。今天就迎来了IO19，发布了一系列看起来还不错的产品。 Android 10 Android 秉承着每年一更新版本，成功的拖死了CyanogenMod等第三方Rom。今年也不出意外的更新了Android。带来了…… 夜间模式（再也不怕晚上玩手机伤眼睛了，现在只伤肝）。 对折叠屏优化（三桑的Fold卡顿的话是他们自己优化不好，不怪Android）（对，只是软件优化，Fold屏幕的问题跟Google 没关系） 支持5G（反正今年你也用不上） 专注模式（妈妈再也不用担心打游戏的时候有人找我聊天了，女生也不行） 实时字幕（下回和歪果仁聊天不用往下看了，看手机就行。真的有字幕。） 充电15分钟，通话7小时 Pixel 3a 小米9 的价钱，pixel 3 的体验。plus 3a 和3aL
闲文
某日想在办公室找碎纸机碎一张写错了的支票。打开内网搜索：Shred，出来的全是 Service Shred、Data Shred、Database Shred。想了下改成了Shredder 才找到碎纸机。 #TypicalGoogleSearch
周记
美国的韭菜也是韭菜 这几天一件大事就是川普在北京时间5.6号又双叒叕宣布要加进口税了。此言一出A股立刻狂泄了6个点。12小时后美股开市，SP500 盘前跌了1.24，nasdaq盘前跌了2.24。 真是不怕美联储加息，就怕川普发推。 由于我大部分的股票都是科技股，在此次发推事件中受创超过4 个点（我还买了3x nasdaq，之前涨的美滋滋，现在跌的都想卸软件了）。辛辛苦苦一个月，一推回到解放前。 前几天和前同事约了个饭。他给我讲了很多币圈割韭菜的手法。我当时还嘲笑说韭菜真好割，结果今天自己也被收割了一波。 世界文化大同嘛，韭菜在哪都是韭菜，区别是这茬割完了下茬被不被割的区别。
周记
之前一直有一个andysim.us的域名托管在digital ocean。后来建了个其他的实例来玩k8s虚拟化什么的，玩完了也忘了删。几个月过去就发现每次都收到之前双倍的账单（其实两倍多，毕竟k8s比wordpress 吃资源吃的多）。然后昨天心血来潮就上了下DO把其中一个实例给删了。 删了之后就收到了wordpress 的警报说我的网站下线了。当时就急出一身汗。后来发现没有做业务和数据分离（就一wp网站还搞业务分离？），也没开实时备份所以数据就找不回来了。广大同胞们请务必吸取我这个不爱加标签的教训。 既然找不回来了，那人生也只好向前看了。这个站我换了个托管网站，只做wp的。比DO便宜一些，而且还提供免费的备份功能。性能孱弱一些（想要性能可以去搞GCP）但是用来host wp是够用了。 之前有一些刷题记录是准备面试时用来练手的，现在也停了。以后这个站拿来写写周记，学习笔记什么的吧。 祝大家五一后的工作日快乐，笔芯❤️。
leetcode
Link: https://leetcode.com/problems/flip-equivalent-binary-trees/ Thought If 2 nodes are equivalent, either their left and right side match, or they are flipped match. So using a recursion(why recursion? It is a Tree!), and try to match each node pairs from root1 and root2. For each
leetcode
link: https://leetcode.com/problems/reveal-cards-in-increasing-order/ Thought So the rule is if you pop anything from front, then you shall move next head to tail. Reversely, if we want to build the original sequence, we could assume if you want to insert anything in head, you
leetcode
link: https://leetcode.com/problems/largest-time-for-given-digits/ Thought Its easy to think use DFS to solve it: it has limit data(4 digits), and DFS will enumerates all possible combinations Code class Solution: def largestTimeFromDigits(self, A): """ :type A: List[int] :rtype: str "
leetcode
Link: Most Stones Removed with Same Row or Column Thought When I saw the question, I realized its a Union Find question - For any union, I can keep only one stone form it. Then it convert to a count how many unique union finds exist question. So, only need to
leetcode
Link: validate stack sequences Thought Its pretty straight forward, just stimulate a stack and push/pop as the sequence shows. Code class Solution(object): def validateStackSequences(self, pushed, popped): """ :type pushed: List[int] :type popped: List[int] :rtype: bool """ stack = [] visited = set() N = len(
leetcode
Link: Bag of Tokens Thought For this question, I find we could do 2 things: spend any cost form the tokens, and get 1 point. Or, spend 1 point, get any power from the tokens. So it turns to be pretty clear that I will firstly sort all tokens by
leetcode
Link Minimum Increment to Make Array Unique Thought Firstly, I try to enumerate all existing number, and I got TLE :(. Then I realized I could sort the origin array and maintain a upper boundary, for any number, if it smaller than upper boundary, means I can only move it to
leetcode
link: Minimum Area Rectangle Thought I plan to use sweep line to solve. Firstly I put a dictionary with x-val as key, all y-val with coordinate x-val as value. Then, once I check x1, x2, if they has intersection, means there could be a rectangle. So I