## leetcode Wiggle Sort II

### leetcode Wiggle Sort II

Given an unsorted array `nums`, reorder it such that `nums < nums > nums < nums...`.

Example:
(1) Given `nums = [1, 5, 1, 1, 6, 4]`, one possible answer is `[1, 4, 1, 5, 1, 6]`.
(2) Given `nums = [1, 3, 2, 2, 3, 1]`, one possible answer is `[2, 3, 1, 3, 1, 2]`.

Note:
You may assume all input has valid answer.

Can you do it in O(n) time and/or in-place with O(1) extra space?

## leetcode Coin Change

### leetcode Coin Change

You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return `-1`.

Example 1:
coins = `[1, 2, 5]`, amount = `11`
return `3` (11 = 5 + 5 + 1)

Example 2:
coins = ``, amount = `3`
return `-1`.

Note:
You may assume that you have an infinite number of each kind of coin.

## Github student pack 申请

• digitalocean vps 50\$ (之前貌似是100 ,博主一年VPS不用钱了~)
• 5个github 私有仓库
• 等等

## leetcode Create Maximum Number

### leetcode Create Maximum Number

Given two arrays of length `m` and `n` with digits `0-9` representing two numbers. Create the maximum number of length `k <= m + n` from digits of the two. The relative order of the digits from the same array must be preserved. Return an array of the `k` digits. You should try to optimize your time and space complexity.

Example 1:

nums1 = `[3, 4, 6, 5]`
nums2 = `[9, 1, 2, 5, 8, 3]`
k = `5`
return `[9, 8, 6, 5, 3]`

Example 2:

nums1 = `[6, 7]`
nums2 = `[6, 0, 4]`
k = `5`
return `[6, 7, 6, 0, 4]`

Example 3:

nums1 = `[3, 9]`
nums2 = `[8, 9]`
k = `3`
return `[9, 8, 9]`

## digitalocean 下 centos 搭建 wordpress过程

• centos下安装wordpress过程
• 开启mod_rewrite模块
• 开启GZIP压缩网页
• 上传图片/文件失败解决办法
• YOAST SEO  sitemap 404 解决办法

## leetcode Bulb Switcher

### leetcode Bulb Switcher

There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning off if it’s on). For the nth round, you only toggle the last bulb. Find how many bulbs are on after n rounds.

Example:

Given n = 3.

At first, the three bulbs are [off, off, off].

After first round, the three bulbs are [on, on, on].

After second round, the three bulbs are [on, off, on].

After third round, the three bulbs are [on, off, off].

So you should return 1, because there is only one bulb is on.

## 写在前面

• WEB开发的时候，你会更加的规范
• 知识上的扩充
• 让过多人看到你的博客站点