# VonSdite/GetLeetcodeQuestion

Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.
css
img
js
manifest.json

# GetLeetcodeQuestion

## 环境

• Chrome插件(仅适用Chrome内核的浏览器, 比如Chrome、360、QQ浏览器等)

## 使用

1. 使用命令`git`clone本项目
``````git clone https://github.com/VonSdite/GetLeetcodeQuestion.git
``````
1. 打开Chrome浏览器的扩展程序(点击Chrome浏览器右上角设置 - 更多工具 - 扩展程序(E))

2. 点击加载已解压的扩展程序, 选择本项目即可

## 演示

### 复制的html代码

```[Two Sum - LeetCode](https://leetcode.com/problems/two-sum/)
<div style="margin:1em 0;font-size:13px;"><div><p>Given an array of integers, return <strong>indices</strong> of the two numbers such that they add up to a specific target.</p>

<p>You may assume that each input would have <strong><em>exactly</em></strong> one solution, and you may not use the <em>same</em> element twice.</p>

<p><strong>Example:</strong></p>

Because nums[<strong>0</strong>] + nums[<strong>1</strong>] = 2 + 7 = 9,
return [<strong>0</strong>, <strong>1</strong>].
</pre>

<p>&nbsp;</p>
</div></div>```
markdown中的效果

Two Sum - LeetCode

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

```Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
```

1. html标签的`class`均被替换为原来的css样式
2. `<pre>`标签额外添加了它的css样式