自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(23)
  • 收藏
  • 关注

转载 【论文】Prim算法失败学习(哭泣

#coding=utf-8class Graph(object): def __init__(self, maps): self.maps = maps self.nodenum = self.get_nodenum() self.edgenum = self.get_edgenum() def get_nodenum(self): return len(self.maps) def get_edgenum(self): count = 0

2020-10-28 22:47:14 198

原创 【论文】最小生成树MST失败案例

#最小生成树MST===================================================primgraph = matchararray = countrycharlist = []charlist.append(chararray[0])mid = [] # mid[i]表示生成树集合中与点i最近的点的编号lowcost = [] # lowcost[i]表示生成树集合中与点i最近的点构成的边最小权值 ,-1表示i已经在生成树集合中lowcost.app.

2020-10-23 12:10:43 176

原创 【数据结构与算法】Python 图及算法学习笔记

1. 术语及定义1.1 定点1.2 边1.3 权重1.4 图的定义V = {V0, V1, V2, V3, V4, V5}E = {(v0,v1,5), (v1, v2, 4), (v2, v3, 9)... }1.5 路径路径的顶点序列 (V3, V4, V0, V1)路径对应的边 {(v3, v4, 7),(v4, v0, 1)}1.6 环2. 图的抽象矩阵类型2.1 定义#新建一个空图Graph()#添加一个顶点addVertex(.

2020-10-23 11:02:48 105

原创 Networkx包初尝试:无向图

import matplotlib.pyplot as pltimport networkx as nxG = nx.Graph()G.add_edge('a', 'b', weight=0.6)G.add_edge('a', 'c', weight=0.2)G.add_edge('c', 'd', weight=0.1)G.add_edge('c', 'e', weight=0.7)G.add_edge('c', 'f', weight=0.9)G.add_edge('a', 'd'.

2020-10-22 23:11:33 497

原创 Python Sympy 包学习笔记

#学习sympy笔记 函数包括: symbols, solve, summation, limit, diff, intergrate#求方程及方程组----------------------from sympy import symbols, solvex = symbols('x')f = x ** 2 + x -6solve(f > 0, x)x = symbols('x')f1 = x ** 2 + x -6f2 = 2 * x + 6 - 7 * x +9sol..

2020-10-22 13:45:16 433

原创 惯性效应与反转效应——tushare实验

import numpy as npimport matplotlib.pyplot as pltimport pandas as pdimport tushare as tsimport statsmodels.api as smpro = ts.pro_api('')s = {}stock_name = ['600521.SH', '600522.SH','600523.SH','000001.SZ',\ '600525.SH', '600526.SH', .

2020-10-16 14:01:29 928 1

原创 python 循环Merge多个DataFrame

##要按时间对齐两个以上的时间序列,初始操作和后续不同---------------------------------------------------------------------------------df = pd.merge(s[0][['trade_date', 'close']], s[1][['trade_date', 'close']], left_on=s[0]['trade_date'], right_on=s[1]['trade_date'].

2020-10-16 13:57:21 3312 1

原创 python 批量导入文件和数据

##批量导入文件和数据-------------------------------------------------------------------------------------------------##批量导入文件和数据------------------------------------------------------------------------------------------------------#我要导入100个股票的行情数据,文件都是csv格式,100.

2020-10-16 13:52:38 1115

原创 2019.12.6 LEETCODE SQL

1149 Article Views 2SELECT DISTINCT viewer_id AS idFROM Views aGROUP BY a.view_date, viewer_idHAVING COUNT(DISTINCT article_id) >= 2ORDER BY viewer_id1158 Market Analysis想要显示 0 就要加 sum(if(,...

2019-12-07 01:45:04 103

原创 2019.12.4 leetcode SQL

1112 每位学生最高成绩Select student_id,min(course_id) as course_id,gradeFrom EnrollmentsWhere(student_id,grade) in (Select student_id,max(grade) as gradeFrom Enrollments Group by student_id) Group by s...

2019-12-05 02:37:50 123

原创 2019.12.3 LEETCODE AG

堆——简单贪心算法——简单1046 最后一块石头的重量有个库叫 import heapq有几个用法import heapq #生成最小堆优先队列heapq.heapify(object)heapq.heappop(object) #pop 最小值heapq.heappush(object,var) #将元素push队列class Solution: def lastS...

2019-12-04 07:34:19 66

原创 209.12.3.LEETCODE SQL

614 二级关注者这道题很坑爹,一直不知道哪里错了然后看评论里有重复项要加DISTINCTselect f1.follower,count(distinct(f2.follower)) numfromfollow f1,follow f2wheref1.follower=f2.followeegroup byf1.follower1045 买下所有产品的客户我一直开始太天...

2019-12-04 00:08:14 83

原创 2019.12.02 Leetcode AG

栈——简单496 下一个更大的元素def nextGreaterElement(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: List[int] """ res = list() ...

2019-12-03 05:05:59 78

原创 2019.12.12 leetcode SQL

580 统计各专业学生人数SELECT dept_name, COUNT(student_id) AS student_numberFROM department left OUTER JOIN student ON department.dept_id = student.dept_idGROUP BY department.dept_nameOR...

2019-12-03 02:39:38 104

原创 2019.12.01 Leetcode AG

栈——简单1047 删除字符串中所有相邻重复项class Solution(object): def removeDuplicates(self, S): output = [] for s in S: if output and s == output[-1]: output.pop() ...

2019-12-02 09:28:13 78

原创 2019.12.1 Leetcode SQL

SELECT a1.player_id,a1.event_date,sum(a2.games_played) as games_played_so_farFrom Activity as a1, Activity as a2 Where a1.player_id = a2.player_id and a1.event_date >= a2.event_dateGroup by a1.p...

2019-12-02 07:53:46 99

原创 几何布朗运动模拟 MATLAB实现

time = data.date;%抽取年份close = data.close; %抽取收盘价pos = time.Year == 2019;%选择2019年打标签close_2019 = close(pos);%选择2019年收盘价[ret,vol] = RetVolCaculation(data);simup = MCSimulation(ret,vol,time,close);...

2019-10-10 23:18:26 4898

原创 递归函数求调和数

def harmonic_number(n): if n ==1: return 1/n if n > 0: return 1/n + harmonic_number(n-1)

2019-10-05 10:00:33 1257

原创 python递归找最大值

def my_max(s,n): if n ==0: return s[0] if s[n] <= my_max(s,n-1): return my_max(s,n-1) else: return s[n]

2019-10-05 09:47:30 1517 1

原创 资产组合优化——python 有效前沿

注意optimze.minimize 优化问题求解方法import numpy as npimport pandas as pdimport matplotlib.pyplot as pltfrom scipy.optimize import minimizeimport tushare as tspro = ts.pro_api(‘’)stock1 = pro.daily(ts_c...

2019-09-22 00:36:22 2534

原创 最小风险 —— Matlab 优化

p = zeros(20,4);k = 1;for i = 0:0.1:2f = @(w)w’ * B * w;Aeq = [A;ones(1,4)];Beq = [i;1];p(k,:) = fmincon(f,zeros(4,1),[],[],Aeq,Beq,[zeros(4,1)])’;k = k+1;endep = mean(stock) * p’;thetap = ...

2019-09-21 08:07:18 484

原创 Case Study _均值方差模型 MatLab

%%设置初始表格Asset = { ‘Bonds’, ‘Large-Cap Equities’, ‘Small-Cap Equities’, ‘Emerging Equities’ };Price = [ 52.4; 122.7; 35.2; 46.9 ];Holding = [ 42938; 24449; 42612; 15991 ];UnitCost = [ 0.001; 0.001;...

2019-09-20 12:45:01 1109

原创 感受资产组合有效前沿

感受资产组合有效前沿num = 1000;ep = zeros(num,1);theta = zeros(num,1);for i = 1:numw = rand(3,1);w = w./sum(w);% pause(0.01);ep(i) = mean(stock)*w;thetha(i) = sqrt(w’*cov(stock)*w);endscatter(the...

2019-09-20 07:54:57 855

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除