[Swift]LeetCode302. 包含黑色像素的最小矩形 $ Smallest Rectangle Enclosing Black Pixels

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10693911.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

An image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel. The black pixels are connected, i.e., there is only one black region. Pixels are connected horizontally and vertically. Given the location (x, y) of one of the black pixels, return the area of the smallest (axis-aligned) rectangle that encloses all black pixels.

For example, given the following image:

[
  "0010",
  "0110",
  "0100"
]

and x = 0, y = 2,

Return 6.

---

图像由一个二进制矩阵表示，其中0为白色像素，1为黑色像素。黑色像素连接，即只有一个黑色区域。像素水平和垂直连接。给定一个黑色像素的位置(x, y)，返回包围所有黑色像素的最小（轴对齐）矩形的区域。

例如，给出以下图像：

[
  "0010",
  "0110",
  "0100"
]

X=0，Y=2，

返回6。

---

Solution:

class Solution {
    func minArea(_ image:inout [String],_ x:Int,_ y:Int) -> Int {
        var m:Int = image.count
        var n:Int = image[0].count
        var up:Int = binary_search(&image, true, 0, x, 0, n, true)
        var down:Int = binary_search(&image, true, x + 1, m, 0, n, false)
        var left:Int = binary_search(&image, false, 0, y, up, down, true)
        var right:Int = binary_search(&image, false, y + 1, n, up, down, false)
        return (right - left) * (down - up)    
    }
    
    // Binary Search
    func binary_search(_ image:inout [String],_ h:Bool,_ i:Int,_ j:Int,_ low:Int,_ high:Int,_ opt:Bool) -> Int
    {
        var i = i 
        var j = j
        while (i < j)
        {
            var k:Int = low
            var mid:Int = (i + j) / 2
            while (k < high && (h ? image[mid][k] : image[k][mid]) == "0")
            {
                k += 1
            }
            if (k < high) == opt{ j = mid }
            else{ i = mid + 1 }
        }
        return i
    }
}

//String扩展
extension String {        
    //subscript函数可以检索数组中的值
    //直接按照索引方式截取指定索引的字符
    subscript (_ i: Int) -> Character {
        //读取字符
        get {return self[index(startIndex, offsetBy: i)]}
    }
}

---

点击：Playground测试

var sol = Solution()
var arr:[String] = ["0010","0110","0100"]
var x:Int = 0
var y:Int = 2
print(sol.minArea(&arr,x,y))
//Print 6