Massbug/judge4c
2
0
Fork 0
mirror of https://github.com/massbug/judge4c.git synced 2025-05-18 07:16:34 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

bugs: fix bugs in coding template

Browse Source
This commit is contained in:
fly6516 2025-04-15 17:03:50 +08:00
commit 4a17552093
1 changed files with 21 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
prisma/seed.ts
View File

@ -415,14 +415,10 @@ string formatOutput(const vector<int>& res) {
return ss.str(); return ss.str();
} }
// Solution 类 // Solution 类声明
class Solution { class Solution {
public: public:
// 调用独立的算法函数 vector<int> twoSum(vector<int>& nums, int target);
vector<int> twoSum(vector<int>& nums, int target) {
// 算法部分留空，放在文件末尾
return {};
}
}; };
int main() { int main() {
@ -442,12 +438,10 @@ int main() {
return 0; return 0;
} }
vector<int> Solution::twoSum(vector<int>& nums, int target) {
vector<int> findTwoSum(const vector<int>& nums, int target) { return findTwoSum(nums, target);
return {}; // 在这里填充你的算法逻辑
} }
`, `,
}, },
], ],
@ -731,6 +725,12 @@ struct ListNode {
ListNode(int x, ListNode *next) : val(x), next(next) {} ListNode(int x, ListNode *next) : val(x), next(next) {}
}; };
// 声明 Solution 类
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2);
};
// 输入字符串 -> 链表 // 输入字符串 -> 链表
ListNode* createList(const string& line) { ListNode* createList(const string& line) {
ListNode dummy; ListNode dummy;
@ -1058,6 +1058,11 @@ double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Si
#include <algorithm> #include <algorithm>
using namespace std; using namespace std;
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2);
};
// 解析输入为整数数组 // 解析输入为整数数组
vector<int> parseIntArray(const string& line) { vector<int> parseIntArray(const string& line) {
string trimmed = line; string trimmed = line;
@ -1091,13 +1096,10 @@ int main() {
class Solution { double Solution::findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
return 0.0; // 临时返回值，待填充 return 0.0; // 临时返回值，待填充
} }
};
`, `,
}, },
], ],