leetcode8

Search Insert Position

#coding=utf-8
class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        if target in nums:
            return nums.index(target)
        else:
            if target<=nums[0]:
                return 0
            if target>=nums[-1]:
                return len(nums)
            for i in range(len(nums)):
                if nums[i]>target:
                    return i

Valid Sudoku

需要数字在当前列，当前行，当前矩阵都只出现了一次

#coding=utf-8
class Solution(object):
    def isValidSudoku(self, board):
        """
        :type board: List[List[str]]
        :rtype: bool
        """
        def isValid(x,y,temp):
            for i in range(9): 
                if board[i][y]==temp:
                    return False
            for i in range(9):
                if board[x][i]==temp:
                    return False
            for i in range(3):
                for j in range(3):
                    if board[((x/3)*3+i)][(y/3)*3+j]==temp:
                        return False


        for i in range(9):
            for j in range(9):
                if board[i][j]=='.':
                    continue
                temp=board[i][j]
                board[i][j]='D'
                if isValid(i,j,temp)==False:
                    return False
                else:
                    board[i][j]=temp
        return True