fix tools function bug #1296
Open
fix tools function bug #1296
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
问题： 函数getIntersection里，因为循环次数取arr1和arr2长度的最小值，但遍历的是arr2数组，如果arr2的长度大于arr1，则arr2没有被完全遍历，得到的交集不准确 解决： 固定取arr1的长度为循环次数，遍历arr1，对每个元素判断arr2中是否存在
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
问题：
函数getIntersection里，因为循环次数取arr1和arr2长度的最小值，但遍历的是arr2数组，如果arr2的长度大于arr1，则arr2没有被完全遍历，得到的交集不准确
解决：
固定取arr1的长度为循环次数，遍历arr1，对每个元素判断arr2中是否存在