-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0074.swift
94 lines (88 loc) · 1.94 KB
/
q0074.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
//
// q0074.swift
// LeetcodeSwift
//
// Created by NowOrNever on 10/03/2020.
// Copyright © 2020 DL. All rights reserved.
//
import Foundation
//74. Search a 2D Matrix
//Medium
//
//1365
//
//142
//
//Add to List
//
//Share
//Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
//
//Integers in each row are sorted from left to right.
//The first integer of each row is greater than the last integer of the previous row.
//Example 1:
//
//Input:
//matrix = [
// [1, 3, 5, 7],
// [10, 11, 16, 20],
// [23, 30, 34, 50]
//]
//target = 3
//Output: true
//Example 2:
//
//Input:
//matrix = [
// [1, 3, 5, 7],
// [10, 11, 16, 20],
// [23, 30, 34, 50]
//]
//target = 13
//Output: false
//Accepted
//289,309
//Submissions
//805,746
class q0074Solution {
func searchMatrix(_ matrix: [[Int]], _ target: Int) -> Bool {
if matrix.count < 1 || matrix[0].count < 1 {
return false
}
var left = 0
var right = matrix.count - 1
var index = -1
while left <= right {
let mid = (left + right) / 2
if matrix[mid][0] <= target {
index = mid
left = mid + 1
}else{
right = mid - 1
}
}
guard index > -1 else {
return false
}
left = 0
right = matrix[index].count - 1
while left <= right {
let mid = (left + right) / 2
if matrix[index][mid] == target {
return true
}else if matrix[index][mid] < target{
left = mid + 1
}else{
right = mid - 1
}
}
return false
}
}
func q0074(){
let solu = q0074Solution()
let matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,50]]
let target = 1
let result = solu.searchMatrix(matrix, target)
print(result)
}