📝 字数：working on

Bid

Estimated time to read: 1 minute

Option

• as u8 转成ASCII
• x << n bitwise left shift A left shift by n position multiplies the number by 2^n, means x * 2^n
• & bitwise AND return both 1 in position.
• x ^= y XOR return 1 if exactly one of bits is 1, other 0; Then return the value to x;

Refs

• ASCII Table

评论