Skip to content

Instantly share code, notes, and snippets.

刘钦 liuqinh2s

Block or report user

Report or block liuqinh2s

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
View 股票挑选
# coding=utf-8
import requests
import time
import os
import json
import queue
import threading
import tushare as ts
View 淘宝店铺截图按键精灵脚本
// 从TXT文件中读取店铺名到数组
Dim shopNameFilePath="/sdcard/shopName.txt", shopNameArray
shopNameArray = File.ReadLines(shopNameFilePath)
// 截图保存路径
Dim snapShotPath = "/sdcard/shopPhoneDir/"
// 循环输入店铺名
For Each element In shopNameArray
View 全自动客户信息审核-按键精灵脚本
Function endFunction(path, number)
File.Write(path, number)
EndScript
End Function
// 转账按钮界面的所有操作都包装在这个函数里
Function transfer(jpgStorePath, pngStorePath, path, number, itemNumber)
// 有没有头像的转账按钮位置不同,所以只能通过颜色来判断位置
Dim transferPointX, transferPointY
View 自动炒币脚本.py
while(True):
# 日线
tradeDayLineURL = "https://www.aex.com/trade/getTradeDayLine.php?coinname=BTS&mk_type=bitcny"
tradeDayLineResponse = requests.post(tradeDayLineURL, headers=headers)
while tradeDayLineResponse.status_code!=200:
tradeDayLineResponse = requests.post(tradeDayLineURL, headers=headers)
dayContent = json.loads(tradeDayLineResponse.text)
dayListContent = list(dayContent)
dayLength = dayListContent.__len__()
# print(dayLength)
@liuqinh2s
liuqinh2s / crossList.cpp
Created Dec 29, 2016
十字链表,交换上下左右任意
View crossList.cpp
#include <stdio.h>
#include <malloc.h>
struct NODE {
char data;
struct NODE *U;//
struct NODE *R;//
struct NODE *D;//
struct NODE *L;//
} *B,*q;
struct NODE *m[10];
@liuqinh2s
liuqinh2s / ArrayInterface.cpp
Created Dec 27, 2016
数组的转换接口,比如我们经常要用到[[7,0],[4,4],[7,1],[5,0],[6,1],[5,2]],怎么把这一串字符串,传值给一个vector<pair<int, int>>& people;呢。这或许要用到字符串解析的代码,解析出来后还要一个一个传值,做轮子,不做白手起家的傻逼。
View ArrayInterface.cpp
void form_fun(string s, vector<pair<int, int>>& people){
if(s.at(0)=='[' && s.at(1)=='[' && s.at(s.size()-2)==']' && s.at(s.size()-1)==']'){
pair<int,int> p;
for(int i=0;i<s.size();i++){
while(i<s.size() && (s.at(i)>'9' || s.at(i)<'0'))
i++;
if(i<s.size() && s.at(i)<='9' && s.at(i)>='0'){
string buffer="";
buffer += s.at(i);
while(i<s.size() && s.at(i+1)<='9' && s.at(i+1)>='0'){
View KMP.cpp
int KMP(Str str, Str substr, int next[]){
int i=0,j=0;
while(i<str.length && j<substr.length){
if(j==-1||str.ch[i] == substr.ch[j]){
++i;
++j;
}
else{
j=next[j];
}
View BSTree.cpp
template <class T>
class BSTree {
private:
BSTNode<T> *mRoot;
public:
BSTree();
~BSTree();
// 前序遍历"二叉树"
@liuqinh2s
liuqinh2s / BSNode.cpp
Last active Jun 11, 2016
DataStructure
View BSNode.cpp
template <class T>
class BSTNode{
public:
T value;
BSTNode *left;
BSTNode *right;
BSTNode(T value1, BSTNode *l, BSTNode *r):
value(value1),left(l),right(r) {}
};
You can’t perform that action at this time.