快支棱起来的椰子很愤怒

题解

/ 注册

全部文章 / 题解（共28篇）

题解 | #未排序数组中累加和为给定值的最长子数组系列问题补2#

n = int(input()) nums = list(map(int, input().split())) dic = {0: -1} su = 0 res = -1 for i in range(len(nums)): if nums[i] == 0: su -= 1 ...

Python3

2022-01-10

0 313

题解 | #未排序数组中累加和为给定值的最长子数组长度#

n, k = map(int, input().split()) l = list(map(int, input().split())) tree = {0: -1} su = 0 res = 0 for i in range(len(l)): su += l[i] if su in...

Python3

2022-01-07

0 330

题解 | #未排序正数数组中累加和为给定值的最长子数组的长度#

n, k = map(int, input().split()) arr = list(map(int, input().split())) i, j = 0, 0 res = 0 su = 0 while i <= j < n: if su < k: su...

Python3

2022-01-07

0 403

题解 | #设计getMin功能的栈#

class Stack: def __init__(self): self.A = [] self.B = [] def push(self, val): self.A.append(val) if not self.B...

Python3

2022-01-07

1 305

题解 | #不重复打印排序数组中相加和为给定值的所有三元组#

n, k = map(int, input().split()) arr = list(map(int, input().split())) for i in range(n - 2): if i != 0 and arr[i] == arr[i - 1]: continue...

Python3

2022-01-07

0 522

题解 | #不重复打印排序数组中相加和为给定值的所有二元组#

n, k = map(int, input().split()) arr = list(map(int, input().split())) i, j = 0, n - 1 re = set() while i < j: if arr[i] + arr[j] == k: ...

Python3

2022-01-07

2 474

题解 | #最长的可整合子数组的长度#

// python3 无法通过 package main import ( "fmt" "math" ) func max(x, y int) int { if x > y { return x } return y } fu...

Go

2022-01-07

0 542

题解 | #在行列都排好序的矩阵中找指定的数#

n, m, k = list(map(int, input().split())) matrix = [] for i in range(n): matrix.append(list(map(int, input().split()))) i, j = n - 1, 0 while n &g...

Python3

2022-01-07

0 377