上一页 1 ··· 7 8 9 10 11 12 13 14 15 16 下一页
摘要: 题目: 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 i 阅读全文
posted @ 2017-06-25 09:53 荒野第一快递员 阅读(588) 评论(0) 推荐(0) 编辑
摘要: 题目: A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. 阅读全文
posted @ 2017-06-23 09:20 荒野第一快递员 阅读(313) 评论(0) 推荐(0) 编辑
摘要: 2017年6月 缓存:缓存那些事:https://zhuanlan.zhihu.com/p/27457401 设计模式:Java设计模式(十篇):https://zhuanlan.zhihu.com/p/25781005 ing... OAuth(用户、客户端、第三方服务 授权框架):理解OAuth 阅读全文
posted @ 2017-06-22 14:11 荒野第一快递员 阅读(207) 评论(0) 推荐(0) 编辑
摘要: 2017年6月 Immutable.js: (1) 如何用React+Redux+ImmutableJS进行SPA开发:http://yunlaiwu.github.io/blog/2016/12/01/react+redux+immutablejs/ (2) Immutable 详解及 React 阅读全文
posted @ 2017-06-22 14:04 荒野第一快递员 阅读(162) 评论(0) 推荐(0) 编辑
摘要: 题目: There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it 阅读全文
posted @ 2017-06-22 10:18 荒野第一快递员 阅读(266) 评论(0) 推荐(0) 编辑
摘要: 题目: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may co 阅读全文
posted @ 2017-06-21 09:35 荒野第一快递员 阅读(155) 评论(0) 推荐(0) 编辑
摘要: 题目: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your m 阅读全文
posted @ 2017-06-20 11:25 荒野第一快递员 阅读(1668) 评论(0) 推荐(0) 编辑
摘要: 题目: Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 阅读全文
posted @ 2017-06-19 14:54 荒野第一快递员 阅读(221) 评论(0) 推荐(0) 编辑
摘要: 题目: One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null n 阅读全文
posted @ 2017-06-17 10:26 荒野第一快递员 阅读(349) 评论(0) 推荐(0) 编辑
摘要: 题目: Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element from in f 阅读全文
posted @ 2017-06-16 21:16 荒野第一快递员 阅读(442) 评论(0) 推荐(0) 编辑
上一页 1 ··· 7 8 9 10 11 12 13 14 15 16 下一页