The max of all the values in the DataFrame can be obtained using df.to_numpy().max(), or for pandas < 0.24.0 we use df.values.max(): In [10]: df.to_numpy().max() Out[10]: ‘f’ The max is f rather than 43.0 since, in CPython2, In [11]: ‘f’ > 43.0 Out[11]: True In CPython2, Objects of different types … are ordered by their … Read more
For Ruby 1.8.7 or above: a.each_with_index.max[1] It does one iteration. Not entirely the most semantic thing ever, but if you find yourself doing this a lot, I would wrap it in an index_of_max method anyway.
Here’s an explanation to go with the posted code. There are two key tricks to make this work efficiently: (I) Kadane’s algorithm and (II) using prefix sums. You also need to (III) apply the tricks to the matrix. Part I: Kadane’s algorithm Kadane’s algorithm is a way to find a contiguous subsequence with maximum sum. … Read more
select coalesce(max(column), 0) from mytable;
This works correctly with backspace and copy & paste: #define MAXLENGTH 10 – (BOOL)textField:(UITextField *) textField shouldChangeCharactersInRange:(NSRange)range replacementString:(NSString *)string { NSUInteger oldLength = [textField.text length]; NSUInteger replacementLength = [string length]; NSUInteger rangeLength = range.length; NSUInteger newLength = oldLength – rangeLength + replacementLength; BOOL returnKey = [string rangeOfString: @”\n”].location != NSNotFound; return newLength <= MAXLENGTH || … Read more
Similar to colMeans, colSums, etc, you could write a column maximum function, colMax, and a column sort function, colSort. colMax <- function(data) sapply(data, max, na.rm = TRUE) colSort <- function(data, …) sapply(data, sort, …) I use … in the second function in hopes of sparking your intrigue. Get your data: dat <- read.table(h=T, text = … Read more
Each label may contain up to 63 characters.
I am surprised no-one has mentioned the simplest solution,max() with the key list.count: max(lst,key=lst.count) Example: >>> lst = [1, 2, 45, 55, 5, 4, 4, 4, 4, 4, 4, 5456, 56, 6, 7, 67] >>> max(lst,key=lst.count) 4 This works in Python 3 or 2, but note that it only returns the most frequent item and … Read more
The shortest (and possibly fastest) query would be with DISTINCT ON, a PostgreSQL extension of the SQL standard DISTINCT clause: SELECT DISTINCT ON (1) id, count, year FROM tbl ORDER BY 1, 2 DESC, 3; The numbers refer to ordinal positions in the SELECT list. You can spell out column names for clarity: SELECT DISTINCT … Read more
No need to use iteritems and itemgetter. The dict’s own get method works fine. max(A, key=A.get) Similarly for sorting: sorted(A, key=A.get, reverse=True)[:5] Finally, if the dict size is unbounded, using a heap will eventually be faster than a full sort. import heapq heapq.nlargest(5, A, key=A.get) For more information, have a look at the heapq documentation.