<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fifaoresp的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/fifaoresp</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; fifaoresp]]></copyright><item><title><![CDATA[pr_review skills ]]></title><link>https://blog.csdn.net/fifaoresp/article/details/161218502</link><guid>https://blog.csdn.net/fifaoresp/article/details/161218502</guid><author>fifaoresp</author><pubDate>Tue, 19 May 2026 11:20:24 +0800</pubDate><description><![CDATA[--------```bash``````bash```---Check for:Check for:Check for:------------------the rest.Summary.---```bash```]]></description><category></category></item><item><title><![CDATA[kslndbalabbs]]></title><link>https://blog.csdn.net/fifaoresp/article/details/161056332</link><guid>https://blog.csdn.net/fifaoresp/article/details/161056332</guid><author>fifaoresp</author><pubDate>Wed, 13 May 2026 18:08:13 +0800</pubDate><description><![CDATA[/ end <= nextStart 可以连续执行。]]></description><category></category></item><item><title><![CDATA[kdndoqobd_ys]]></title><link>https://blog.csdn.net/fifaoresp/article/details/161055944</link><guid>https://blog.csdn.net/fifaoresp/article/details/161055944</guid><author>fifaoresp</author><pubDate>Wed, 13 May 2026 17:49:12 +0800</pubDate><description><![CDATA[i < n;i++) {cnt++;} else {cnt = 0;// 最后一段// 防止出现负数。]]></description><category></category></item><item><title><![CDATA[【无标题】jdbsbhakb]]></title><link>https://blog.csdn.net/fifaoresp/article/details/160828447</link><guid>https://blog.csdn.net/fifaoresp/article/details/160828447</guid><author>fifaoresp</author><pubDate>Wed, 06 May 2026 16:53:29 +0800</pubDate><description><![CDATA[/ N: 总网点数。// 更新全局最大值：经过当前节点的路径 = 第一长分支 + 第二长分支 + 当前节点本身。* @return 返回从当前节点向下延伸能覆盖的最关键节点数。// 返回给父节点：当前节点加上最长的一个分支。* 顶级算法工程师解决方案 - 树上最长关键节点路径。// 读取 N-1 条边。]]></description><category></category></item><item><title><![CDATA[【无标题】pribdhsb]]></title><link>https://blog.csdn.net/fifaoresp/article/details/160828078</link><guid>https://blog.csdn.net/fifaoresp/article/details/160828078</guid><author>fifaoresp</author><pubDate>Wed, 06 May 2026 16:35:46 +0800</pubDate><description><![CDATA[/ 更新答案（路径经过u）]]></description><category></category></item><item><title><![CDATA[kdbbdoakb]]></title><link>https://blog.csdn.net/fifaoresp/article/details/160599595</link><guid>https://blog.csdn.net/fifaoresp/article/details/160599595</guid><author>fifaoresp</author><pubDate>Tue, 28 Apr 2026 18:45:01 +0800</pubDate><description><![CDATA[/ 但其实对于每一台机器，我们剩余的钱是固定的，可以直接贪心买。// 2. 预处理：前缀和计算在特定预算下最多能买多少盒子。// 由于 S 很大 (10^5)，我们可能需要快速计算。// 1. 对商店按成本进行升序排序 (贪心准备)// 如果已经买够了，直接返回 0 时间。* 计算在给定机器效率、预算和商店列表下的最短时间。// 方案 B: 尝试每一台新机器。// 方案 A: 使用旧机器。// 输出模 1000007。// 最多能买多少个。]]></description><category></category></item><item><title><![CDATA[aaajidu]]></title><link>https://blog.csdn.net/fifaoresp/article/details/160599315</link><guid>https://blog.csdn.net/fifaoresp/article/details/160599315</guid><author>fifaoresp</author><pubDate>Tue, 28 Apr 2026 18:23:19 +0800</pubDate><description><![CDATA[/ 存储为分子分母避免浮点误差：sCost * 100000L / sNum。// 二分边界：左0，右为最坏情况（全用旧机器生产，不买任何盒子）// 计算买need个盒子的最小花费，返回-1表示不够买。// 读取S个商店：sNum, sCost。// 方案2：遍历所有机器，买新机器。// 方案1：不买新机器，用旧机器。// 输入机器数量M、商店数量S。]]></description><category></category></item><item><title><![CDATA[testingdd]]></title><link>https://blog.csdn.net/fifaoresp/article/details/156980576</link><guid>https://blog.csdn.net/fifaoresp/article/details/156980576</guid><author>fifaoresp</author><pubDate>Thu, 15 Jan 2026 10:18:16 +0800</pubDate><description><![CDATA[long cost;long time;cost = c;time = t;i < M;i++) {i < mm;i++) {i < S;i++) {continue;ans = mid;} else {return ans;]]></description><category></category></item><item><title><![CDATA[hhhhikn]]></title><link>https://blog.csdn.net/fifaoresp/article/details/151152673</link><guid>https://blog.csdn.net/fifaoresp/article/details/151152673</guid><author>fifaoresp</author><pubDate>Wed, 03 Sep 2025 16:45:09 +0800</pubDate><description><![CDATA["info": {},"item": [],"url": {"host": ["service","com"],"path": ["v2","trans","4.0.0"},]]></description><category></category></item><item><title><![CDATA[post-kdb]]></title><link>https://blog.csdn.net/fifaoresp/article/details/150927344</link><guid>https://blog.csdn.net/fifaoresp/article/details/150927344</guid><author>fifaoresp</author><pubDate>Wed, 27 Aug 2025 15:22:38 +0800</pubDate><description><![CDATA["raw": "{\"username\":\"jack\",\"sex\":\"男\"}"]]></description><category></category></item><item><title><![CDATA[kdndn]]></title><link>https://blog.csdn.net/fifaoresp/article/details/150925952</link><guid>https://blog.csdn.net/fifaoresp/article/details/150925952</guid><author>fifaoresp</author><pubDate>Wed, 27 Aug 2025 14:47:37 +0800</pubDate><description><![CDATA["raw": "{\"username\":\"jack\",\"sex\":\"男\"}"--data '{"username":"jack","sex":"男"}']]></description><category></category></item><item><title><![CDATA[demo8]]></title><link>https://blog.csdn.net/fifaoresp/article/details/149667498</link><guid>https://blog.csdn.net/fifaoresp/article/details/149667498</guid><author>fifaoresp</author><pubDate>Sat, 26 Jul 2025 15:14:22 +0800</pubDate><description><![CDATA[/ 创建带 mock 客户端的 publisher。// 模拟EventBridge响应。// 模拟EventBridge异常。// 发送到EventBridge。// 测试环境使用的构造函数（依赖注入）// 执行测试并验证没有异常抛出。// 生产环境使用的构造函数。// 设置日志记录器。]]></description><category></category></item><item><title><![CDATA[【无标题】]]></title><link>https://blog.csdn.net/fifaoresp/article/details/149666474</link><guid>https://blog.csdn.net/fifaoresp/article/details/149666474</guid><author>fifaoresp</author><pubDate>Sat, 26 Jul 2025 14:10:25 +0800</pubDate><description><![CDATA[/ 验证日志输出 - 实际应用中可以使用更高级的日志捕获。// 执行测试并验证没有异常抛出。// 模拟EventBridge响应。// 模拟EventBridge异常。// 这里主要验证没有异常发生。// 创建模拟客户端抛出异常。// 准备无效的JSON输入。// 验证生成的UUID格式。// 执行测试并验证异常。// 执行测试并验证异常。// 执行测试并验证异常。// 验证原始数据保留。// 准备不完整的输入。]]></description><category></category></item><item><title><![CDATA[demo6]]></title><link>https://blog.csdn.net/fifaoresp/article/details/149665966</link><guid>https://blog.csdn.net/fifaoresp/article/details/149665966</guid><author>fifaoresp</author><pubDate>Sat, 26 Jul 2025 13:29:41 +0800</pubDate><description><![CDATA[/ 使用try-with-resources管理静态mock。// 创建模拟的StartExecutionResponse。// 验证startExecution被调用。// 创建模拟的SfnClient。]]></description><category></category></item><item><title><![CDATA[demo5]]></title><link>https://blog.csdn.net/fifaoresp/article/details/149662593</link><guid>https://blog.csdn.net/fifaoresp/article/details/149662593</guid><author>fifaoresp</author><pubDate>Sat, 26 Jul 2025 10:50:04 +0800</pubDate><description><![CDATA[RegistrationHandler.javaValidateUserData.javaCreateUserAccount.javaSendWelcomeNotification.javaPublishRegistrationEvent.java]]></description><category></category></item><item><title><![CDATA[demo3]]></title><link>https://blog.csdn.net/fifaoresp/article/details/149645874</link><guid>https://blog.csdn.net/fifaoresp/article/details/149645874</guid><author>fifaoresp</author><pubDate>Fri, 25 Jul 2025 18:15:44 +0800</pubDate><description><![CDATA[## 4. Step Functions定义 (src/main/resources/step-function-definition.json)这个简化版本完全专注于AWS四个核心组件的集成，移除了所有数据库相关逻辑，只保留最基本的业务逻辑和日志记录，符合您要求的简单Demo。1. 更新step-function-definition.json中的ARN占位符。#### InventoryDeduction.java (简化)#### NotificationSender.java (简化)]]></description><category></category></item><item><title><![CDATA[demo2]]></title><link>https://blog.csdn.net/fifaoresp/article/details/149645735</link><guid>https://blog.csdn.net/fifaoresp/article/details/149645735</guid><author>fifaoresp</author><pubDate>Fri, 25 Jul 2025 18:09:55 +0800</pubDate><description><![CDATA[下面我将补充完整所有代码，包括所有Lambda函数、DTO类、Step Functions定义以及详细的部署文档。1. 完整的pom.xml。]]></description><category></category></item><item><title><![CDATA[aws demo]]></title><link>https://blog.csdn.net/fifaoresp/article/details/149644352</link><guid>https://blog.csdn.net/fifaoresp/article/details/149644352</guid><author>fifaoresp</author><pubDate>Fri, 25 Jul 2025 17:24:23 +0800</pubDate><description><![CDATA[│   │   │   ├── StepFunctionsClient.java # Step Functions交互。│   │       └── statemachine.asl.json    # Step Functions定义。│   │   │   ├── EventBridgeHandler.java  # EventBridge触发器。2. **Lambda**：处理新订单，启动Step Functions工作流。1. **EventBridge**：每分钟触发一次模拟订单创建事件。]]></description><category></category></item><item><title><![CDATA[fifaoresp demo]]></title><link>https://blog.csdn.net/fifaoresp/article/details/149643759</link><guid>https://blog.csdn.net/fifaoresp/article/details/149643759</guid><author>fifaoresp</author><pubDate>Fri, 25 Jul 2025 17:07:44 +0800</pubDate><description><![CDATA[bdhshsnbsisbsbsjdjdk]]></description><category></category></item></channel></rss>