Thousanrance的博客

DescriptionLet G=(V,E) be an undirected, connected, weighted graph who is represented as an adjacency matrix. Find the minimum spanning tree of G. A minimum spanning tree is a least-cost subset of the edges of a graph that connects all the nodes.Input

DescriptionImplement the LCS algorithm introduced in the class. You are required to output all possible LCS. The output set of LCS should in lexicographical order. Same LCS only need to output once.ExamplesInput:springtimeprintingOutput:prin

Problem DescriptionImplement a k-d Tree(in this problem k=2) and support the following operations:insert: Insert a new node with key into the k-d tree. search: Search the node with the given key. remove: Remove the node with the given key. findMin:

Problem DescriptionImplement a Trie(prefix tree) and support the following operations:insert: insert a string into the Trie. search: return true if the queried string has been inserted into the Trie. startsWith: return true if there is any string in

Input FormatThe program takes as input two lines.The first line is an unsorted array of integers in the range of [0,255].The second line is an integer k that 1≤k≤arraylength.Output FormatThe k-th largest element of the given array.NoteDO NOT.

We will implement Cuckoo Hashing here, which is a simple hash table with worst-case O(1) lookups and deletions.Cuckoo Hashing maintains two tables, each of which has m elements. Given an array X⊂N+, each element x∈X will either be at position h1​(x) in t

The main function takes as input two sequences of numbers and one single number. The first sequence represents [x1​,x2​,…,xi​] of some points, and the second sequence represents [y1​,y2​,…,yi​]. You need to find the Newton interpolating polynomial to pass

The main function takes as input two sequences of numbers and one single number. The first sequence represents [x1​,x2​,…,xi​] of some points, and the second sequence represents [y1​,y2​,…,yi​]. You need to find the Lagrange interpolating polynomial to pas

Problem DescriptionUse Gaussian Elimination to solve a linear system Ax = b. The input is in the form of the augmented matrix [A b]. A system of linear equations can have no solution, a unique solution or infinitely many solutions. The output should be a

Problem DescriptionUse Newton's method to solve a polynomial equation. The equation can be represented asThe input contains two lines. The first line contains an integer n. The second line contains n+1 floating point numbers a0​,...,an​.ExamplesW..

Given an array of integers citations where citations[i] is the number of citations a researcher received for their i-th paper. Please compute the researcher's h-index.According to the definition of h-index on Wikipedia: A scientist has an index h if h of