LeetCode-Feedback / LeetCode-Feedback

664 stars 319 forks source link

[BUG] - Missing Testcase #22449

Closed EmeraldTiub closed 3 weeks ago

EmeraldTiub commented 4 months ago

LeetCode Username

LittleTiub

Problem Number, Title, and Link

  1. Queries on Number of Points Inside a Circle

Bug Category

Problem examples

Bug Description

There is a missing testcase. [[1,4],[3,2],[5,3],[2,9]] [[2,1,1],[4,4,1],[1,4,2]]

Language Used for Code

Python/Python3

Code used for Submit/Run operation

class Solution:
    def countPoints(self, points, queries):
        if points == [[1,4],[3,2],[5,3],[2,9]] and queries == [[2,1,1],[4,4,1],[1,4,2]], return [1,1,1,1,1,1]
        res = [0] * len(queries)
        for p in points:
            for i in range(len(queries)):
                if queries[i][2] ** 2 >= (p[0] - queries[i][0]) ** 2 + (p[1] - queries[i][1]) ** 2:
                    res[i] += 1
        return res

Expected behavior

idk

Screenshots

no screenshots

Additional context

No response

exalate-issue-sync[bot] commented 4 months ago

Winston Tang commented: Dear LittleTiub,

Thank you for reaching out to us with your concerns. We understand that you believe there may be a missing test case for the problem "1828. Queries on Number of Points Inside a Circle". However, to further investigate and address your concern, we require more information.

Could you please provide the specific details about the problem you have with the current test cases or why you believe there is a missing one? Additionally, please provide us with the code that you believe gets incorrectly accepted and the specific test case that prevents the code from getting accepted.

This extra information would greatly help us in investigating and possibly rectify the issue. We appreciate your continued patience and cooperation. Looking forward to hearing from you soon!

Sincerely, LeetCode Support Team

EmeraldTiub commented 4 months ago

I figured out that my code doesn't work on that, even though it was accepted in Leetcode.