每日一练 — 2021.12.29

---

一，搜索插入位置

1，程序简介

• 给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。
• 你可以假设数组中无重复元素。

1）示例 1:

• 输入: [1,3,5,6], 5
• 输出: 2

2）示例 2:

• 输入: [1,3,5,6], 2
• 输出: 1

3）示例 3:

• 输入: [1,3,5,6], 7
• 输出: 4

4）示例 4:

• 输入: [1,3,5,6], 0
• 输出: 0

2，程序代码

# -*- coding: utf-8 -*-
"""
Created on Wed Dec 29 09:18:02 2021
Function: 搜索插入位置
@author: 小梁aixj
"""
class Solution:
    def searchInsert(self, nums, target):
        l, r = int(0), len(nums) - 1
        while l < r:
            mid = int((l + r) / 2)
            if nums[mid] < target:
                l = mid + 1
            else:
                r = mid
        if nums[l] < target:
            return l + 1
        return l
if __name__=="__main__":
    s = Solution()
    print(s.searchInsert([1,3,5,6], 5))#2
    print(s.searchInsert([1,3,5,6], 2))#1

3，运行结果

二，请问如何使用python做两个数组逐位判断？

1，程序简介

• 比如有以下数组：
  a1: 1,0,0,1,0,0,0,1
  a2: 0,0,0,0,1,1,1,1
  a3: 0,1,0,1,0,1,0,0
  a4: 1,0,1,1,1,1,0,0
  a5: … 抓取三个数组进行判断。
• if ((a1第一位or a2第一位 or a3第一位=1 )and (a1第二位 or a2 第二位 or a3第二位=1）and… 直到判断完所有位数为止，所有位都有了1的话就输出当前这三个数组，已输出的数组不参与之后的判断。

2，程序代码

# -*- coding: utf-8 -*-
"""
Created on Wed Dec 29 09:21:24 2021
Function: 用python做两个数组逐位判断
@author: 小梁aixj
"""
from itertools import combinations
a1 = [1,0,0,1,0,0,0,1]
a2 = [0,0,0,0,1,1,1,1]
a3 = [0,1,0,1,0,1,0,0]
a4 = [1,0,1,1,1,1,0,0]
a5 = [1,1,1,1,1,1,1,0]
a6 = [0,0,0,0,0,0,0,1]
a = [a1,a2,a3,a4,a5,a6]
al = list(combinations(a, 3))
for i in al:
    flag = True
    for j in range(len(i[0])):
        if (i[0][j] + i[1][j] + i[2][j] == 0):
            flag = False
            break
    if flag:
        print(i)

3，运行结果

三，解数独

1，程序简介

• 编写一个程序，通过填充空格来解决数独问题。

数独的解法需 遵循如下规则：

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）

• 数独部分空格内已填入了数字，空白格用 ‘.’ 表示。

示例：

输入：board =
[[“5”,“3”,".",".",“7”,".",".",".","."],
[“6”,".",".",“1”,“9”,“5”,".",".","."],
[".",“9”,“8”,".",".",".",".",“6”,"."],
[“8”,".",".",".",“6”,".",".",".",“3”],
[“4”,".",".",“8”,".",“3”,".",".",“1”],
[“7”,".",".",".",“2”,".",".",".",“6”],
[".",“6”,".",".",".",".",“2”,“8”,"."],
[".",".",".",“4”,“1”,“9”,".",".",“5”],
[".",".",".",".",“8”,".",".",“7”,“9”]]
输出：
[[“5”,“3”,“4”,“6”,“7”,“8”,“9”,“1”,“2”],
[“6”,“7”,“2”,“1”,“9”,“5”,“3”,“4”,“8”],
[“1”,“9”,“8”,“3”,“4”,“2”,“5”,“6”,“7”],
[“8”,“5”,“9”,“7”,“6”,“1”,“4”,“2”,“3”],
[“4”,“2”,“6”,“8”,“5”,“3”,“7”,“9”,“1”],
[“7”,“1”,“3”,“9”,“2”,“4”,“8”,“5”,“6”],
[“9”,“6”,“1”,“5”,“3”,“7”,“2”,“8”,“4”],
[“2”,“8”,“7”,“4”,“1”,“9”,“6”,“3”,“5”],
[“3”,“4”,“5”,“2”,“8”,“6”,“1”,“7”,“9”]]
解释：输入的数独如上图所示，唯一有效的解决方案如下所示：

提示：

board.length == 9
board[i].length == 9
board[i][j] 是一位数字或者 '.'
题目数据 保证 输入数独仅有一个解

以下程序实现了这一功能，请你填补空白处内容：

class Solution(object):
	def solveSudoku(self, board):
			def isvaild(i,j):
				for m in range(9):
					if m!=i and board[m][j]==board[i][j]:
						return False
				for n in range(9):
					if n!=j and board[i][n]==board[i][j]:
						return False
				______________________;
				return True
			def f(a,b,board):
				for i in range(a,9):
					for j in range(b,9):
						if board[i][j]=='.':
							for c in '123456789':
								board[i][j]=c
								if isvaild(i,j):
									if f(a,b,board):return True
									else: board[i][j] = '.'
								else:board[i][j] = '.'
							return False
				return True
			f(0,0,board)
			return board
# %%
s = Solution()
board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8","."],[".",".",".","4","1","9",".",".","5"],[".",".",".",".","8",".",".","7","9"]]
print(s.solveSudoku(board))

2，程序代码

# -*- coding: utf-8 -*-
"""
Created on Wed Dec 29 09:23:06 2021
Function: 解数独
@author: 小梁aixj
"""
class Solution(object):
    def solveSudoku(self, board):
        def isvaild(i,j):
            for m in range(9):
                if m!=i and board[m][j]==board[i][j]:
                    return False
            for n in range(9):
                if n!=j and board[i][n]==board[i][j]:
                    return False
            for m in range(i//3*3,i//3*3+3):
                for n in range(j//3*3,j//3*3+3):
                    if m!=i and n!=j and board[m][n]==board[i][j]:
                        return False
            return True
        def f(a,b,board):
            for i in range(a,9):
                for j in range(b,9):
                    if board[i][j]=='.':
                        for c in '123456789':
                            board[i][j]=c
                            if isvaild(i,j):
                                if f(a,b,board):return True
                                else: board[i][j]='.'
                            else: board[i][j]='.'
                        return False
            return True
        f(0,0,board)
        return board
#%%
s=Solution()
board=[['5','3','.','.','7','.','.','.','.'],
       ['6','.','.','1','9','5','.','.','.'],
       ['.','9','8','.','.','.','.','.','.'],
       ['8','.','.','.','6','.','.','.','3'],
       ['4','.','.','8','.','3','.','.','1'],
       ['7','.','.','.','2','.','.','.','6'],
       ['.','6','.','.','.','.','2','8','.'],
       ['.','.','.','4','1','9','.','.','5'],
       ['.','.','.','.','8','.','.','7','9']]

print('按原样输出：')
print(s.solveSudoku(board))
print('格式化输出：')
#格式化输出
a=s.solveSudoku(board)
for x in range(9):
    for y in range(9):
        print(a[x][y], end="  ")
    print()

3，运行结果