摘要: Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n  阅读全文
posted @ 2016-11-30 17:21 Black_Knight 阅读(206) 评论(0) 推荐(0) 编辑
摘要: Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is po 阅读全文
posted @ 2016-11-30 14:13 Black_Knight 阅读(573) 评论(0) 推荐(0) 编辑