codefights
文章平均质量分 78
hhhhhyyyyy8
好记性不如烂笔头
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
codefights_almostIncerasingSequence
题目:Given a sequence of integers as an array, determine whether it is possible to obtain a strictly increasing sequence by removing no more than one element from the array.ExampleFor sequence = [1, 3, ...原创 2018-04-04 10:43:50 · 503 阅读 · 0 评论 -
codefights_Different_Squares
Given a rectangular matrix containing only digits, calculate the number of different 2 × 2 squares in it.ExampleFormatrix = [[1, 2, 1], [2, 2, 2], [2, 2, 2], [1, 2, 3], ...原创 2018-04-12 20:57:05 · 229 阅读 · 0 评论
分享