LeetCode——有序数组取交集

func interArr(arr1, arr2 []int) []int {
	resArr := make([]int, 0)
	if len(arr1) == 0 || len(arr2) == 0 {
		return resArr
	}
	arr1Index := 0
	arr2Index := 0

	for arr1Index < len(arr1) && arr2Index < len(arr2) {
		if arr1[arr1Index] == arr2[arr2Index] {
			resArr = append(resArr, arr1[arr1Index])
			arr1Index += 1
			arr2Index += 1
		} else if arr1[arr1Index] < arr2[arr2Index] {
			arr1Index += 1
		} else {
			arr2Index += 1
		}
	}
	return resArr
}
发布了151 篇原创文章 · 获赞 72 · 访问量 29万+

猜你喜欢

转载自blog.csdn.net/liyuxing6639801/article/details/105283847