ARTS #8 Algorithm 本周选择的算法题是：Construct String from Binary Tree 规则如下： You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null nod...
ARTS #7 Algorithm 本周选择的算法题是：Print Binary Tree 规则如下： Print a binary tree in an m*n 2D string array following these rules: The row number m should be equal to the height of the given binary tree. Th...
ARTS #6 Algorithm 本周选择的算法题是：Champagne Tower 规则如下： We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row. Each glass holds one cup (...
ARTS #5 Algorithm 本周选择的算法题是：Vowel Spellchecker 规则如下： Given a wordlist, we want to implement a spellchecker that converts a query word into a correct word. For a given query word, the spell checker hand...
ARTS #4 Algorithm 本周选择的算法题是：Sum Root to Leaf Numbers 规则如下： Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1-&g...
ARTS #3 Algorithm 本周选择的算法题是：Integer to English Words 规则如下： Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than \(2^{31}-1\). Example 1: Input:...
ARTS #2 Algorithm 本周选择的算法题是：ZigZag Conversion 规则如下： The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font ...
ARTS #1 Algorithm 本周选择的算法题是：Roman to Integer 规则如下： Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10...
如何设计一个 iOS 控件?(iOS 控件完全解析) > 代码的等级：可编译、可运行、可测试、可读、可维护、可复用 前言 一个控件从外在特征来说，主要是封装这几点： 交互方式 显示样式 数据使用 对外在特征的封装，能让我们在多种环境下达到 PM 对产品的要求，并且提到代码复用率，使维护工作保持在一个相对较小的范围内；而一个好的控件除了有对外一致的体验之外，还有其内在特征： ...
用 Houston 在本地调试远程通知 # Houston 的背景 Houston 在 GitHub 上的地址：https://github.com/nomad/Houston，作者又是Mattt Thompson，简直是惨无人道啊，又高产，又有质量 Houston 能让我们在本地、甚至终端很方便的调试远程通知。 安装 首先在终端安装： $ gem install houston 我第一次安装的时候报了错，但是第二...