Worty - 博客园

2020年3月3日

该文被密码保护。阅读全文

posted @ 2020-03-03 17:17 Worty 阅读(0) 评论(0) 推荐(0) 编辑

摘要：参考资料：https://www.cnblogs.com/huluwa508/p/10319568.htmlhttps://blog.csdn.net/qq_33475105/article/details/82192916 安装包：python_dotenv-0.10.3-py2.py3-none 阅读全文

posted @ 2020-03-03 17:16 Worty 阅读(412) 评论(0) 推荐(0) 编辑

vs输出调试信息demo

摘要：一，vs输出调试信息；使用：OutputDebugString()函数：以下Demo使用如下：#include <stdio.h>#include <stdlib.h>#include <windows.h> int main(){ char chInput[512]; sprintf(chInpu 阅读全文

posted @ 2020-03-03 17:14 Worty 阅读(785) 评论(0) 推荐(0) 编辑

dump文件分析

该文被密码保护。阅读全文

posted @ 2020-03-03 16:58 Worty 阅读(1) 评论(0) 推荐(0) 编辑

2020年1月21日

*Unique Paths

摘要： Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or r 阅读全文

posted @ 2020-01-21 17:03 Worty 阅读(107) 评论(0) 推荐(0) 编辑

*Decode Ways

摘要： A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1'B' -> 2...'Z' -> 26Given a non-empty string co 阅读全文

posted @ 2020-01-21 16:57 Worty 阅读(134) 评论(0) 推荐(0) 编辑

*Perfect Squares

摘要： Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. Example 1: Input: n = 12 O 阅读全文

posted @ 2020-01-21 16:47 Worty 阅读(87) 评论(0) 推荐(0) 编辑

Integer Break

摘要： Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum pro 阅读全文

posted @ 2020-01-21 16:41 Worty 阅读(151) 评论(0) 推荐(0) 编辑

Triangle

摘要： 120. Triangle Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example 阅读全文

posted @ 2020-01-21 15:54 Worty 阅读(316) 评论(0) 推荐(0) 编辑

Climbing Stairs

摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文

posted @ 2020-01-21 15:35 Worty 阅读(170) 评论(0) 推荐(0) 编辑