计算机lemon乐谱,Lemon吉他谱(PDF谱)_米津玄师(米津玄師 / hachi / ハチ / Yonezu Kenshi)...

Lemon

See through in the sunlight

She wore lemon

But never in the daylight

She's gonna make you cry

She's gonna make you whisper and moan

And when you're dry

She draws her water from the stone

And I feel

Like I'm slowly, slowly,

slowly slipping under

And I feel

Like I'm holding onto nothing

She wore lemon

To colour in the cold grey night

She had heaven

And she held on so tight

A man makes a picture

A moving picture

Through the light projected

He can see himself up close

A man captures colour

A man likes to stare

He turns his money into light to look for her

And I feel

Like I'm drifting, drifting,

drifting from the shore

And I feel

Like I'm swimming out to her

Midnight is where the day begins

Midnight is where the day begins

Midnight is where the day begins

Lemon

See through in the sunlight

A man builds a city

With banks and cathedrals

A man melts the sand so he can

See the world outside

You're gonna meet her there

A man makes a car She's your destination

And builds roads to run them on

You gotta get to her

A man dreams of leaving

She's imagination

But he always stays behind

And these are the days

When our work has come assunder

And these are the days

When we look for something other

Midnight is where the day begins

[Repeat 4 times]

[Instrumental]

Midnight is where the day begins

[Repeat 4 times]

A man makes a picture

A moving picture

Through the light projected

He can see himself up close

You're gonna meet her there

A man captures colour

She's your destination

A man likes to stare

There's no sleeping there

He turns his money into light She's imagination

To look for her Lemon

She is the dreamer

She's imagination

She had heaven

Through the light projected

He can see himself up close

She wore lemon

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
好的,下面是一个简单的乐库个人管理系统的实现,包括增加音乐、删除音乐、修改音乐信息、散列查找和以年份排序的功能。这里使用了哈希表来实现散列查找,使用快速排序来实现年份排序。 ```c++ #include <iostream> #include <cstring> #include <vector> #include <algorithm> using namespace std; // 歌曲类 class Song { public: int id; // 歌曲编号 string name; // 歌曲名称 string artist; // 歌手名称 string album; // 专辑名称 int year; // 发行年份 Song() {} Song(int _id, string _name, string _artist, string _album, int _year) : id(_id), name(_name), artist(_artist), album(_album), year(_year) {} }; // 哈希表类 class HashTable { private: static const int MAXN = 10003; // 哈希表最大容量 vector<Song> table[MAXN]; // 哈希表数组 int hash(string s) { // 哈希函数,将字符串映射为整数 int ans = 0; for (int i = 0; i < s.length(); i++) { ans = ans * 131 + s[i]; } return ans; } public: void insert(Song s) { // 插入操作,将歌曲加入哈希表 int index = (hash(s.name) + hash(s.artist) + hash(s.album)) % MAXN; table[index].push_back(s); } void remove(Song s) { // 删除操作,将歌曲从哈希表中移除 int index = (hash(s.name) + hash(s.artist) + hash(s.album)) % MAXN; for (int i = 0; i < table[index].size(); i++) { if (table[index][i].id == s.id) { table[index].erase(table[index].begin() + i); break; } } } vector<Song> find(string name) { // 查找操作,根据歌曲名返回所有匹配的歌曲 int index = hash(name) % MAXN; vector<Song> ans; for (int i = 0; i < table[index].size(); i++) { if (table[index][i].name == name) { ans.push_back(table[index][i]); } } return ans; } }; // 年份排序类 class YearSorter { public: bool operator()(const Song& s1, const Song& s2) { return s1.year < s2.year; } }; int main() { HashTable hashTable; // 创建哈希表 vector<Song> songs; // 创建歌曲数组 int id = 0; // 当前歌曲编号 // 添加歌曲 songs.push_back(Song(++id, "Lemon", "米津玄", "Lemon", 2018)); songs.push_back(Song(++id, "打上花火", "DAOKO×米津玄", "打上花火", 2017)); songs.push_back(Song(++id, "愛をこめて花束を", "Superfly", "愛をこめて花束を", 2008)); songs.push_back(Song(++id, "I Love You", "尾崎豊", "I Love You", 1991)); songs.push_back(Song(++id, "Lovers", "7!!", "Lovers", 2015)); // 将歌曲加入哈希表 for (int i = 0; i < songs.size(); i++) { hashTable.insert(songs[i]); } // 删除歌曲 hashTable.remove(songs[0]); // 修改歌曲信息 songs[1].year = 2018; hashTable.remove(songs[1]); hashTable.insert(songs[1]); // 查找歌曲 vector<Song> results = hashTable.find("Lovers"); for (int i = 0; i < results.size(); i++) { cout << results[i].name << " - " << results[i].artist << endl; } // 年份排序 sort(songs.begin(), songs.end(), YearSorter()); for (int i = 0; i < songs.size(); i++) { cout << songs[i].name << " - " << songs[i].artist << " (" << songs[i].year << ")" << endl; } return 0; } ``` 以上是一个简单的乐库个人管理系统的实现,其中使用了哈希表来实现散列查找和快速删除,使用快速排序来实现年份排序。这只是一个简单的示例,如果你需要更加复杂的功能和需求,你需要根据具体情况来进行实现。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值