Single Number（Java代码） Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you imp

Reverse Integer（Java代码） Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here are some g

Single Number II  （Java代码） Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime complexit

Search Insert Position  （Java代码） Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. Y