归档 2017

题目描述：

LeetCode 481. Magical String

A magical string S consists of only '1' and '2' and obeys the following rules:

The string S is magical because concatenating the number of contiguous occurrences of characters '1' and '2' generates the string ...

题目描述：

LeetCode 476. Number Complement

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

Note:

1. The given integer is guaranteed to fit within the range of a 32-bit signed ...

题目描述：

LeetCode 479. Largest Palindrome Product

Find the largest palindrome made from the product of two n-digit numbers.

Since the result could be very large, you should return the largest palindrome mod 1337.

Example:

Input: 2

Output: 987

Explanation: 99 ...

利用python-requests（http://www.python-requests.org/），只需数行代码即可实现短网址还原。

通过HTTP HEAD请求，从返回响应的头信息（headers）中取出Location字段即为短网址对应的原始网址。

Python代码：

import requests
def revertShortLink(url):
    res = requests.head(url)
    return res.headers.get('location')

代码测试：

print revertShortLink('http://t.cn/RVMAn7W')

返回结果：

https://bookshadow.com/weblog/2016/10/15/leetcode-maximum-xor-of-two-numbers-in-an-array/#0-tsina-1-85154-397232819ff9a47a7b7e80a40613cfe1