how to find soundex number

Find out the number of isomorphic numbers between 1 and N. A homogeneous number is a group of numbers: it appears to the right of the square number. For example: 5 is the number to the right of 25, 25 is 625 to the right, and 5 and 25 are isomorphic numbers. Detailed De

1. The easiest way to thinkWe can use the simplest way to find an array of arbitrary size of the number, that is, according to a sort of array of all the elements of the order, and then as needed to remove it, the knowledge of this way of time complexity and space complexity is relatively large, so, with the following way2. By setting two variables to make a judgmentThis way you can

Title Description: http://ac.jobdu.com/problem.php?pid=1371Enter n integers to find the smallest number of K. For example, enter 4,5,1,6,2,7,3,8 these 8 numbers, then the smallest 4 number is 1,2,3,4,.The first way of thinking:As in the previous question, using the division function in the quick sort, the dividing element is the final subscript index less than k,

One, the problem descriptionSuppose that given an ordered array of integers arr, and an integer k, Q K appears in the array several times?Second, solve the ideaThe ① array is ordered, so you can consider using two points to find② If you can find the index position of the first occurrence of K in the array first_index and the last occurrence of the index position Last_indexWe can know the

q, int a1[], long long int number) {if (P Three: tree-like arrayThe tree array solution is very difficult to understand, I have not understood, do not need to understand. Here is a code on the Internet:#include since the previous article Blog we know that any tree-like array can solve the problem, line tree can be solved, why not use line tree to solve it? Four: line segment treeThe idea of n Span style= "Color:rgb (54,46,43)", elements are also

Turn from: http://blog.csdn.net/newhappy2008/article/details/6857098 Question: There are n+2 number, n number appeared even several times, 2 numbers appear odd several times (these two numbers are not equal), ask the space complexity of O (1), find out these two numbers, do not need to know the exact location, just need to know these two values.Solution: If only

Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1] Output: 3Explanation: the first and digits or the last three digits is consecutive 1s. The maximum number of consecutive 1s is 3.note: The input array would be only contain and 0 1 . The length of input array is a positive integer and wou

# Pragma once # include # Include "moonmath. H" # include // Prime digit replacements // problem 51 // by replacing the 1st digit of * 3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime. /// by replacing the 3rd and 4th digits of 56 ** 3 with the same digit, this 5-digit number is the first example having seven Primes among the ten generated numbers, yielding the family: 56003,561 13, 56333,564 43, 566

There is a set of numbers, which reduce the number from 1 to n, and the order is also disordered. Put it in a n-1 array. Please find the missing number. Use 1 + 2 +... + N (that is, n (n + 1)/2) to subtract the sum of the current input data. The time complexity is O (n), and the space complexity is O (1). The disadvantage is that it is easy to overflow. T