|
t**********p
发帖数: 2672 | 2 Apparently someone attempted to hike to Triplet Rocks solo on Saturday after
reading Ze's report and hasn't returned. let's hope he's somehow managed to
survive 2 nights and they find him. Also, please don't try this hike alone
or if you aren't prepared for navigation difficulty.
http://altadena.patch.com/articles/local-search-and-rescue-teams-looking-for-lost-hiker
========================
Local search and rescue teams are looking for a lost hiker in the Angeles
National Forest, said Lt. Angela... 阅读全帖 |
|
b**********g
发帖数: 460 | 3 There are 8 possible coin flip triplets. Here they all are, with H as
"Heads" and T as "Tails":
HHH HTH HHT HTT
THH TTH THT TTT
Pick any triplet and I'll pick a different one. We'll flip a fair coin
until one of these triplets occurs. Also, to sweeten the deal, I'll give
you 3 to 2 odds, meaning that if you win you'll get $3 and if I win I'll
only $2 (just pretending). Would you want to play? Why or why not?
This is a question from my son's 6th grade statistics class. |
|
k*********r
发帖数: 758 | 4
nod, 这种画风给整个电影刷上了一层阴冷的色彩，包括那种夸张的
陡坡，都会给观众带来一种心理压力，不过也许正因为如此，
天平那头的老太太沉着坚定的形象就显得格外亲切而令人感动。也正是因为这个
老太太...和那条狗，triplet给我带来的印象不是那个阴冷的世界，而是阴冷的
世界中人对人的关爱。hehe.
以前DOTANN说看完BIG FISH后想给老爹老妈打个电话，我觉得triplet也有这个
功能，尤其是看到最后to my parents的时候。
电影里面有两点我觉得特别逗，一个是那条狗做的两个梦，一个是纽约(belleville)
街头肥肥的美国人。
这个triplet今年有两个提名，动画片和最佳歌曲，不知道能不能搞定一个。
我觉得这个片子比较打动我的地方就是直接把伤疤揭开来看，没有
任何的惺惺作态。你从中看出积极的方面来也是理解角度的不同吧。 |
|
x********u
发帖数: 18 | 5 发信人: xiaoheizhu (cheer up), 信区: Chemistry
标 题: 荧光:triplet寿命，quantum efficiency和荧光光谱峰形的关系是什么?
发信站: The unknown SPACE (Thu Oct 17 20:02:17 2002) WWW-POST
triplet寿命，quantum efficiency对1光谱有什么影响?
比如10微秒 0.001for bleaching |
|
b*****u
发帖数: 648 | 6 原题在
https://www.hackerrank.com/challenges/triplets
There is an integer array d which does not contain more than two elements of
the same value. How many distinct ascending triples (d[i] < d[j] < d[k], i
< j < k) are present?
一开始我用了三重循环，每层用map来去重。结果小case过了，大case超时。
想了下用DP, 两个数组，第一个A[i]存储左边比 d[i]小的个数，第二个B[i]存储右边
比d[i]大的个数，这样如果不考虑重复的话就是 sum of A[i]*B[i]，但是重复的情况
太难搞了 |
|
|
t**********p
发帖数: 2672 | 8 Well, first of all, Triplet Rocks isn't THAT dangerous, nothing like
climbing K2 or Mt Everest - there are risks, but I tried my best to minimize
the risk from accidents.
I agree this is one aspect of Chinee culture, that they consider the
concerns of friends and family, but it doesn't mean people that is doing the
adventure doesn't, but they just consider the risks and concerns and making
a trade off over it. Of course this trade off also depends on how much you
value your individual freedom a... 阅读全帖 |
|
p**r
发帖数: 109 | 9 几年来看过的动画片几乎都是迪斯尼和梦工厂的作品，每一部都是一如既往地充满了大场
面，丰富的层次感，多变的镜头角度，大明星的配音，虽然其中不乏好片，看过了太多的
这种几乎同出一辙的画面之后不免会生出些厌倦来。The Triplets of Belleville的出现
无疑是让人眼前一亮：原来动画片还可以这样拍而且拍得有看头。
影片的一开头刻意做成3，40年代的动画片的效果，黑白的画面，简练而夸张的线条，老
唱片般的音效，让人联想起深夜里有些频道里面放的老式动画片。紧接着时间推移到几十
年后，色彩开始出现，人物的造型和动态也变得相对精细起来，但是仍然朴素到了让人怀
疑这部电影会不会从此处开始就变得枯燥下去。所有的担心都是多余的，即使在前面5分
钟里面还没有展开任何情节的时候你就会被其中生动的细节深深吸引住，比如那条叫Brun
o的狗，喜欢准时扭动肥胖的身躯跑到楼上去对着经过的列车咆哮一番然后满足地回来继
续向主人讨食，还有老祖母一边照顾孙子吃晚饭一边用令人吃惊的熟练动作在饭桌上调自
行车钢圈... 随着情节的发展编剧以极为不同寻常的想象力展现出一幕又一幕出人意料的
小插曲，为了避免让大家看 |
|
O*********h
发帖数: 4674 | 10 这个triplet怎么弄
就是买一个相机买三个镜头，每个减150? |
|
a***r
发帖数: 146 | 11 On Tuesday, March 27, a Fermilab-built quadrupole magnet, one of an “inner
triplet” of three focusing magnets, failed a high-pressure test at Point 5
in the tunnel of the LHC accelerator at CERN. Since Tuesday, teams at CERN
and Fermilab have worked closely together to address the problem and have
identified the cause of the failure. Now they are at work on a solution.
The asymmetric force generated by the pressure of the test broke the
supports in magnet Q1 that hold the magnet’s cold mass insi |
|
l**********n
发帖数: 72 | 12 From Heisenberg uncertainty principle, you could do an order of magnitude
estimation. The linewidth should be around 10 kHz. The quantum efficency is
basically how much you get vs. how much you pump.
So, the triplet life time determines the natural linewidth and the quantum
efficiency gives you the comparable peak value of the absorption spectrum. |
|
g*****s
发帖数: 157 | 13 IMHO, I can't see any resemblence between triplets and disney style of cartoon,
it's relaly tribute to early cartoons such as 19th century drawings
1930's Fleischer brothers or tex avery 's work.
one interesting piece that's often precedent to the showing of this movie
is the collaboration of Dali and Disney. "Destino", it's dreamy, strangely
beautiful. |
|
k*********r
发帖数: 758 | 14 whicih movie is sad? triplets? It's not sad a ... |
|
a*****e
发帖数: 1700 | 15
同意是奶奶，我把 son 改成 boy 了，而 mama = 嬷嬷, hehehe
但是我不同意这个 triplet 就不孤独了。影片对此着笔很重，比
如那个院子里面骑车的情节，比如那个被桥挤歪了的家，比如那
餐晚饭。
其实最彰显主题的是它的画风，阴冷的，夸张的形体，没有任何
人情味的建筑，高高在上的轮船，都非常贴切。
我觉得这个片子比较打动我的地方就是直接把伤疤揭开来看，没有
任何的惺惺作态。你从中看出积极的方面来也是理解角度的不同吧。 |
|
b****n
发帖数: 865 | 16 Two best films of the year mostly ignored at Oscar.
Triplets should win best Animation and best song.
COG should win best cinematography and best foreign film (it's not even
nominated) and probably best director (but it's Peter Jackson's day of glory). |
|
d********w
发帖数: 363 | 17 扩展到n个数，
set> sol(float increment, int dim) {
set> triplets;
sol(1, increment, dim, new vector(), triplets);
return triplets;
}
void sol(float total, float increment, int dim, vector triplet, set<
vector> triplets) {
if (dim == 0) {
triplets.insert(triplet);
return ;
}
for (int i =0; i <= total; i+= increment) {
triplet.append(i);
sol(total - i, increment, dim -1, triplet, triplets);
... 阅读全帖 |
|
d********w
发帖数: 363 | 18 嗯，我写个2层循环的，你写个递归的吧;)
set> sol(float increment)
{
if (increment <=0 )
return null;
int res = (int)(1/increment);
if (abs(res * increment -1 ) > 0.000001)
return null;
set> triplets;
vector triplet(3);
for (int i =0; i <= 1; i+= increment) {
int total_left = 1 - i;
triplet[0] = i;
for (int j=0; j<=total_left; j+=increment) {
triplet[1] = j;
triplet[2] = tot... 阅读全帖 |
|
g******n
发帖数: 10 | 19 这题可以在循环内手动去重，也可以把 triplets 存到 hash set 里自动去重，函数返
回时再转回 list。前者代码略显啰嗦但时间复杂度最坏是 O(n^2)，后者代码更简洁但
时间复杂度更高，平均情况 O(n^2)，最坏情况 O(n^4)（例如共有 O(n^2) 个
triplets，全部被 hash 到同一个 bucket，每次插入都是 O(n^2)，所以总的时间复杂
度是 O(n^4)）。C++ 可以用 hash set 也可以先统一把 triplets 存到 vector<
vector> 里，然后 sort + unique + erase / resize 搞定。但是 C++ 这两种方
法都会超时，必须手动去重，Java 和 Python 用 hash set 都能过 OJ。
--------------------------------------------------------------------------
Java 版代码如下：
public class Solution {
public List>... 阅读全帖 |
|
z*********n
发帖数: 1451 | 20
有纯integer logN时间，O(1)空间(归递开销不算的话）解法。几年前写的：
struct triplet{
int a, b, c;
triplet(int i, int j, int k):a(i), b(j), c(k){}
};
triplet trifabonacci(int n)
{
if (n <= 0)
return triplet (0, 0, 0);
if (n <= 2)
return triplet (1, 1, 0);
triplet pre = trifabonacci((n + 1) / 2);
int cur_0 = (2 * pre.b + pre.a) * pre.a;
int cur_1 = pre.a * pre.a + pre.b * pre.b;
int cur_2 = (2 * pre.c + pre.b) * pre.b;
int cur_3 = pre.c * pre.c + pre.b * pre.b;
if ... 阅读全帖 |
|
wh
发帖数: 141625 | 21 赞美妈妈。
还有更多的：
List of people with the most children
# Children Mother/Couple Notes
69 Mrs. and Mr. Feodor Vassilyev (1st wife) Vassilyev and his first
wife, whose name is unknown, holds the record for most children a couple has
parented. She gave birth to a total of 69 children. She gave birth to 16
pairs of twins, 7 sets of triplets and 4 sets of quadruplets between 1725
and 1765, in a total of 27 births. 67 of the 69 children born were said to
have survived infancy.
57 Mrs. ... 阅读全帖 |
|
wh
发帖数: 141625 | 22 赞美妈妈。
还有更多的：
List of people with the most children
# Children Mother/Couple Notes
69 Mrs. and Mr. Feodor Vassilyev (1st wife) Vassilyev and his first
wife, whose name is unknown, holds the record for most children a couple has
parented. She gave birth to a total of 69 children. She gave birth to 16
pairs of twins, 7 sets of triplets and 4 sets of quadruplets between 1725
and 1765, in a total of 27 births. 67 of the 69 children born were said to
have survived infancy.
57 Mrs. ... 阅读全帖 |
|
t**********r
发帖数: 2153 | 23 这个是过了OJ的code.为了不超时,加了点tweak.看起来没有以前那么好看了.
public static ArrayList> threeSum(int[] inputs) {
if (inputs == null || inputs.length <= 2) {
// throw new IllegalArgumentException("Invalid inputs");
return new ArrayList>();
}
Arrays.sort(inputs);
Set> matchedTriplets = new HashSet
Integer>>();
for (int i = 0; i < inputs.length - 2; i++) {
if (inputs[i] > 0... 阅读全帖 |
|
Z***A
发帖数: 33 | 24 写了3sum的solution，但是没通过OJ large judge，Run Status: Time Limit
Exceeded，请分析一下原因。
下面是code：
public ArrayList> threeSum(int[] num) {
// Start typing your Java solution below
// DO NOT write main() function
if (num.length < 3)
return new ArrayList>();
Arrays.sort(num);
ArrayList> res = new ArrayList
>();
for (int i=0; i < num.length; i++)
{
... 阅读全帖 |
|
w********s
发帖数: 1570 | 25 频率统计法
ABCDEF，每次triplet XYZ
记录X的频率，Y的频率，Z的频率
X可能包含了ABCD，A出现的频率是10/20,B:6/20,C:3/20,D:1/20
ABCD如果都相同，那么就是20
ABCD如果其中2个字母相同，就是16，13，11，9，7，4
3个字母相同，结果是19,14,10,17
都不相同就是10,6,3,1
注意10可能是abbb或者abcd，那么用Y的频率来判断哪种情况。
std::string triplet()
{
static std::string password = "google";
std::set digits;
while (digits.size() < 3)
{
int d = rand() % 6;
digits.insert(d);
}
std::string result;
for (std::set::const_iterator it = digits.begin(); it != digits.end
... 阅读全帖 |
|
g**o
发帖数: 3033 | 26 其它更长的triplet就会有你说的那个问题，一下从8th note feel 换到 triplet feel。
比如
1& 2& 3& 4-trip-let (8th note triplet)
1& 2& tri - p - let (quater note triplet)
1& 2& 3& 4-trip-let &-trip-let(16th triplet still has the pulse of 8th notes) |
|
g**o
发帖数: 3033 | 27 其它更长的triplet就会有你说的那个问题，一下从8th note feel 换到 triplet feel。
比如
1& 2& 3& 4-trip-let (8th note triplet)
1& 2& tri - p - let (quater note triplet)
1& 2& 3& 4-trip-let &-trip-let(16th triplet still has the pulse of 8th notes) |
|
l*y
发帖数: 21010 | 28 按三路归并的办法，把三个数组并成一个，在这个过程中就找到了所需triplet。
首先设minDistance为MAXINT。归并的过程中，每次选三个数组各自最小元素的最小的
拿出来放入归并好的序列。假设某时刻三个数组的最小元素分别为ai,bj,ck，且ai最小
，我们记录max(|ai-bj|,|ai-ck|)的值。这个值就是在最后归并好的序列中，以ai为最
小数的triplet的Distance（可用反证法证明，因为bj和ck分别是另外两个数组中比ai
大的最小的数，所以再取更大的数Distance一定更大），记为curDistance，然后更新
minDistance如果比它更小（并且记住该minDistance对应的triplet是ai,bj,ck）。
完成归并后，我们就得到了minDistance和所需的那个triplet。
distance |
|
t**i
发帖数: 314 | 29 编译过了，运行出错，帮忙看看哪儿出了问题，多谢。
import java.util.*;
public class Solution {
public ArrayList> threeSum(int[] num) {
assert(num.length >= 3);
ArrayList> triplet = new
ArrayList>();
for(int i = 0; i < num.length - 2; i++) {
for(int j = i + 2; j < num.length; j++) {
for(int k = i + 1; k < j; k++) {
if((num[i] + num[j] + num[k]) == 0) {
int[] th... 阅读全帖 |
|
r*****s
发帖数: 1815 | 30 膜拜。。。。。。。。。。
: 有纯integer logN时间，O(1)空间解法。几年前写的：
: struct triplet{
: int a, b, c;
: triplet(int i, int j, int k):a(i), b(j), c(k){}
: };
: triplet trifabonacci(int n)
: {
: if (n
: return triplet (0, 0, 0);
: if (n : ...................
|
|
U*****e
发帖数: 2882 | 31 Found this page the other day. Evidently, I am one million miles away. But
allow me just share the location of this mountain everest, and may the brave
conquer it.
http://www.tomhess.net/LeadGuitarTechniqueMastery.aspx
How Close Are You To Mastering Electric Lead Guitar Technique?
1. I know how to use the fretting hand's index finger to mute the higher
strings from ringing. * Please answer this question.
Yes
No
2. I control extra string noise from the higher strings by using the
inactive fingers... 阅读全帖 |
|
m*****y
发帖数: 120 | 32 Given 3 array of numbers (can be positive, or negative), get one from each
array to form a triplet:
1) find whether there is a triplet that add to 0.
2) find all the triplets that add to 0.
The 3 array have the same size (length).
Of course, N^3 will be the default answer.
Any better idea?
for example:
A: 3, -5, 9
B: -2, 4, 1
C: 2, -1, 7
Then 3(from A) + -2 (from B) + -1 (From C) is 0. |
|
p****n
发帖数: 148 | 33 3Sum，原题附在下面
有什么好办法( O(n^2 ) ?)能处理输入中重复的元素，又不产生重复解吗？
如 S = {0, 0, 0, 0, -1, -1, -1, -1, 2},
A solution set is:
(0, 0, 0)
(-1,-1,2)
========
Given an array S of n integers, are there elements a, b, c in S such that a
+ b + c = 0? Find all unique triplets in the array which gives the sum of
zero.
Note:
* Elements in a triplet (a,b,c) must be in non-descending order. (ie, a
≤ b ≤ c)
* The solution set must not contain duplicate triplets.
For example, given array S = {-1 0 1 ... 阅读全帖 |
|
t*****t
发帖数: 285 | 34 Given an array S of n integers, are there elements a, b, c in S such that a
+ b + c = 0? Find all unique triplets in the array which gives the sum of
zero.
Note:
Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b
≤ c)
The solution set must not contain duplicate triplets.
For example, given array S = {-1 0 1 2 -1 -4},
A solution set is:
(-1, 0, 1)
(-1, -1, 2)
class Solution {
private:
int increment(vector& nums, int l, int r){
while(l阅读全帖 |
|
p****n
发帖数: 148 | 35 【 以下文字转载自 JobHunting 讨论区 】
发信人: person (幸福的黄马甲), 信区: JobHunting
标 题: 一FG家常见题
发信站: BBS 未名空间站 (Thu Apr 26 11:10:11 2012, 美东)
3Sum，原题附在下面
有什么好办法( O(n^2 ) ?)能处理输入中重复的元素，又不产生重复解吗？
如 S = {0, 0, 0, 0, -1, -1, -1, -1, 2},
A solution set is:
(0, 0, 0)
(-1,-1,2)
========
Given an array S of n integers, are there elements a, b, c in S such that a
+ b + c = 0? Find all unique triplets in the array which gives the sum of
zero.
Note:
* Elements in a triplet (a,b,c) must be in non-descending ... 阅读全帖 |
|
h********g
发帖数: 143 | 36 Thank you very much!
Are you talking about the triplet of CDCl3 in C-NMR?
Actually, I don't think it is due to C-CL coupling.
I searched the triplet of CDCl3 in C-NMR and found this:
http://u-of-o-nmr-facility.blogspot.com/2007/09/isotope-shifts-
The CDCl3 signal is a 1:1:1 triplet due to the J coupling to the deuteron
which is a spin I=1 nucleus having three energy levels. The chemical shift
difference between the CHCl3 and CDCl3 isotopomers is called an isotope
shift.
Question 1: Since chlorin... 阅读全帖 |
|
n*********r
发帖数: 18 | 37 All rights reserved!
(Draft version)
(3) Recombination of electrons and holes to form excitons.
Spin 1/2 electron and spin 1/2 hole can form 4 spin combinations, 3 triplets
and 1 singlets. If singlet and triplet capture cross-sections are equal, it
implies only 25% efficiency for generation of singlet excitons. This factor
is
assumed to be insensitive to both devices and materials. Since the ground
state is typically singlet, the transition from triplet to singlet is usually
forbidden by spin c |
|
f*******s
发帖数: 57 | 38 Here is a set of 50 numbers that seems to work (hope there is no flaw here),
don't know whether and how to prove it is optimal yet: Consider all the
triplet (x, y, z) such that
(x - y) % 2 == 0 and z = (x + y + x % 2) % 10.
By construction, there do not exist two triplets in the set that have more
than two identical numbers (in the same positions). This implies that for
any odd x, odd y and odd z, there is at least one triplet in the set that is
(x, *, z), and there is at least one triple in the... 阅读全帖 |
|
f**d
发帖数: 768 | 39 这是一本计算神经科学的优秀著作，全文拷贝这里（图和公式缺），有兴趣的同学可以
阅读
如需要，我可以分享PDF文件（－－仅供个人学习，无商业用途）
From Computer to Brain
William W. Lytton
From Computer to Brain
Foundations of Computational Neuroscience
Springer
William W. Lytton, M.D.
Associate Professor, State University of New York, Downstato, Brooklyn, NY
Visiting Associate Professor, University of Wisconsin, Madison
Visiting Associate Professor, Polytechnic University, Brooklyn, NY
Staff Neurologist., Kings County Hospital, Brooklyn, NY
In From Computer to Brain: ... 阅读全帖 |
|
w*p
发帖数: 16484 | 40 WOMAN GIVES BIRTH TO TRIPLETS IN MISSOURI, A woman had triplets in Missouri
yesterday, the state where a white police officer killed an unarmed teenager
...
UPS DRIVER HAS FLAT TIRE, A UPS driver had to change a flat tire in Missouri
last night, the state where a white police officer shot an unarmed teenager
...
MAN FINDS DIAMOND RING IN WISCONSIN, An elderly man found a missing diamond
ring in Wisconsin yesterday, Wisconsin is in the same country as Missouri
where a white police officer shot an... 阅读全帖 |
|
|
s*********r
发帖数: 9493 | 42 更详细报道在这里：
Mihrigul Tursun, speaking to reporters in Washington, said she was
interrogated for four days in a row without sleep, had her hair shaved and
was subjected to an intrusive medical examination following her second
arrest in China in 2017. After she was arrested a third time, the treatment
grew worse.
“I thought that I would rather die than go through this torture and begged
them to kill me,” Tursun, 29, told reporters at a meeting at the National
Press Club.
Human rights groups say Chin... 阅读全帖 |
|
p******e
发帖数: 897 | 43 WASHINGTON — President-elect Donald J. Trump’s choice for White House
budget director failed to pay more than $15,000 in payroll taxes for a
household employee, he admitted in a statement to the Senate Budget
Committee, the sort of tax compliance issue that has derailed cabinet
nominees in the past.
In a questionnaire provided to the committee, Representative Mick Mulvaney,
a conservative from South Carolina and vocal proponent of fiscal restraint
noted, “I have come to learn during the confirma... 阅读全帖 |
|
s*********r
发帖数: 9493 | 44 更详细报道在这里：
Mihrigul Tursun, speaking to reporters in Washington, said she was
interrogated for four days in a row without sleep, had her hair shaved and
was subjected to an intrusive medical examination following her second
arrest in China in 2017. After she was arrested a third time, the treatment
grew worse.
“I thought that I would rather die than go through this torture and begged
them to kill me,” Tursun, 29, told reporters at a meeting at the National
Press Club.
Human rights groups say Chin... 阅读全帖 |
|
g**x
发帖数: 373 | 45 Suppose three arrays got merged into one in ascending order, the triplet
with minimum distance must appear as ... Xi, Yj, Zk ... OR ... Xi, Yj, Yj+1,
..., Yj',Zk ... The distance is Zk - Xi.
So one scan/merge on three arrays by ascending order, can detect the triplet
in above patterns and find out the minimum distance for sure. |
|
B**********2
发帖数: 923 | 46 Amazon
1.括号匹配
1.1 已知一个字符流，只有'('或者')'，检查是否是balance
解：用一个数maintain，以0开始，遇到'('就加1，遇到')'就减一。进行中如果小于0
，直接就return false. 全扫完如果等于0就return true, 否则return false
1.2 已知字符流包括 (,[,{ 和 ),],}，检查是否balance
解：不用数maintain，而改用一个stack，碰到匹配的就pop，否则push，空栈再碰到任
意右括号，直接return false。如果全扫完是空栈return true, 否则return false
2.Anagram
给一个数组的单词，要求输出顺序为anagram，即如果有 tea, cat, eat, 那么tea和
eat一定要挨着
解：同一anagram单词特点是把这个单词按字母排序之后，长得都一样。所以用一个字
典来维护anagram
同一单词排序后为key, 关于单词的list就是value。如果有这个key,就append到list里
，没有就另开一个。最后把这些anagram连起来输出
G... 阅读全帖 |
|
n*******s
发帖数: 17267 | 47 我也没完全想明白， 一开始就把那个次序不变理解错了。
直觉是在足够多的triplets输出里从每个triplet里找重复最多的字母， 可能重复3，2
，1次， 然后把这个字母从这些triplelets里干掉， 再找下一个重复的字母，可能是2
，1次， 。。。， 这样应该能把6个字母找出来吧？
说4，5，6是说要考虑边界情况， 4个g之类的。 |
|
t**********p
发帖数: 2672 | 48 What we can do is that we can plan to staying the night on the ridge but
still try our best to make it back to Twin Peaks before sun sets (once you
are back to Twin Peaks there is trail)
The good news is that as the ridge get closer to Twin Peaks, it is in better
condition and less scrambling and climbing involved.
The bad news is I don't know how long it will us take to do the last part
where I turned back where you must drop down to a gully then scramble up.
It took Ze a little more than an... 阅读全帖 |
|
|
t**********p
发帖数: 2672 | 50 这条应该是San Gabriel最难路线, 也是我走过最难的一次, 那天我差不多崩溃了， 最
后还是选择放弃登顶.
这个山脊才3mi长，我们总共停了3次，已经不停的走，但是单程还是用了我们6个小时
， 你自己可以想象路的状况. bushwhacking， scrambling， 找路都用了很多时间.
这条路线最危险是当你要走回头时候，你累了还要攀岩class 3 / class 4， 一不小
心很容易出事.
根据我个人去年的尝试, 这个比铁人山到秃头山的路线要难， 铁人山的North Ridge应
该跟这个差不多， 根据两条路线都走过的"LD" 说Triplet Rocks还要比North Ridge要
难， 因为Triplet Rocks你要背很多水， 铁人山可以上山脊之前可以补水. |
|
