a*y
2 楼
i bought a little, but not sure its trend.
w*s
3 楼
leetcode原题吧
w*s
4 楼
哦,看错了,貌似是原题的变体
w*s
5 楼
patpat了,楼主多做题肯定能过的,现在市场是很好的
s*u
6 楼
杨辉三角形吧。是不是存一个prevlist,然后curlist一边赋值一边打印?有点像bfs
p*2
9 楼
(defn f [l]
(defn- dfs [xs pre next layer]
(cond
(<= layer 0) nil
(empty? xs)
(let [n (cons (inc pre) next)]
(println n)
(dfs n 1 () (dec layer)))
:default
(let [curr (first xs)]
(dfs (rest xs) curr (cons (+ pre curr) next) layer))))
(dfs () 0 () l))
(defn- dfs [xs pre next layer]
(cond
(<= layer 0) nil
(empty? xs)
(let [n (cons (inc pre) next)]
(println n)
(dfs n 1 () (dec layer)))
:default
(let [curr (first xs)]
(dfs (rest xs) curr (cons (+ pre curr) next) layer))))
(dfs () 0 () l))
c*r
10 楼
要求java实现,开头问了好几个LinkedList / ArrayList的问题,莫非要用这些现成的
类去实现?我是写了一段for loop加if-else的,可能人家看着不够简洁
类去实现?我是写了一段for loop加if-else的,可能人家看着不够简洁
D*d
12 楼
void PrintTriangle(int n){
vector list(n,1);
for(int i = 0; i < n; ++i){
for(int j = i; j > 0; --j) list[j] += list[j-1];
list[0] = i+1;
for(int j = 0; j <= i; ++j) cout << list[j];
cout << endl;
}
}
vector
for(int i = 0; i < n; ++i){
for(int j = i; j > 0; --j) list[j] += list[j-1];
list[0] = i+1;
for(int j = 0; j <= i; ++j) cout << list[j];
cout << endl;
}
}
相关阅读