Lunski's Clutter

Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.

Example:

1
2

Input: [0,1,0,3,12]
Output: [1,3,12,0,0]

Note:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.
   Read more »

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

Follow up: Could you implement a solution with a linear runtime complexity and without using extra memory?

Example 1:

1
2

Input: nums = [2,2,1]
Output: 1

Example 2:

1
2

Input: nums = [4,1,2,1,2]
Output: 4

Example 3:

1
2

Input: nums = [1]
Output: 1

Write a function that reverses a string. The input string is given as an array of characters char[].

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

You may assume all the characters consist of printable ascii characters.

Example 1:

1
2

Input: ["h","e","l","l","o"]
Output: ["o","l","l","e","h"]

Example 2:

1
2

Input: ["H","a","n","n","a","h"]
Output: ["h","a","n","n","a","H"]

這篇開始要跟大家分享我怎麼會想開始重訓的，因為受傷的關係一直很怕吃太多又不能做有氧，意外開始飲食控制與重訓的旅程。