狗年第一天我在 LC 上用 Go 刷了编号为 168 的题。

[banxi1988]

https://leetcodechina.com/submissions/detail/4096/

[azh7138m]

前段时间不是有个 php 的过来吐槽 Perl 加法吗，了解一下

[alcarl]

@azh7138m perl 加法肿么了⊙∀⊙！

[azh7138m]

@alcarl 就是这题。。。。

[stzz]

打开要登陆，登陆完 404

[hotea]

https://leetcode.com/problems/excel-sheet-column-title/description/

[Cbdy]

10 进制转 26 进制？
以前写过一个 10 进制转 62 进制的小方法用来压缩字符串。。。

[banxi1988]

@Cbdy 基本思路是这样子的。 但是有额外的问题需要处理。
主要是这个列名中是没有 0 值的。

[0person]

502

[naiba]

你这个叫 LCC 吧

[cheesea]

账户不互通，没有讨论。
综上 lcc 打入死牢

[banxi1988]

@0person 已经恢复了。
@cheesea 这个我又注册了一次。主要是觉得国内版网络应该快一些，可能以后人气也会旺一些。

又刷了两个吉祥序号题。66 和 88

[hazhaz]

@cheesea 刚开放测试啊，讨论应该是会有的吧，总之不用翻墙了。新年想刷个 666，结果有 665，有 667，结果就是没有 666

[ToT]

@hazhaz

LeetCode 666 Path Sum IV

If the depth of a tree is smaller than 5, then this tree can be represented by a list of three-digits integers.

For each integer in this list:
The hundreds digit represents the depth D of this node, 1 <= D <= 4.
The tens digit represents the position P of this node in the level it belongs to, 1 <= P <= 8. The position is the same as that in a full binary tree.
The units digit represents the value V of this node, 0 <= V <= 9.
Given a list of ascending three-digits integers representing a binary with the depth smaller than 5. You need to return the sum of all paths from the root towards the leaves.

Example 1:
Input: [113, 215, 221]
Output: 12
Explanation:
The tree that the list represents is:
3
/ \
5 1

The path sum is (3 + 5) + (3 + 1) = 12.
Example 2:
Input: [113, 221]
Output: 4
Explanation:
The tree that the list represents is:
3
\
1

The path sum is (3 + 1) = 4.

[hazhaz]

@ToT lccn 没有啊，老板富啊，美金玩家啊