how to find soundex number

Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=5839Give you n three-dimensional point, and then beg this n each point can constitute how many special tetrahedron, special tetrahedron meet a two points;1. At least four faces, etc.;2. If only four edges are equal, then the remaining two edges are not adjacent;The range of n is 300;Violence enumerates the two points of one side of the tetrahedron, and then makes the distance between the other two points and the two points equal, judging whet

1. Give you a two-dimensional array, each number in the two-dimensional array is positive, requires to go from the upper left to the lower right corner, each step can only go to the right or down the number of steps along the way to add up, return the minimum path and1 #I,j determines that the return value is fixed2 defWalk (Matrix, I, j):3 ifi = = Len (matrix)-1 andj = = Len (matrix[0])-1:#to the lower

- if(Str[i].charat (0)! = ") { + Li.add (Str[i]); - } + } A } at -Collections.sort (Li,NewComparator() { - - @Override - Public intCompare (String O1, string O2) {//This is a natural sort based on the length of the string element in the list. - //TODO auto-generated Method Stub in returninteger.valueof (O1.length ()). CompareTo ( - integer.valueof (O2.length ())); to

in a line.Sample InputSample Output0Test instructions: There are n points, M-Edge (there is a heavy edge) of the graph, so that there may be a bridge in the picture, asked to add an edge, so that the bridge to the minimum, to seek the bridge tree.Idea: Figure out the number of bridges in the diagram, and then the reconstruction map must be a tree, the longest diameter of the tree, in the diameter of the two ends of the point connected, the figure of

Description Delete M numbers in integer n so that the remaining numbers are the largest in the original order, For example, when n = 92081346718538 and M = 10, the new maximum number is 9888. Input Enter a positive integer T in the first line, indicating that there are T groups of test data. Each group of test data occupies one row, each row has two numbers n, m (N may be a large integer, but its

Given an int array, there are duplicate values in it, how to find the most repeated number?This is a question raised by someone in a community, and the solution I think about is grouping.1, the first array of all the elements in the group, then, the repeated values will definitely be placed in a group;2, sorting groups, sorting criteria is the number of elements

Find the maximumTime limit:2000/1000 MS (java/others) Memory limit:65768/65768 K (java/others)Total submission (s): 1990 Accepted Submission (s): 837Problem Descriptioneuler ' s totient function,φ (n) [sometimes called the Phi function], is used to determine the number of Numbers less than n which is relatively prime to N. For example, as 1, 2, 4, 5, 7, and 8, is all less than nine and relatively primes to

Title Description: Find the maximum or minimum number of k in a good hundreds of millions of data. Analysis: This hundreds of millions of of the data must not be loaded together into memory, not to be directly sorted, so we are talking about the data structure in the Heap to solve this problem. Suppose this is to find out the maximum of 100 data from 100,000 d

Find the Duplicate numberGiven an array nums containing n + 1 integers where each integer is between 1 and N (inclusive) , prove that at least one duplicate element must exist. Assume that there are only one duplicate number, find the duplicate one.Note: You must the Modify the array (assume the array was read only). You must use only constant extra

1, Problem There are two ordered list, the list A and the List B, such: A => [1, 14, 20, 36] B => [,] The result that I want to get is: Result => [(), (7, null), (), (25, null), (32, null), ()] Put it into word: Find the closest number (which delta between counterpart is less than 5) in list A for each item in list B. First of all, I decide to divide the problem: 1.

Today I encountered a pen question: there are two arrays A and B, with the length of M and N respectively. Find the same element in the two arrays with the number of comparisons not greater than m + n. I didn't do it at the time. Now I am giving C #, which makes up a little regret. Using system; using system. collections. generic; using system. LINQ; using system. text; namespace sortab {class program {stat

title Link: https://leetcode.com/problems/search-for-a-range/?tab=DescriptionProblem: Finds the start and end subscript of a given number in an array known as descending orderUse two times scanning; the first scan obtains the starting subscript for a given number (from subscript i==0 to Nums.lenght-1) The second pass scans the reference code starting with the subscript from the first scan: Packageleetcode_5

1 ImportJava.util.HashMap;2 ImportJava.util.Map;3 ImportJava.util.Map.Entry;4 //in a positive integer less than 99999, find the number that meets the following criteria, which is both a full square number,5 //another two digits are the same, such as: 144,676. 6 Public classWQS {7 8 //Total Square Number9 Public Static BooleanIswqs (intN) {Ten

Method One: The mathematical method, first find the maximum value, need to compare the maximum value and array size, if smaller than the array size, indicating the maximum value of missing. Then use the arithmetic progression formula to calculate if the value is not missing and then subtract the number of the array.classSolution { Public: /** * @param nums:a vector of integers * @return: an integer*/

Describe　　A game is popular in a country. The rules of the game are: in a pile of balls, each ball has an integer number I (0 Input 　　The first line has two integers m,n (0 Next enter the M+n integer, the first m is the number I of the M ball, and the last n represents the random integer k in each game respectively. Output 　　Output "YES" or

Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11123 Accepted: 7913 DescriptionIn the Fibonacci integer sequence, f0 = 0, f1 = 1, and fn = fn ? 1 + Fn ? 2 for n ≥2. For example, the first ten terms of the Fibonacci sequence is:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...An alternative formula for the Fibonacci sequence is.Given an integer n, your goal was to compute the last 4 digits of Fn.InputThe input test file woul

English: Given A list of non negative integers, arrange them such that they form the largest number.English: Give a set of nonnegative integers to find the maximum number of non-negative integers that can be spliced outDescription: For example, give an array of [3, 30, 34, 5, 9], the maximum number of stitching out is 9534330The correct sorting method is to compa

Given a set character and a positive number k, find out all that does set it can be made up of length k the string collection/*Input:Set[] = {' A ', ' B '}, K = 3Output:AaaAaBAbaAbbBaaBabBbaBbbInput:Set[] = {' A ', ' B ', ' C ', ' d '}, K = 1Output:ABCDPackage Recursion;import Java.util.arraylist;public class N_sets_form_length_k_string {//give a set of characters and a positive

This is an example provided by Liu Xinyu in the Tl discussion. I think the idea is quite enlightening. So I should record it. Given an array, its content is random, non-repeating positive integers, such: {4, 23, 1, 8, 9, 21, 6, 12} It is required to find the smallest number that does not appear in the array. For example, the minimum value that does not appear in the array is: 2. The actual applicati

Algorithm question: Find the position where a number appears in an array, and an array of numbers // There is an int-type array, and the difference between each two adjacent numbers is not 1, that is, //-1. Given a number, we need to find the position of this number in the