基于 TeamCity 的 CI 集成过程记录 目前在 TeamCity 上完成的集成有： PR 接入 checks 单元测试的自动化执行 集成代码覆盖率报告 集成测试报告 过程思考 PR 接入 checks TeamCity 自带的插件就支持：https://www.jetbrains.com/help/teamcity/pull-requests.html 单元测试的自动化执行 iOS 开发下的单元测试... 2019-10-0310 min read
ARTS #17 Algorithm 本周选择的算法题是：Smallest Range I 规则如下： Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add x to A[i]. After this process, we have some a... 2019-09-285 min read
关于坑位曝的光检测方案 需求简述 用户曝光模板后触发，曝光需要满足以下条件： 1、在屏幕展示大于等于2/3被曝光对象； 2、在屏幕的停留时间大于等于1.5秒； 3、一个页面对于同一个内容仅曝光一次。仅当重新进入页面后会继续上报。 技术拆解 对“同一个页面”的定义 栈中的 UIViewController、Activity 是同一个实例 同一个页面内不需要重新曝光的动作： ... 2019-09-255 min read
ARTS #16 Algorithm 本周选择的算法题是：Longest Common Prefix 规则如下： Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". ... 2019-09-214 min read
ARTS #15 Algorithm 本周选择的算法题是：Palindrome Number 规则如下： Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Input: 121 Output: t... 2019-09-145 min read
ARTS #14 Algorithm 本周选择的算法题是：Max Points on a Line 规则如下： Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. Example 1: Input: [[1,1],[2,2],[3,3]] Output:... 2019-09-074 min read
ARTS #13 Algorithm 本周选择的算法题是：Range Sum Query - Immutable 规则如下： Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Given nums = [-2, 0, 3, -5,... 2019-08-313 min read
ARTS #12 Algorithm 本周选择的算法题是：Contains Duplicate III 规则如下： Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolutedifference between nums[i]... 2019-08-244 min read
ARTS #11 Algorithm 本周选择的算法题是：Global and Local Inversions 规则如下： We have some permutation A of [0, 1, ..., N - 1], where N is the length of A. The number of (global) inversions is the number of i < j w... 2019-08-174 min read
ARTS #10 Algorithm 本周选择的算法题是：Longest Palindromic Substring 规则如下： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "b... 2019-08-108 min read