how to find soundex number

1. Merge sort#include using namespacestd;Const intMAXN = +;intA[MAXN],B[MAXN];intans;voidMerge_sort (intXinty) { if(y-x>1) { intm = x+ (y-x)/2; intp = x, q = m,i =x; Merge_sort (X,M); Merge_sort (M,y); while(py) { if(q>=y| | (P]; Else{b[i++]=a[q++];ans+=m-p;} } for(inti = x;iB[i]; }}intMain () {intN; while(cin>>N) { for(intI=0; iA[i]; Ans=0; Merge_sort (0, N); coutEndl; for(intI=0; i" ";coutEndl; } return 0;}View Code2. Discrete + Tree-l

BackgroundRecently, in a Java exercise, you see such a problem: What's the output when this statement executed:System.out.printf (-7% 3); We are all familiar with the calculation of positive integers, but for the calculation of negative numbers and real numbers, it really gives people a very fresh feeling. So I did some research on this. I have found that there is still quite a bit of something to explore.ExploreFirst, take a look at the modulo operation of the natural

A thunder interview question: Find the number of times each letter appears in a string, the question string By Long Luo Personal blog address Last time inThunderDuring the interview, I encountered an algorithm question: There is a long and long string, all composed of uppercase letters. You must find the number of time

Ext.: http://www.itmian4.com/thread-6504-1-1.htmlMinimum Interval Original QuestionK ordered array, find the smallest interval range so that the K arrays, each array has at least one number within the range of this interval. Like what: Array 1:[4, 10, 15, 24, 26] Array 2:[0, 9, 12, 20] Array 3:[5, 18, 22, 30] The minimum interval is [20, 24], which contains 24 in array 1,

today, a friend to the United States to meet a team interview problem, with my slot did not do a good job, the topic probably thought is an ordered array, the front ordered a part of the array behind, is the entire array into a partial order, that is, first increment, break, and then increase: specifically as follows:It was 2 5 9 11 12 15 16, now put the last few in front,There's 12 15 16 2 5 9 11.Determines that a number is not in the array and doe

Given an int array, there are repeated values. How can we find the maximum number of duplicates? This is a question raised by someone in a community. The solution I think of is grouping. 1. group all elements in the array first. Repeated values are certainly placed in a group. 2. Sort groups by the number of elements in the group; 3. The group with the largest

Title: Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.Analysis: Fixed a point, traversing the remaining points, the period with a HashMap record two points slope and the number of slopes, the local maximum value, and then fixed another point, traversing the rest, ..., that is, two loops, the inner loop to

Test instructions: There are n individuals to the party, but the condition is that the party location to his home is not more than 2.5, now you need to find the best party location for the most people to party.Analysis:The topic looks very difficult, how to ask scope and then contain points? In fact, a center + RADIUS does not represent a circle.Enumerates the center of a circle with a radius of 2.5 for two points, saves it, and then uses these center

Problem Description: Find the prime number within a rangeIdea: to label each numberFirst, to iterate through all the numbers in that range, a cycleThen, traverse 2 to n-1. See if they can be divisible.Code:#-*-coding:utf-8-*-Importstring#find the prime number within 100defPrime (N): Tag= {} forIinchRange (0,n+1): t

Given an array of integers, every element appears twice except for one. Find the single one.Note:Your algorithm should has a linear runtime complexity. Could you implement it without using extra memory?In the array, except one element appears once, the other appears two times to find the element that appears only once.A number and an XOR result of 0, a

Through the map class implementation, by means of key-value pairs, each character of the input string can be entered as a key, and the number of occurrences of each character as a value is as follows:public class Find {public static void Main (string[] args) {String Scan=new Scanner (system.in). nextline ();//Gets the string entered on the keyboard;map　　　　With a For loop, the string's key value is stored in

#include "stdio.h" #include "malloc.h" #include "math.h" #include "string.h" #define MAX 100 void exit (int); /*--------------------*/ int count; /* Record the number of two-degree nodes in the binary tree */ int flag; /* Indicates whether the binary tree is an AVL tree */ /*--------------------*/ typedef struct node{ Char D; struct node *lchild,*rchild; }tnode; /*-----Build-----Through the sequencing sequence and sequencing sequen

SourceDOCTYPE HTML>HTML> Head> MetaCharSet= "Utf-8" /> title>title> Head> Body> Script> varary=["Ding Shao"," Wang Xin","Ding Shao"]; Ary.sort (); //sort the array alphabetically varRes= []; for(varI= 0; Iary.length;) {varCount= 0; for(varJ=i;jary.length;j++){if(Ary[i]==Ary[j]) {Count++;}} Res.push ([Ary[i],count]); I+=count; } //Res holds the number of repetitions

Laravel: Use only one statement, how to find out a table, different conditions corresponding data bar number As the following table: id name age sex 1 a 1 02 b 10 1 3 c 2 1 The number of sex is 1 and age is 2, sex is 1 and age is 5, sex is

Write a program, the user input two number, to find out its subtraction, and the message box to display the calculation resultsImport Javax.swing.JOptionPane;public class test{public static void Main (string[] args) {int N1=integer.parseint (Joptionpane.showinputdialog ("Input number 1:"));int N2=integer.parseint (Joptionpane.showinputdialog ("Input

Find the ball number (a) time limit:MS | Memory limit:65535 KB Difficulty:3 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 (0Next enter the M+n integer, the first m is the

Given an array nums containing n + 1 integers where each integer is between 1 and N (inclusive) , prove that at least one duplicate number 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, O(1) Extra space. Your runt

287. Find the Duplicate numbermy submissionsQuestionTotal Accepted: 18097 Total Submissions: 48596 Difficulty: HardGiven an array nums containing n + 1 integers where each integer is between 1 and N (inclusive) , prove that at least one duplicate number must exist. Assume that there are only one duplicate number, find