3
<
=
n
u
m
s
.
l
e
n
g
t
h
<
=
1
0
3
3 <= nums.length <= 10^3
3<=nums.length<=103
−
1
0
3
<
=
n
u
m
s
[
i
]
<
=
1
0
3
-10^3 <= nums[i] <= 10^3
−103<=nums[i]<=103
−
1
0
4
<
=
t
a
r
g
e
t
<
=
1
0
4
-10^4 <= target <= 10^4
−104<=target<=104
2,程序代码
# -*- coding: utf-8 -*-"""
Created on Sat Jan 15 19:46:46 2022
Function: 最接近的三数之和
@author: 小梁aixj
"""from typing import List
classSolution:defthreeSumClosest(self, nums: List[int], target:int)->int:
nums.sort()
cur =0
closest = nums[0]+ nums[1]+ nums[2]while cur <len(nums)-2:
left = cur +1
right =len(nums)-1while left < right:
n = nums[cur]+ nums[left]+ nums[right]ifabs(target - n)<abs(target - closest):
closest = n
if n == target:breakelif n > target:
t = right -1while(t > left and nums[t]== nums[right]):
t -=1
right = t
else:
t = left +1while(t < right and nums[t]== nums[left]):
t +=1
left = t
t = cur +1while(t <len(nums)and nums[t]== nums[cur]):
t +=1
cur = t
return closest
# %%
s = Solution()print(s.threeSumClosest(nums =[-1,2,1,-4], target =1))
3,运行结果
二,螺旋矩阵 II
1,程序简介
给你一个正整数 n ,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。
示例 1:
输入:n = 3
输出:[[1,2,3],[8,9,4],[7,6,5]]
示例 2:
输入:n = 1
输出:[[1]]
提示
1 <= n <= 20
2,程序代码
# -*- coding: utf-8 -*-"""
Created on Sat Jan 15 19:48:02 2022
Function: 螺旋矩阵 II
@author: 小梁aixj
"""classSolution(object):defgenerateMatrix(self, n):"""
:type n: int
:rtype: List[List[int]]
"""
res =[[0]* n for _ inrange(n)]
pos =[0,0]
move =(0,1)for index inrange(1, n * n +1):
res[pos[0]][pos[1]]= index
if res[(pos[0]+ move[0])% n][(pos[1]+ move[1])% n]>0:
move =(move[1],-1* move[0])
pos[0]= pos[0]+ move[0]
pos[1]= pos[1]+ move[1]return res
if __name__ =='__main__':
s = Solution()print(s.generateMatrix(3))