words to binary code translator

code: An integer that is converted into binary numbers according to the absolute size, called the original code.For example 00000000 00000000 00000000 00000101 is the original code of 5.Inverse code: The binary number is reversed by a bit, and the new

In the code of a group of numbers, if any two adjacent code is different from only one binary number, it is said that this code is gray code (gray code), gray code is composed of 0 and

type conversion (implicit type conversion)Auto-complete from small type to large typesuch as: int n = ' A ';Long L = ' A ';float, long, int, char/short2. Coercion of type conversions, from large types to small types that require castsForced type conversions are risky, resulting in loss of precision or overflowLong L = 1024l*1024*1024*4;//0x100000000int i = (int) l;//0Double pi = 3.1415926535897932384626;float f = (float) pi;Methods in 6.Java1 method is the function: Y=f (x) =3x+6;2 syntax of th

the smallest amount=============================================================================================================== ========================7. Whenever we talk about bits, we usually refer to a certain number of bits. The more bits we have, the more different possibilities we can express;8. In binary, the number of possible encodings is equal to the power of the whole number of 2, and its power exponent is the bit number of bits, and e

plus. This is a typical example of how to look at a low-dimensional space from a high-dimensional space and become more concise ." Let's use an actual example to illustrate how to use "high-dimensional view of low-dimensional ": In the example of clock analogy, We will slightly change the position of the complement code in the table, write it on the one-dimensional Digital axis, and then link the number axis to form a new "clock disc ". Let's try

June 8, 2015One of my favorite algorithm topics, two lines of code.Programming requires a strong logical thinking, ask a few why, can simplify. Think about it, two lines of code, five minutes can be done; 2015 online everyone hot Homebrew author Max Howell interviewGoogle hangs off a problem, binary tree inversion, seven lines of code, compared to two lines of

7 Mantra1, the binary highest bit is the sign bit 0 Positive 1 negative2, positive source code, anti-code , complement all the same3 Negative number of the original code back code complement (the sign bit unchanged, the other digits take the inverse 0->1 1->0)4 0 of the ant

Reference: Digital Image Processing (third edition) He Dongjian Xidian University Publishing houseThe operands in binary morphology are sets , but in the actual operation, when two sets are involved, they are not considered to be equal to each other. General set A is the image set, S is the structural element, the mathematical morphology operation is using S to a. The structure element itself is also an image collection, although it is usually much sm