"Thank you," I said icily.
“谢谢你”,我冰冷的说道。

His eyes narrowed.
他眯着眼睛。

"You're welcome," he retorted.
“不客气,”他淡淡的回复道。

I straightened up swiftly, turned away from him again, and stalked off to Gym without looking back.
我笔直的快速离开,再一次离他远去,并且头也不回的昂首阔步去了体育馆。

Gym was brutal. We'd moved on to basketball.
体育馆是残忍的。我们开始学篮球了。

My team never passed me the ball, so that was good, but I fell down a lot.
我们的队员从来没有传球给我,这很不错,但是我跌倒了好几次。

Sometimes I took people with me.
有时还让别人也摔倒了。

Today I was worse than usual because my head was so filled with Edward.
今天我比以往更悲催,因为我脑袋里面充满了Eward

I tried to concentrate on my feet, but he kept creeping back into my thoughts just when I really needed my balance.
我尝试把我的注意力集中在我的脚上,但是他一直在我的想法里面游走,当我真的想要保持平衡的时候。

It was a relief, as always, to leave.
像往常一样,离开时一种解脱。

I almost ran to the truck; there were just so many people I wanted to avoid.
我几乎是跑着去了卡车,我想要避免那么多的人。

The truck had suffered only minimal damage in the accident.
在事故中卡车遭受到了最小的伤害。

I'd had to replace the taillights, and if I'd had a real paint job, I would have touched that up.
我不得不替换了尾灯,就算我确实有一些喷漆的工作要做,我也已经搞定了。

Tyler's parents had to sell their van for parts.
Tyler的父母不得不以零件的方式卖了他们的卡车。

I almost had a stroke when I rounded the corner and saw a tall, dark figure leaning against the side of my truck.
当我在转角时看到一个高大黑暗的身影在我卡车的对面时我震惊了。

Then I realized it was just Eric. I started walking again.
我意识到了那是Eric。我继续向前走。

"Hey, Eric," I called.
“你好,Eric”我说道

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

  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. 大数加法~HDU 1002 A + B Problem II

    题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1002 题意: 数学题,A+B; 思路,这个数非常大,普通加法一定会超时,所以用大数加法.大数加法的基 ...

  2. BZOJ.4160.[NEERC2009]Exclusive Access 2(状压DP Dilworth定理)

    BZOJ DAG中,根据\(Dilworth\)定理,有 \(最长反链=最小链覆盖\),也有 \(最长链=最小反链划分数-1\)(这个是指最短的最长链?并不是很确定=-=),即把所有点划分成最少的集合 ...

  3. 1095 A+B for Input-Output Practice (VII)

    一直presentation不对 ,看了别人的解释,还是不知道为什么最后还要\n http://acm.hdu.edu.cn/showproblem.php?pid=1095 #include< ...

  4. DevOps详解

    最近我阅读了很多有关DevOps的文章,其中一些非常有趣,然而一些内容也很欠考虑.貌似很多人越来越坚定地在DevOps与chef.puppet或Docker容器的熟练运用方面划了等号.对此我有不同看法 ...

  5. XML语言2.约束

    三.XML的约束 目的:编写一个文件用来约束另一个xml文件的书写规范. DTD 用来约束xml的文件格式,保证这个文件是有效的. 内部DTD:所有的约束都是直接定义在xml文件中的 内部的 DOCT ...

  6. swust oj 1013

    哈希表(开放定址法处理冲突) 1000(ms) 10000(kb) 2698 / 6177 采用除留余数法(H(key)=key %n)建立长度为n的哈希表,处理冲突用开放定址法的线性探测. 输入 第 ...

  7. [SQL]LeetCode197. 上升的温度 | Rising Temperature

    SQL架构 Create table If Not Exists Weather (Id int, RecordDate date, Temperature int) Truncate table W ...

  8. [Swift]LeetCode276. 粉刷栅栏 $ Paint Fence

    There is a fence with n posts, each post can be painted with one of the k colors. You have to paint ...

  9. [Swift]LeetCode575. 分糖果 | Distribute Candies

    Given an integer array with even length, where different numbers in this array represent different k ...

  10. [Swift]LeetCode700. 二叉搜索树中的搜索 | Search in a Binary Search Tree

    Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST ...