2690 shaares
如何在 VS Code 中调试 LeetCode 代码
public static int aji(int[] arr,int i){
int i1=i;//下一个值
int i2;//最大值
for(int j=0;j<arr.length;j++){
if(arr[j]>i){//大于基本值
i2=arr[j];//赋max值
if(i1>i2 || i==i1){//第一次进来 i=i1<i2 所以把i2赋值给i1，以后i<i1 第二次进来 如果：i1>i2>i，则：所以把i2赋值给i1，否则不变
i1=i2;
}
}
}
return i1;
}
int i1=i;//下一个值
int i2;//最大值
for(int j=0;j<arr.length;j++){
if(arr[j]>i){//大于基本值
i2=arr[j];//赋max值
if(i1>i2 || i==i1){//第一次进来 i=i1<i2 所以把i2赋值给i1，以后i<i1 第二次进来 如果：i1>i2>i，则：所以把i2赋值给i1，否则不变
i1=i2;
}
}
}
return i1;
}
maxIndex(arr)
apiVersion: v1
kind: PersistentVolumeClaim
metadata:
name: portainer
namespace: ecs
spec:
accessModes:
- ReadWriteMany
resources:
requests:
storage: "1024Gi"
volumeName:
storageClassName: nfs
kind: PersistentVolumeClaim
metadata:
name: portainer
namespace: ecs
spec:
accessModes:
- ReadWriteMany
resources:
requests:
storage: "1024Gi"
volumeName:
storageClassName: nfs
def threeSumClosest(self, nums, target):
nums, result, min_diff, i = sorted(nums), float("inf"), float("inf"), 0
while i < len(nums) - 2:
if i == 0 or nums[i] != nums[i - 1]:
j, k = i + 1, len(nums) - 1
while j < k:
diff = nums[i] + nums[j] + nums[k] - target
if abs(diff) < min_diff:
min_diff = abs(diff)
result = nums[i] + nums[j] + nums[k]
if diff < 0:
j += 1
elif diff > 0:
k -= 1
else:
return target
i += 1
return result
nums, result, min_diff, i = sorted(nums), float("inf"), float("inf"), 0
while i < len(nums) - 2:
if i == 0 or nums[i] != nums[i - 1]:
j, k = i + 1, len(nums) - 1
while j < k:
diff = nums[i] + nums[j] + nums[k] - target
if abs(diff) < min_diff:
min_diff = abs(diff)
result = nums[i] + nums[j] + nums[k]
if diff < 0:
j += 1
elif diff > 0:
k -= 1
else:
return target
i += 1
return result
Michael喜欢滑雪百这并不奇怪
Michael喜欢滑雪百这并不奇怪