2019/11/02【搜索插入位置】&【有效的数独】

题目一：【搜索插入位置】力扣——35

给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。

你可以假设数组中无重复元素。

示例 1:

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

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

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

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

#!/bin/bash
#搜索插入位置
#author:yzt 2019-11-02
#
read -t 30 -p "请输入一个排序数组：" nums
read -t 10 -p "请输入一个目标值：" target
echo "$nums"|sed 's#\[\|\]##g'|sed 's#,#\n#g' >tmp.txt
count1=`cat tmp.txt|wc -l`
count2=`grep -n "$target" tmp.txt|head -n1`
flag=false
if [ -z $count2 ];then
        for i in `cat tmp.txt`
        do
                if [ $i -gt $target ];then
                        flag=true
                        point=`grep -n "$i" tmp.txt|head -n1|awk -F : '{print $1}'`
                        point=$[$point-1]
                        echo "$point"
                        exit 0
                fi
        done
        if [ $flag = false ];then
                echo "$count1"
        fi
else
        point=`echo "$count2"|awk -F : '{print $1}'`
        echo "$point"
fi

脚本逻辑：

1、此需求分为如下三种情况：

第一：目标值包含在数组中，则直接使用grep -n导出对应数字的行数即可

第二：目标值不在数组中且比数组中的元素要小，此时直接输出0即可

第三：目标值不在数组中且比数组中的元素要大，此时输出数组元素个数即可

脚本效果：

[root@localhost leetcode]# ./sousuocharuweizhi.sh
请输入一个排序数组：[2,3,4]
请输入一个目标值：1
0
[root@localhost leetcode]# ./sousuocharuweizhi.sh
请输入一个排序数组：[2,3,4]
请输入一个目标值：5
3
[root@localhost leetcode]# ./sousuocharuweizhi.sh
请输入一个排序数组：[2,3,4]
请输入一个目标值：3
2
[root@localhost leetcode]# ./sousuocharuweizhi.sh
请输入一个排序数组：[2,3,5,6]
请输入一个目标值：4
2

 

题目二：【有效的数独】

判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

上图是一个部分填充的有效的数独。

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

示例 1:

输入:
[
  ["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"]
]
输出: true
示例 2:

输入:
[
  ["8","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"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。
     但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
说明:

一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 '.' 。
给定数独永远是 9x9 形式的。

 

#!/bin/bash
#有效的数独
#author:yzt 2019-11-02
#
for i in `cat tmp.txt`
do
        count1=`echo "$i"|sed 's#\[\|\]##g'|sed 's#"\|\.##g'|sed 's#,#\n#g'|grep -v "^$" |sort |uniq -c|awk '$1>1{print $2}'|head -n1`
        if [ ! -z $count1 ];then
                echo "false"
                exit 1
        fi
done
for((aa=1;aa<10;aa++))
do
        count2=`cat tmp.txt |sed 's#\[\|\]##g'|sed 's#"\|\.##g'|awk -F, -v j=$aa '{print $j}' |grep -v "^$"|sort|uniq -c|awk '$1>1{print $2}'|head -n1`
        if [ ! -z $count2 ];then
                echo "false"
                exit 2
        fi
done
fenxi(){
for((bb=1;bb<9;bb=bb+3))
do
        cc=$[$bb+1]
        dd=$[$cc+1]
        content=`cat $1|sed 's#\[\|\]##g'|sed 's#"\|\.##g'|awk -F , -v i=$bb -v j=$cc -v k=$dd '{print $i,$j,$k}'`
        for i in  $content
        do
                echo "$i"
        done > tmp3.txt
        count3=`cat tmp3.txt |grep -v "^$"| sort |uniq -c|awk '$1>1{print $2}'`
        if [ ! -z $count3 ];then
                echo "false"
                exit 3
        fi
done
}

cat /dev/null > tmp2.txt
for((ii=1;ii<10;ii=ii+3))
do
        jj=$[$ii+2]
        sed -n "$ii,$jj p" tmp.txt > tmp2.txt
        fenxi tmp2.txt
done
echo "true"

 脚本逻辑：

1、行判断：对每一行的内容进行判断，前后使用grep -v 去掉空行，使用sort排序，使用uniq获取重复行，最后使用awk获取重复行

2、列判断，使用awk获取文档的每一列，接着判断是否有重复数

3、小正方形判断：先使用sed获取三行；接着使用for循环中搭配awk获取三列内容就能遍历所有的数独；最后也是使用一样的方式进行判断

 

脚本效果：

[root@localhost leetcode]# ./youxiaodeshudu.sh
true
[root@localhost leetcode]# cat tmp.txt
["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"]
[root@localhost leetcode]# ./youxiaodeshudu.sh
false
[root@localhost leetcode]# cat tmp.txt
["5","3","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"]
[root@localhost leetcode]# ./youxiaodeshudu.sh
false
[root@localhost leetcode]# cat tmp.txt
["5","3",".",".","7",".",".",".","."]
["6",".",".","1","9","5",".",".","."]
[".","9","8",".",".",".",".","6","."]
["8",".",".",".","6",".",".",".","3"]
["4",".",".","8",".","3",".",".","1"]
["7",".",".",".","2",".",".",".","6"]
[".","6",".",".",".",".","2","8","."]
[".",".","6","4","1","9",".",".","5"]
[".",".",".",".","8",".",".","7","9"]