How to start your upwork without client
Suggestions you need to know
Profile Overhaul: Ensure your profile is client-focused rather than self-focused. Highlight how you can solve problems for clients rather than simply listing your skills and experience.
Learning from Others: Consider taking courses or researching successful freelancers’ profiles, particularly in sales copywriting, to understand how to appeal to potential clients.
Rate Adjustment: Initially, you may need to lower your rates t ...
Coursera
未读mind map of “Bulid AI Career Success”This book aims for helping people to explore career in AI
projects
未读
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.
Quick StartCreate a new post1$ hexo new "My New Post"
More info: Writing
Run server1$ hexo server
More info: Server
Generate static files1$ hexo generate
More info: Generating
Deploy to remote sites1$ hexo deploy
More info: Deployment
coding notes
未读链表问题单向链表链表的头插法和尾插法
1234567891011121314151617181920212223242526272829class LinkedList: def __init__(self): self.head = None # 头插法 def insert_at_head(self, data): new_node = Node(data) new_node.next = self.head self.head = new_node # 尾插法 def insert_at_tail(self, data): new_node = Node(data) if not self.head: self.head = new_node return last_node = self.head while last_node.next: last_node = las ...
projects
未读如何自建VPS 0011. VPS是什么？VPS（Virtual Private Server）即虚拟专用服务器，它是通过虚拟化技术将一台物理服务器分割成多个虚拟服务器。每个VPS都具有自己的操作系统、IP地址和资源分配，能够独立运行程序。
VPS适用于需要独立服务器资源的用户，如：
搭建网站、应用程序或数据库
自建VPN、代理服务器等
进行高性能计算和数据处理
2. 常见VPS提供商对比1. Hostinger : link
特点：价格较低，适合预算有限的用户。
配置：提供512MB内存的机型，硬盘为NVMe，但线路质量一般。
适用场景：适合轻量级应用或初学者使用。
缺点：配置较低，性能可能不如其他高端厂商。
2. Cloudcone : link
特点：位于美国洛杉矶，推广力度大，价格低廉。
配置：提供512MB内存的机型，硬盘容量较大（如9.5美元提供30GB SSD）。
适用场景：适合短期使用或对硬盘容量有需求的用户。
缺点：机型较老旧，部分机型可能缺货。
3. RackNerd (RN) : link
特点：性价比高，尤其是黑色星期五促销期间。
配置 ...
coding notes
未读常见的数字之间的运算法则1234567# 进位和余位问题，模拟进位相加法，以为10进制为例res = (num + add) // 10 # 如果使用同一个add，这res在前，因为add会在第二步被更新add = (num + add) % 10# int相除，向上取整res = ceil(x, y)res = (x + y - 1) // y
最大公约数123456789101112131415161718192021# 求x，y的最大公约数# 短除法，def func1(a,b): res=1 for i in range(2,min(a,b)): while(a % i == 0 and b % i == 0): res*=i a/=i b/=i return res# 辗转相除法，def func2(num1, num2): m = max(num1, num2) n = min(num1, num2) r = m % n while r != 0: ...
coding notes
未读二叉搜索树/AVL树
coding notes
未读队列用队列表栈
123456789101112131415161718192021222324252627class MyStack: def __init__(self): self.query_in = deque() self.query_out = deque() def empty(self)-> bool: return not self.query_in def push(self, num:int)-> None: self.query_in.append(num) def pop(self)-> None: if self.empty(): return None n = len(self.query_in()) for i in range(0:n-1): # 清空前 i-1 位置的self.query_in，只留下最后一个需要弹出的 i 在 ...
