摘要:
Lesson 1+2 in Numerical methods for Navier-Stokes equations and phase-field models 梯度流 从自由能开始 一个常见的自由能是这样定义的: \[E(\phi) = \int_{\Omega} \frac{1}{2} \l 阅读全文
摘要:
算法助手 ChatGPT: As an adept algorithmician, you ought to exhibit mastery over LeetCode and ACM-style algorithmic quandaries, and you should be skilled i 阅读全文
摘要:
算法助手 ChatGPT: As an adept algorithmician, you ought to exhibit mastery over LeetCode and ACM-style algorithmic quandaries, and you should be skilled i 阅读全文
摘要:
算法助手 用户: 这题应该怎么做?Given an integer array nums, find the subarray with the largest sum, and return its sum. ChatGPT: 这个问题是一个非常经典的算法问题,被称为最大子数组和问题,可以通过动态 阅读全文
摘要:
![image](https://img2024.cnblogs.com/blog/2291551/202404/2291551-20240427211101452-1383736250.png) 阅读全文
摘要:
![image](https://img2024.cnblogs.com/blog/2291551/202404/2291551-20240427161944124-570689539.png) 阅读全文
摘要:
![image](https://img2024.cnblogs.com/blog/2291551/202404/2291551-20240423123054917-1835367047.png) 阅读全文
摘要:
import whisper import json import os import datetime import whisper.utils def transcription(audioPath: str, model: whisper.Whisper) -> list: ''' Trans 阅读全文
摘要:
算法助手 用户: 这个题目有什么好的思路吗?“Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two 阅读全文
摘要:
极其少有的我决定自己来写一篇。 我就是个脑残真的,我还在想要不要一个个pop,结果忘了这是一个BST……妈个鸡 附上我的傻逼代码 /* * @lc app=leetcode.cn id=669 lang=cpp * * [669] Trim a Binary Search Tree */ #incl 阅读全文