Nicksxs's Blog

leetcode no.3

发表于 2015-04-15 更新于 2020-01-12 分类于 leetcode 阅读次数： Disqus：

**Longest Substring Without Repeating Characters **

add-two-number

发表于 2015-04-14 更新于 2020-01-12 分类于 leetcode 阅读次数： Disqus：

problem

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Input:(2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

分析（不用英文装逼了）
这个代码是抄来的，链接原作是这位大大。

阅读全文 »

Reverse Integer

发表于 2015-03-13 更新于 2020-01-12 分类于 leetcode 阅读次数： Disqus：

Reverse Integer

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

阅读全文 »

Reverse Bits

发表于 2015-03-11 更新于 2020-01-12 分类于 leetcode 阅读次数： Disqus：

Reverse Bits

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110000010100101000000).

阅读全文 »

Number of 1 Bits

发表于 2015-03-11 更新于 2020-01-12 分类于 leetcode 阅读次数： Disqus：

Number of 1 Bits

Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight). For example, the 32-bit integer ‘11’ has binary representation `00000000000000000000000000001011`, so the function should return 3.

阅读全文 »

problem

Reverse digits of an integer.

Reverse bits of a given 32 bits unsigned integer.

Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight). For example, the 32-bit integer ‘11’ has binary representation 00000000000000000000000000001011, so the function should return 3.

Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight). For example, the 32-bit integer ‘11’ has binary representation `00000000000000000000000000001011`, so the function should return 3.