"I don't know what you mean," I said, my voice guarded.

“我不知道你什么意思”我声音谨慎地说道。

"It's better if we're not friends," he explained. "Trust me."

“如果我们不是朋友更好”他解释道“相信我”

My eyes narrowed. I'd heard that before.

我眯了眯我的眼睛。我曾经听到过这样的话。

"It's too bad you didn't figure that out earlier," I hissed through my teeth. "You could have saved yourself all this regret."

“你没有早点发现这件事真的悲哀”我从牙齿中挤出这几句。“你本来可以把自己从这种后悔中拯救出来的。”

"Regret?" The word, and my tone, obviously caught him off guard. "Regret for what?"

“后悔?”这个字眼,还有我的语气,显然让他失去了警惕心。“后悔什么?”

"For not just letting that stupid van squish me."

“没有让那傻瓜的卡车压扁我”

He was astonished. He stared at me in disbelief.

他很惊讶。难以置信的盯着我。

When he finally spoke, he almost sounded mad. "You think I regret saving your life?"

最后他几乎愤怒的说道“你认为我救了你的命我会遗憾?”

"I know you do," I snapped.

“我认为你会的”我嚷嚷道。

"You don't know anything." He was definitely mad.

“你什么都不知道”他已经完全生气了。

I turned my head sharply away from him, clenching my jaw against all the wild accusations I wanted to hurl at him.

我马上把我的头转开,磨着我的牙齿让野蛮的感觉不让我辱骂他。

I gathered my books together, then stood and walked to the door.

我把书叠到一起,然后站起来走出了门。

I meant to sweep dramatically out of the room, but of course I caught the toe of my boot on the door jamb and dropped my books.

我想要快速的走出门去,但是我的鞋子撞到了门框然后书掉了。

I stood there for a moment, thinking about leaving them.

我在那站了一会,考虑要不要不管它了。

Then I sighed and bent to pick them up. He was there; he'd already stacked them into a pile.

叹了口气还是弯腰捡了起来。他在那里已经把书堆成了一堆。

He handed them to me, his face hard.

他把书递给我,脸上还是冷冰冰的。

Chapter 4 Invitations——12的更多相关文章

  1. Chapter 4 Invitations——28

    "Oh, thanks, now that's all cleared up." Heavy sarcasm. “哦,真感谢,现在一切都清楚了.” 我很讽刺的说道 I realiz ...

  2. Chapter 4 Invitations——27

    "Myself, obviously." He enunciated every syllable, as if he were talking to someone mental ...

  3. Chapter 4 Invitations——26

    "I wanted to ask you something, but you sidetracked me," he chuckled. He seemed to have re ...

  4. Chapter 4 Invitations——25

    "So you are trying to irritate me to death? Since Tyler's van didn't do the job?" "所以 ...

  5. Chapter 4 Invitations——24

    "How do you do that?" I asked in amazed irritation. “你是怎么做到的?”我惊讶的问道. "Do what?" ...

  6. Chapter 4 Invitations——23

    The next morning, when I pulled into the parking lot, I deliberately parked as far as possible from ...

  7. Chapter 4 Invitations——22

    "Are you going all by yourself?" he asked, and I couldn't tell if he was suspicious I had ...

  8. Chapter 4 Invitations——21

    "Dad?" I asked when he was almost done. “爸?”我当他快吃完的时候问道. "Yeah, Bella?" “怎么了,Bel ...

  9. Chapter 4 Invitations——20

    Well, that was fine. I could leave him alone. 行吧,但愿一切都好.我能让他一个人. I would leave him alone. 我也会让他一个人的. ...

随机推荐

  1. Win Server 2003 10条小技巧

    微软推出Windows Server 2003已经有一段时间了,但是,由于它是一个面向企业用户的服务器操作系统,所以,没有引起更多个人用户的注意.实际上,简单地改变一下系统的设置,您也可以将Windo ...

  2. BZOJ 3864

    dp of dp 我就是来贴个代码 #include<bits/stdc++.h> using namespace std; #define rep(i,a,b) for(int i=(a ...

  3. 字符串转义为HTML

    有时候后台返回的数据中有字符串,并需要将字符串转化为HTML,下面封装了一个方法,如下 // html转义 function htmlspecialchars_decode(string, quote ...

  4. CentOS 7.3/Linux .net core sdk 安装

    执行下列命令,安装.NET Core SDK(微软官方教程地址 https://www.microsoft.com/net/learn/get-started/linuxcentos) 点开链接,选择 ...

  5. 依赖注入[4]: 创建一个简易版的DI框架[上篇]

    本系列文章旨在剖析.NET Core的依赖注入框架的实现原理,到目前为止我们通过三篇文章(<控制反转>.<基于IoC的设计模式>和< 依赖注入模式>)从纯理论的角度 ...

  6. travis-ci 中运行 puppeteer

    通过 travis-ci 可以构建基于 puppeteer 的自动化任务,基于此构建的一个 计划任务 puppeteer中调用需要禁用沙箱环境 https://github.com/GoogleChr ...

  7. 二叉查找树(BST)的实现

    一.二叉树介绍 二叉查找树(Binary Search Tree,BST),又称二叉排序树,也称二叉搜索树,它或者是一颗空树,或者具有如下性质的树:若它的左子树不为空,则左子树上所有节点的值都小于根节 ...

  8. 堆排序应用之topK问题

    题目:求海量数据(正整数)按逆序排列的前k个数(topK),因为数据量太大,不能全部存储在内存中,只能一个一个地从磁盘或者网络上读取数据,请设计一个高效的算法来解决这个问题. 第一行用户输入K,代表要 ...

  9. [SQL]LeetCode262.行程和用户 | Trips and Users

    SQL架构 Create table If Not Exists Trips (Id )) Create table If Not Exists Users (Users_Id ), Role ENU ...

  10. [Swift]LeetCode671. 二叉树中第二小的节点 | Second Minimum Node In a Binary Tree

    Given a non-empty special binary tree consisting of nodes with the non-negative value, where each no ...