# PS4-初音未来-歌姬计划 Future-Tone-完美心得

### 性价比

500多港币有200多首歌，而初音X F1 F2等，需要300多港币，只有30首歌左右。

# [PSV] √Letter-方根书简白金评价和感想

+优秀的人设。

+PSV上第一款中文文字游戏。

=好听但是略显单调的音乐。

-令人厌烦的地图探索系统。

-无法跳过的第八章。

-有一些奇怪的剧情。

## 杂谈

6月13号入的游戏，到7月21号白金花了一个月，不过真正认真玩的时间也就四天。

# [easy]Two Sum

## 难度: 简单 标题：Two Sum 求和

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.

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

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

### 链接

https://leetcode.com/problems/two-sum/

# [easy] Delete Node in a Linked List

## 难度: 简单 标题：Delete Node in a Linked List 删除链表的节点

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.

A->B->C->D

# [medium]Integer Break

## 难度: 中等 标题：整数拆分

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.

For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).

Note: You may assume that n is not less than 2 and not larger than 58.

Hint:

There is a simple O(n) solution to this problem.
You may check the breaking results of n ranging from 7 to 10 to discover the regularities.

### 链接

https://leetcode.com/problems/integer-break/