Subscribe to unlock.

Thanks for using LeetCode! To view this question you must subscribe to premium.

😭

一句题外话，我很反感地铁到处都是广告。🤐BTW ，国外的地铁也是这样吗？

@JasonLaw 它后面也说了

The equals method for class Object implements **the most discriminating possible** equivalence relation on objects; that is, for any non-null reference values x and y, this method returns true if and only if x and y refer to the same object (x == y has the value true). In other words, under the reference equality equivalence relation, each equivalence class only has a single element.

我不明白你是怎么得出“equals 本来比较的是两个对象是否是同一个对象”这个结论的，可以给一下你的论证吗？

https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Object.html#equals(java.lang.Object)

文档上是这么说的。

The equals method implements an equivalence relation on non-null object references:

* It is reflexive: for any non-null reference value x, x.equals(x) should return true.
* It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
* It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
* It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
* For any non-null reference value x, x.equals(null) should return false.

@catfly #1

I am an LLM trained to respond in a subset of languages at this time, so I can't assist you with that. Please refer to the Bard Help Center for the current list of supported languages.

Where you can use Bard
Bard is currently available in 3 languages and over 180 countries and territories. We’ll gradually expand to more countries and territories in a way that is consistent with local regulations and our AI principles.

You can use Bard in the following languages:
US English
Japanese
Korean

@jifengg #1
@tjmljw #2
谢谢两位的解答😅

@sadfQED2 #37 这已经脱离了语句本身，网络不行，什么都会慢。还是那句话，这个题目和面试官都很傻逼。

@xuanbg #22 它只需要找出前两行就行了。如果觉得你是对的，麻烦给一下证据。

https://i.imgur.com/1XQU32J.png

@xuanbg #18 虽然 type 是 ALL ，但是不代表它要扫描所有行。没有 offset 的时候，它只会找出前两行。

https://i.imgur.com/1XQU32J.png

@xuanbg #13 没有索引也没事吧，它只是找出两条，它不在意总量多大，它的时间复杂度不是 O(n)，而是 O(1)。

ta 说负载导致的锁的问题，那具体是什么呢？什么负载？造成了什么锁？

这是一个很傻逼的问题，我想不出任何理由会导致 select id, name from t limit 2 慢。

我支持通过钱来过滤，但是有了钱之后，不算领养吧。🤐

NeetCode 的讲解。

https://www.youtube.com/watch?v=cFabMOnJaq0

题目链接： https://leetcode.com/problems/remove-k-digits/

Greedy? 不应该是 Monotonic Stack 吗？

你应该把你的 solution 发出来，这样子才能有正确性的证明，建议你 append 一下。

是非不分的人太多了，对的人却被别人当成是坏的。

@idragonet #17 这要看那个 team 的成员怎样了，有些人会很愿意帮助你融入整个 team 的。