leetcode
文章平均质量分 82
iywwuyifan
这个作者很懒,什么都没留下…
展开
-
838. Push Dominoes 推托米诺骨牌
There are N dominoes in a line, and we place each domino vertically upright.In the beginning, we simultaneously push some of the dominoes either to the left or to the right.After each second, each dom...原创 2018-05-22 10:18:09 · 739 阅读 · 0 评论 -
leetcode 日志 743
蛮蠢的... 把Dijkstra算法写成了minimum spanning tree,我佛了...debug了一小时...我佛了两个代码都贴下...上面那个是错的...class Solution {public: int networkDelayTime(vector<vector<int>>& times, int N, int K) { vector&...原创 2018-06-06 13:27:42 · 446 阅读 · 0 评论 -
833. Find And Replace in String
To some string S, we will perform some replacement operations that replace groups of letters with new ones (not necessarily the same size).Each replacement operation has 3 parameters: a starting index...原创 2018-06-01 08:25:26 · 420 阅读 · 0 评论 -
808. Soup Servings
There are two types of soup: type A and type B. Initially we have N ml of each type of soup. There are four kinds of operations:Serve 100 ml of soup A and 0 ml of soup BServe 75 ml of soup A and 25 ml...原创 2018-06-23 19:47:00 · 238 阅读 · 0 评论 -
842. Split Array into Fibonacci Sequence
Given a string S of digits, such as S = "123456579", we can split it into a Fibonacci-like sequence [123, 456, 579].Formally, a Fibonacci-like sequence is a list F of non-negative integers such that:0...原创 2018-06-11 03:20:27 · 244 阅读 · 0 评论 -
835. Image Overlap
Two images A and B are given, represented as binary, square matrices of the same size. (A binary matrix has only 0s and 1s as values.)We translate one image however we choose (sliding it left, right,...原创 2018-06-11 03:52:35 · 852 阅读 · 0 评论