01 2018 档案

摘要:You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, )to get the value of 24. E 阅读全文
posted @ 2018-01-31 21:59 Grandyang 阅读(14286) 评论(12) 推荐(3) 编辑
摘要:In a given integer array nums, there is always exactly one largest element. Find whether the largest element in the array is at least twice as much as 阅读全文
posted @ 2018-01-30 22:06 Grandyang 阅读(3365) 评论(0) 推荐(0) 编辑
摘要:You are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map: 0 represents the obstacl 阅读全文
posted @ 2018-01-29 21:13 Grandyang 阅读(5302) 评论(1) 推荐(0) 编辑
摘要:Nearly everyone has used the Multiplication Table. The multiplication table of size m x n is an integer matrix mat where mat[i][j] == i * j (1-indexed 阅读全文
posted @ 2018-01-27 22:38 Grandyang 阅读(5009) 评论(7) 推荐(0) 编辑
摘要:On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y 阅读全文
posted @ 2018-01-24 22:27 Grandyang 阅读(10082) 评论(4) 推荐(1) 编辑
摘要:Given many words, words[i] has weight i. Design a class WordFilter that supports one function, WordFilter.f(String prefix, String suffix). It will ret 阅读全文
posted @ 2018-01-22 23:18 Grandyang 阅读(5324) 评论(1) 推荐(0) 编辑
摘要:There is a strange printer with the following two special requirements: The printer can only print a sequence of the same character each time. At each 阅读全文
posted @ 2018-01-20 09:44 Grandyang 阅读(5770) 评论(0) 推荐(0) 编辑
摘要:使用Ubuntu的虚拟机时如果不能主机之间进行复制粘粘,会非常非常的不方便,所以我们需要安装vmware tools,使用如下的代码(注意第二句一定要有,不然还是不能复制粘贴): 阅读全文
posted @ 2018-01-18 11:10 Grandyang 阅读(1320) 评论(0) 推荐(0) 编辑
摘要:在使用微信官方给的添加自定义菜单的示例代码: 可能会遇到如下的错误: 原因出在小程序的链接上,官方只是给了个例子教你如何添加小程序链接到菜单栏,但是这个小程序并不是归属于你的,所以错误提示说appid没有绑定,这里的appid是小程序的,当然没有和你的绑定,所以只要将这段整个删掉就好了: 阅读全文
posted @ 2018-01-15 02:05 Grandyang 阅读(4196) 评论(0) 推荐(0) 编辑
摘要:Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list t 阅读全文
posted @ 2018-01-14 23:58 Grandyang 阅读(4006) 评论(0) 推荐(0) 编辑
摘要:There are N network nodes, labelled 1 to N. Given times, a list of travel times as directededges times[i] = (u, v, w), where u is the source node, v i 阅读全文
posted @ 2018-01-12 23:52 Grandyang 阅读(11536) 评论(8) 推荐(0) 编辑
摘要:Start from integer 1, remove any integer that contains 9 such as 9, 19, 29... So now, you will have a new integer sequence: 1, 2, 3, 4, 5, 6, 7, 8, 10 阅读全文
posted @ 2018-01-10 23:13 Grandyang 阅读(3208) 评论(14) 推荐(0) 编辑
摘要:Given a binary tree where every node has a unique value, and a target key k, find the value of the nearest leaf node to target k in the tree. Here, ne 阅读全文
posted @ 2018-01-08 23:46 Grandyang 阅读(6185) 评论(3) 推荐(0) 编辑
摘要:In a N x N grid representing a field of cherries, each cell is one of three possible integers. 0 means the cell is empty, so you can pass through; 1 m 阅读全文
posted @ 2018-01-06 23:58 Grandyang 阅读(10461) 评论(1) 推荐(0) 编辑
摘要:在配置WebDriverAgent的时候,可能会遇到如下的错误: 2018-01-04 09:53:42.759370-0600 WebDriverAgentRunner-Runner[318:13300] +[CATransaction synchronize] called within tra 阅读全文
posted @ 2018-01-05 10:53 Grandyang 阅读(2370) 评论(0) 推荐(0) 编辑
摘要:Given an array A (index starts at 1) consisting of N integers: A1, A2, ..., AN and an integer B. The integer Bdenotes that from any place (suppose the 阅读全文
posted @ 2018-01-03 14:03 Grandyang 阅读(5483) 评论(1) 推荐(0) 编辑
摘要:Given an array nums of integers, you can perform operations on the array. In each operation, you pick any nums[i] and delete it to earn nums[i] points 阅读全文
posted @ 2018-01-02 14:00 Grandyang 阅读(6969) 评论(0) 推荐(0) 编辑

Fork me on GitHub