484 · 交换数组两个元素
给你一个数组和两个索引,交换下标为这两个索引的数字
def swapIntegers(self, A, index1, index2):
# write your code here
A[index1], A[index2] = A[index2], A[index1]
还是我之前考虑的比较周全,我现在二刷属实是有点得意忘形了。
def swapIntegers(self, A, index1, index2):
# write your code here
if (index1 >= 0 and index1 < len(A)) and (index2 >= 0 or index2 < len(A)):
A[index1], A[index2] = A[index2], A[index1]
463 · 整数排序
给一组整数,按照升序排序,使用选择排序,冒泡排序,插入排序或者任何 O(n2) 的排序算法。
def sortIntegers(self, A):
# write your code here
n = len(A)
for i in range(n - 1):
for j in range(i + 1, n):
if A[i] > A[j]:
A[i], A[j] = A[j], A[i]
return A
def sortIntegers(self, A):
# write your code here
n = len(A)
for i in range(n - 1):
for j in range(i, n):
if A[i] > A[j]:
A[i], A[j] = A[j], A[i]
return A
我老是把选择当成冒泡,冒泡记住了,是j循环自己和自己比。
def sortIntegers(self, A):
if A == None or len(A) == 0:
return
for i in range(len(A) - 1):
for j in range(len(A) - 1 - i):
if A[j] > A[j + 1]:
A[j], A[j + 1] = A[j + 1], A[j]
选择写的也不对,下面是标准的选择:
def sortIntegers(self, A):
if A == None or len(A) == 0:
return
for i in range(len(A)):
tmp = i
for j in range(i + 1, len(A)):
if A[j] < A[tmp]:
tmp = j
A[i], A[tmp] = A[tmp], A[i]
插入:
def sortIntegers(self, A):
if A == None or len(A) == 0:
return
for i in range(1, len(A)):
for j in range(i - 1, -1, -1):
if A[i] < A[j]:
A[i], A[j] = A[j], A[i]
i = j
else:
break
上面几个排序算法要经常写才行。熟能生巧。
214 · 数组的最大值
给一个浮点数数组,求数组中的最大值。
def maxOfArray(self, A):
# write your code here
return max(A)
25 · 打印X
输入一个正整数N, 你需要按样例的方式返回一个字符串列表。
想半天,没想出来,看了之前的答案:
def printX(self, n: int) -> List[str]:
# write your code here
li = []
for i in range(n):
temp = [' '] * n
temp[i], temp[n - 1 - i] = 'X', 'X'
li.append("".join(temp))
return li
298 · 寻找素数
输出n以内所有的素数。
def prime(self, n):
# write your code here
res = []
for i in range(2, n + 1):
if i == 2 or i == 3 or i == 5 or i == 7:
res.append(i)
elif i % 2 != 0 and i % 3 != 0 and i % 5 != 0 and i % 7 != 0:
res.append(i)
return res
之前写的太暴力了,我觉得,虽然代码更优雅:
def prime(self, n):
# write your code here
if n <= 1: return []
li = []
for i in range(2, n + 1):
for j in range(2, i):
if i % j == 0:
break
else: li.append(i)
return li