摘要: 题目描述 Given a list of unique words, find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words 阅读全文
posted @ 2019-07-18 19:51 你好哇傻小妞 阅读(184) 评论(1) 推荐(0) 编辑
摘要: 题目描述 You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] m 阅读全文
posted @ 2019-07-18 15:56 你好哇傻小妞 阅读(201) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Note: Your 阅读全文
posted @ 2019-07-18 11:23 你好哇傻小妞 阅读(138) 评论(0) 推荐(0) 编辑