739. 每日温度

typedef int Item;
typedef struct stack_type* Stack;

struct node                   
{
	Item val;
	struct node* next;
};
struct stack_type             
{
	struct node* top;
};

static void terminate(const char* message)
{
	printf("%s\n", message);
	exit(EXIT_FAILURE);
}

bool is_empty(Stack s)
{
	if (s->top == NULL)
	{
		return true;
	}
	else
	{
		return false;
	}
}

Stack create(void)
{
	Stack s = malloc(sizeof(struct stack_type));
	if (s == NULL)
	{
		printf("Error: malloc failed in create.\n");
		exit(EXIT_FAILURE);
	}

	s->top = NULL;
	return s;                      
}

void push(Stack s, Item n)
{
	struct node* new_node = malloc(sizeof(struct node));
	if (new_node == NULL)
	{
		terminate("Error: malloc failed in push.");
	}

	new_node->val = n;
	new_node->next = s->top;
	s->top = new_node;
}

Item pop(Stack s)
{
	struct node* old_top;
	Item n;

	if (is_empty(s) == true)
	{
		terminate("Error in pop: stack is empty.");
	}

	old_top = s->top;
	n = old_top->val;
	s->top = old_top->next;
	free(old_top);
	return n;
}

int* dailyTemperatures(int* temperatures, int temperaturesSize, int* returnSize)
{
	Stack s = create();
	int* ans = malloc(temperaturesSize * sizeof(int));
	(*returnSize) = temperaturesSize;

	for (int i = 0; i < temperaturesSize; i++)
	{
		ans[i] = 0;
	}

	push(s, 0);
	for (int i = 1; i < temperaturesSize; i++)
	{
		while (is_empty(s) == false && temperatures[i] > temperatures[s->top->val])
		{
			int n = s->top->val;
			ans[n] = i - pop(s);
		}
		push(s, i);
	}

	return ans;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值