[返回数组中 k 个最大值和最小值] #array

100%

[返回数组中 k 个最大值和最小值] #array

✓ Published0🌍 Public

Last edited Jan 25, 2019

Created on Jan 20, 2019

This example demonstrates how to extract the k largest and smallest values from a collection using Python’s `heapq` module. It first applies `heapq.nlargest` and `heapq.nsmallest` directly to a list of integers, showing the top and bottom three elements. The code then illustrates the use of a `key` parameter to sort a list of dictionaries by a specific field, such as `price`, to identify the cheapest and most expensive items in a portfolio dataset.

AI-generated description

Similar vizzes

Loading thumbnail…

[合并多个已经排序的 lists] 多个已经排序过的 lists，将这些 lists 合并并排序 #array

This example demonstrates how to merge multiple pre-sorted lists into a single sorted sequence. It uses Python's `heapq.merge` function, which accepts two sorted lists—here, `a = [1, 4, 7, 10]` and `b = [2, 5, 6, 11]`—and returns a generator yielding items in ascending order. The code then iterates through the generator with a `for` loop, printing each merged value. The key constraint is that `heapq.merge` only works correctly when all input lists are already sorted, as shown in this minimal, console-based illustration.

SShawn91

52% match

Loading thumbnail…

Shiyanlou Chapter 2 last exercice

This example shows how to find the maximum and minimum values in a fixed array of integers, producing a simple console output. It uses the Java Stream API with `java.util.Arrays.asList(...).stream()` and the `max` and `min` terminal operations, comparing elements with `Integer::compare`. The code also includes commented-out alternatives using `Arrays.stream(data).min().getAsInt()` and an `Arrays.sort` approach, but only the stream-based version executes. The data source is a hardcoded array of nine integer values, and the rendering is text-based via `System.out.println`.

AAlsaxian

50% match

Loading thumbnail…

Freecodecamp

This example visualizes the process of refactoring a JavaScript function that returns the largest number from each sub-array in a nested array. It shows three successive code versions—using `Math.max.apply`, the spread operator with `Math.max(...arr[i])`, and a manual nested loop—to achieve the same result. The code relies on standard JavaScript array methods and the `Math.max` API, with no external libraries. The visualization likely renders the code side-by-side or as a sequence, highlighting syntax differences and algorithmic approaches. The data source is the hardcoded sample array passed to each function call, demonstrating how the output remains identical across implementations.

EEelsie

45% match

Loading thumbnail…

Find the largest of a sub-array for a specific window size

This example demonstrates the sliding window maximum problem, showing how to find the largest value within every contiguous sub-array of a fixed size as the window moves across an integer array. The Groovy script initializes an array of nine integers and a window size of three, then iterates through the array, extracting each window into a temporary array. For each window, it calls the `getMax` function, which concatenates the window’s elements into a string and identifies the largest value by comparing each element against a running maximum. The output prints each window’s contents followed by an arrow and the computed maximum, illustrating the algorithm’s step-by-step progression without using any visualization libraries.

PP7h

44% match

Loading thumbnail…

For @BillLaboon hey @franklinchen is there an easy way in Haskell to find out which element in a list is most common, e.g. [1,1,1,2,3] -> 1 ?

This example demonstrates a Haskell function that identifies the most frequently occurring element in a list, returning `Just 1` for `[1,1,1,2,3]`. It uses a priority queue from the `Data.PSQueue` library, where each element’s priority is stored as a `Data.Ord.Down` value, allowing the minimum (i.e., highest count) to be retrieved via `PSQueue.findMin`. The `updateQueue` function increments counts using `PSQueue.alter`, and the code includes a unit test with `Test.HUnit`. The data source is an inline list literal passed to `mostCommon`.

FFranklin Chen

44% match

Loading thumbnail…

JavaScript Arrays

This example demonstrates how JavaScript’s built-in array methods can transform and organize data, specifically by sorting an array of objects by their `key` property. It shows the result of calling `entries.sort((a,b) => a.key < b.key ? -1:1)`, which arranges the entries alphabetically by key. The code also includes commented-out examples of `filter`, `map`, `reduce`, and numeric sorting with comparator functions, illustrating pitfalls like lexicographic sorting of numbers. The implementation relies solely on native JavaScript array APIs, with no external libraries or rendering, outputting results to the console.

Kkwambokar

44% match

Loading thumbnail…

sortArrayByKey.js

This example demonstrates a reusable utility for sorting arrays of objects by nested properties, such as `letter` or `values.value2`. The function `sortArrayByKey` first maps each element to extract the target value via dot-notation path traversal, then sorts the mapped indices using a comparator that handles string and numeric comparisons, and finally returns the reordered original objects. It uses plain JavaScript array methods (`map`, `sort`) without external libraries, and the included example generates random test data with `Math.random` to show sorting across different key depths.

MMAKIO135

44% match

Loading thumbnail…

[循环过程中记录最后/开头 N 次循环结果]在一篇文档中搜索包含特定关键词的行，保存文档最开头包含特定关键词的几行，或文档结尾包含特定关键词的几行 #python #array

This example demonstrates how to preserve only the last N occurrences of lines matching a keyword while searching through a document, yielding each matching line along with the saved history. The code uses Python’s `collections.deque` with a `maxlen` parameter to automatically drop the oldest entries once the buffer exceeds the specified size. A generator function `search` iterates over the input lines, checks for the keyword pattern, and yields both the current match and the deque containing previous matches. The example input `['abc', 'bcd', 'hahaha', 'acd', 'cef']` is processed with a history limit of 3, producing a final deque showing only the last three matched lines.

SShawn91

43% match