I drove around the school, following the line of traffic.

我开车绕学校随着交通线。

我开车穿过校园,紧跟着大部队。

I was glad to see that most of the cars were older like mine, nothing flashy.

我很高兴看见大多数的车都像我的一样老旧,没有光亮。

一点儿也不浮华

At home I'd lived in one of the few lower-income neighborhoods that were included in the Paradise Valley District.

在家的时候我住在PVD几个低收入邻居的旁边。

在凤凰城我住在少数几个由天堂谷区辖管的低收入区里。

It was a common thing to see a new Mercedes or Porsche in the student lot.

一个新的M或者P在学生之中是非常常见的。

但在学生堆里看到一辆奔驰或是保时捷是件寻常事

The nicest car here was a shinyVolvo, and it stood out. Still, I cut the engine as soon as I was in a spot, so that the thunderous volume wouldn't draw attention to me.

这里最美的车就是一辆shinyVolvo了,它确实很出众。我仍然尽力的减少引擎的响声,以至于引擎雷声一般的声音,别人不会注意到我。

而在这里,最好的车是一辆闪闪发光的沃尔沃,它显得格外突出。我在陷入窘境以前迅速地关掉了引擎,防止它雷鸣般的轰鸣给我招来太多关注。

I looked at the map in the truck, trying to memorize it now; hopefully I wouldn't have to walk around with it stuck in front of my nose all day.

我在卡车中看着那个地图,尝试现在立即记住它,希望我不会必须一直被别人牵着鼻子走。

我可不想一整天都把它展在鼻子底下走路。

I stuffed everything in my bag, slung the strap over my shoulder, and sucked in a huge breath.

我肩膀背着所有的东西在我的包里,然后深吸一口气。

I can do this, I lied to myself feebly. No one was going to bite me. I finally exhaled and stepped out of the truck.

我能做到的,我骗自己。没人会帮助我的,我最终喘气的走出卡车。

我能做到的,我对自己说着苍白无力的谎言。没有人正等着咬我一口。

I kept my face pulled back into my hood as I walked to the sidewalk,crowded with teenagers.

我让我的脸埋在头巾之中,我走到了年轻人的人群之中。

My plain black jacket didn't stand out, I noticed with relief.

我的黑色夹克不显眼,我就放心了。

我把脸隐藏在兜帽下,走向挤满了少男少女的人行道。我式样简洁的黑夹克在人群里一点儿也不突出,这让我感到欣慰。

Chapter 1 First Sight——16的更多相关文章

  1. Chapter 2 Open Book——16

    By Friday I was perfectly comfortable entering my Biology class, nolonger worried that Edward would ...

  2. Chapter 1 First Sight——37

    "Never mind, then," he said hastily in a voice like velvet. 别介意,他用天鹅绒般的声音急切的说道 "I can ...

  3. Chapter 1 First Sight——36

    The door opened again, and the cold wind suddenly gusted through the room, rustling the papers on th ...

  4. Chapter 1 First Sight——35

    The final bell rang at last. I walked slowly to the office to return my paperwork. 最后下课铃响了.我走到了办公室上讲 ...

  5. Chapter 1 First Sight——34

    "Was that the boy I sat next to in Biology?" I asked artlessly. 你是生物课坐在我旁边的男生吗?我天真烂漫的问道. & ...

  6. Chapter 1 First Sight——33

    At that moment, the bell rang loudly, making me jump, and Edward Cullen was out of his seat. 在这个时候,铃 ...

  7. Chapter 1 First Sight——32

    The class seemed to drag on longer than the others. 这堂课看起来比别的课要长. Was it because the day was finally ...

  8. Chapter 1 First Sight——31

    I took notes carefully anyway, always looking down. 不论怎么样我都仔细的记着笔记,一直低着头. I couldn't stop myself fro ...

  9. Chapter 1 First Sight——30

    The girl sitting there giggled. I'd noticed that his eyes were black — coal black. 那个坐在那里的女孩笑着.我注意到她 ...

随机推荐

  1. iOS 计算两个坐标之间的距离

    //第一个坐标 CLLocation *before=[[CLLocation alloc] initWithLatitude:29.553968 longitude:106.538872]; //第 ...

  2. Alyona and flowers

    Alyona and flowers time limit per test 2 seconds memory limit per test 256 megabytes input standard ...

  3. python paramiko模拟ssh登录,实现sftp上传或者下载文件

    Python Paramiko模块的安装与使用详解 paramiko是短链接,不是持续链接,只能执行你设定的shell命令,可以加分号执行两次命令. http://www.111cn.net/phpe ...

  4. hive学习之WordCount单词统计

    看hive目录下就可以了,程序在hdfs里创建一个hive的大文件夹,相当于数据库吧.上面就是一个完整的利用hive来做单词统计,其中的优劣也能看出一点.

  5. CodeForces 754C Vladik and chat (DP+暴力)

    题意:给定n个人的m个对话,问能不能找一个方式使得满足,上下楼层人名不同,并且自己不提及自己. 析:首先预处理每一层能有多少个user可选,dp[i][j] 表示第 i 层是不是可以选第 j 个use ...

  6. QTP连接MySQL

    1.首先安装mysql数据驱动,qtp在windows系统下操作连接mysql,所以下载mysql-connector-odbc-   5.1.8-win32.msi 下载地址:http://mysq ...

  7. Ubuntu 14.04 Nvidia显卡驱动手动安装及设置

      更换主板修复grub 引导后,无法从Nvidia进入系统(光标闪烁), 可能是显卡驱动出了问题. 1. 进入BIOS设置, 从集成显卡进入系统 将显示器连接到集显的VGI口, 并在BIOS中设置用 ...

  8. C#窗口实现最小化到系统托盘

    using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; usin ...

  9. curl 测试web站点的响应时间

    curl -s -w "\n"::%{time_namelookup}::%{time_connect}::%{time_starttransfer}::%{time_total} ...

  10. 【sort】 基数排序

    下面这段问答摘自csdn: 把基数排序说成桶排序应该是没有太大问题的.总的说来,应该把这一类归为分配排序,由于分配排序的一些缺陷,主要是时间代价很差,改进成为桶式排序(bucket sort),而桶排 ...