1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

/// 剑指 Offer 53 - I. 在排序数组中查找数字 I
/// <https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/>

pub struct Solution;

#[allow(unused)]
impl Solution {
	pub fn search(nums: Vec<i32>, target: i32) -> i32 {
		nums.iter().filter(|&&x| x == target).count() as i32
	}
}

#[cfg(test)]
mod tests {
	use super::*;

	#[test]
	fn test() {
		assert_eq!(Solution::search(vec![], 0), 0);
		assert_eq!(Solution::search(vec![1], 1), 1);
		assert_eq!(Solution::search(vec![5, 7, 7, 8, 8, 10], 8), 2);
		assert_eq!(Solution::search(vec![5, 7, 7, 8, 8, 10], 6), 0);
	}
}