LC503 下一个更大元素II
int* nextGreaterElements(int* nums, int numsSize, int* returnSize){ int *ret = malloc(sizeof(int) * numsSize); int stack[numsSize]; int top = -1; for (int i = 0; i < numsSize …
LC85 最大矩形
int max_value(int *line, int len) { int max = 0, top = -1; int stack[len], right[len], left[len]; for (int i = 0; i < len; i++) { while (top >= 0 && line[i] < line[stack[top]]…
LC42 接雨水
//单调栈解法 int trap(int* height, int heightSize){ int stack[heightSize]; int area = 0, top = -1; for (int i = 0; i < heightSize; i++) { while ( top > 0 && height[i] > height[stac…
HJ26 字符串排序
#include int main() { char str[1001], ret[1001]; scanf("%s", str); int index = 0; for (char i = 'A'; i = 'a' && str[k] = 'A' && str[k]
HJ22 汽水瓶
#include int main() { int nums = 0, ret = 0; while (scanf("%d", &nums) != EOF) { if (nums == 0) { return 0; } else { while (nums >= 3) { ret+=(nums/3); nums = (nums / 3) + (nu…
HJ21 简单密码
#include int main() { char str[100]; scanf("%s", str); int i = 0; while (str[i] != '\0') { if (str[i] >= 'a' && str[i] = 'd' && str[i] = 'g' && str[i] = 'j' && str[i] = 'm' &&…
刷题-HJ20 密码验证合格程序
#include #include #include bool threeCharacters(char *str, int len) { int a = 0, b = 0, c = 0, d = 0; for (int i = 0; i < len; i++) { if (str[i] >= '0' && str[i] = 'a' && str[…
scanf读入两行以空格间隔的整数数组
#include int main() { int arr1[100], arr2[100]; int len1 = 0, len2=0; //用两个指针指向数组地址和长度地址,方便后面的代码复用 int *p1, *p2; p1 = arr1; p2 = &len1; char c; while (scanf("%d%c", p1++, &c) …
listary+putty
一键连接linux服务器的方法,listary 软件+putty软件,创建putty.exe的快捷键,修改属性中目标为 "D:\linux server\putty.exe" -ssh -l user_name -pw "password" -P port_number IP "D:\linux server\putty.exe" -ssh -l …