加载中
What are the steps to becoming a quant? author: David Pethick

Wow, this takes me back... I had finished my Ph.D. (Atmospheric Physics) and landed my dream job. I looked around and realised that I had little in common with all of my new col...

2014/10/07 22:55
17
abacus

######################################################################### # 10-row School abacus # by # Michael H ##...

2014/10/07 22:55
15
[leetcode] Remove Duplicates from Sorted Array python

problem: Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, y...

2014/10/07 22:55
11
Python 生成器 generator

生成器给人的感觉就是用非正常的函数语言定义的迭代器。 任何函数,只要有yield语句,都是迭代器。 例如: nested_list = [[1,2],[3,4],[5]] def aGen(nested_list): for i in nested_...

2014/10/07 22:55
29
C语言练习-2转义字符

#include <stdio.h> int main() { printf("how are u?\n");// 回车 printf("i am fine.\n\n"); printf("how are u? \t");//下一个输出区 printf("i am fine.\n\n"); p...

2014/10/07 22:55
9
python 中的内置函数 与 类

python这种语言的变量命名规则有些奇葩,我相信大家已经遇到过了,比如:__future__。这种特殊的形式表明,这个 变量有特殊的意义,你不可以在自己的代码中创造这类变量。 1.__init__() 构造...

[leetcode] python Remove Duplicates from Sorted Array II

problem: Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array A = [1,1,1,2,2,3], Your function should return length =...

2014/10/07 22:55
21
RK4

MODULE Global_data !Symbolic names for kind types of single- and double-precision reals: INTEGER, PARAMETER :: SP = KIND(1.0) INTEGER, PARAMETER :: DP = KIND(1.0D0) !...

2014/10/07 22:55
14
L P

# solves *bounded* LPs of the form: # max cx # sub to: Ax <= b from sympy import * from itertools import combinations # enumerates all the vertices of {x...

2014/10/07 22:55
6
[leetcode] Search in Rotated Sorted Array Python

Problem: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If ...

2014/10/07 22:54
18
count_inversions in an integer list

count = 0 def merge_sort(li): if len(li) < 2: return li m = len(li) / 2 return merge(merge_sort(li[:m]), merge_sort(li[m:])) def merge(l, r): global count ...

2014/10/07 22:54
1

没有更多内容

加载失败,请刷新页面

没有更多内容

返回顶部
顶部