Timeline for Count the number of unique elements in a sorted array
Current License: CC BY-SA 3.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/
|
|
Jan 8, 2016 at 19:08 | comment | added | greybeard |
@Legato : probably, given that [3, 2, 3, 2] doesn't look a sorted array . Naming is important, and I find it non-trivial here, not liking countUnique for almost implying how to, and numberOfDistinctValues() looks an alphabetic procession.
|
|
Dec 17, 2015 at 18:14 | comment | added | Legato | Possibly a misunderstanding but this seems like counting discrete values rather than counting uniques. e.g. for an array [3, 2, 3, 2] I'd expect it to return 0. Could be a naming issue rather than a misunderstanding of the requirements. | |
Dec 17, 2015 at 10:00 | history | edited | Quill | CC BY-SA 3.0 |
added 2 characters in body
|
Dec 16, 2015 at 6:26 | answer | added | h.j.k. | timeline score: 0 | |
Dec 16, 2015 at 0:30 | answer | added | TheCoffeeCup | timeline score: 4 | |
Dec 16, 2015 at 0:17 | history | edited | h.j.k. | CC BY-SA 3.0 |
corrected typo.
|
Dec 15, 2015 at 21:19 | answer | added | oopexpert | timeline score: -1 | |
Dec 15, 2015 at 20:43 | answer | added | Barry | timeline score: 7 | |
Dec 15, 2015 at 20:12 | vote | accept | cody.codes | ||
Dec 15, 2015 at 20:07 | answer | added | janos | timeline score: 10 | |
Dec 15, 2015 at 19:54 | history | asked | cody.codes | CC BY-SA 3.0 |