Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit046034e

Browse files
authored
Merge pull requestneetcode-gh#1040 from ritesh-dt/main
Add solution for 2 - Add Two Numbers, 739 - Daily Temperatures in C and update to 875 - Koko Eating Bananas
2 parents6b5c18d +5e0ec10 commit046034e

File tree

3 files changed

+108
-2
lines changed

3 files changed

+108
-2
lines changed

‎c/2-Add-Two-Numbers.c

Lines changed: 67 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,67 @@
1+
/*
2+
Given two linked lists where the nodes represent the digits of two numbers,
3+
add the numbers together and return the sum as a linked list.
4+
Ex. l1 = [2,4,3],
5+
l2 = [5,6,4] -> [7,0,8]
6+
7+
Traverse the linked lists and add the values of the corresponding nodes, if
8+
the sum is greater than 10, carry is present and will be added along with
9+
the next pair of digits. The lengths of the lists may differ, so check if
10+
the nodes are not null, before adding.
11+
12+
Time: O(max(m, n)) where m, n are lengths of l1 and l2 respectively
13+
Space: O(max(m, n))
14+
*/
15+
16+
/**
17+
* Definition for singly-linked list.
18+
* struct ListNode {
19+
* int val;
20+
* struct ListNode *next;
21+
* };
22+
*/
23+
structListNode*newNode(intval) {
24+
structListNode*node= (structListNode*)malloc(sizeof(structListNode));
25+
node->val=val;
26+
node->next=NULL;
27+
28+
returnnode;
29+
}
30+
31+
structListNode*addTwoNumbers(structListNode*l1,structListNode*l2){
32+
structListNode*head=NULL;
33+
structListNode*curr=NULL;
34+
35+
intcarry=0;
36+
37+
while (l1||l2) {
38+
intsum=carry;
39+
40+
if (l1)
41+
sum+=l1->val;
42+
if (l2)
43+
sum+=l2->val;
44+
45+
carry=sum/10;
46+
sum %=10;
47+
48+
if (head==NULL) {
49+
head=newNode(sum);
50+
curr=head;
51+
}else {
52+
curr->next=newNode(sum);
53+
curr=curr->next;
54+
}
55+
56+
if (l1)
57+
l1=l1->next;
58+
if (l2)
59+
l2=l2->next;
60+
}
61+
62+
if (carry)
63+
curr->next=newNode(carry);
64+
65+
66+
returnhead;
67+
}

‎c/739-Daily-Temperatures.c

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
/*
2+
Given an array of temperatures, find the number of days after which the
3+
temperature becomes more than temperature of that day.
4+
5+
Ex. temperatures = [73,74,75,71,69,72,76,73] -> [1,1,4,2,1,1,0,0]
6+
7+
Time: O(N)
8+
Space: O(1)
9+
*/
10+
11+
/**
12+
* Note: The returned array must be malloced, assume caller calls free().
13+
*/
14+
int*dailyTemperatures(int*temperatures,inttemperaturesSize,int*returnSize){
15+
*returnSize=temperaturesSize;
16+
17+
int*result= (int*)malloc(sizeof(int)*temperaturesSize);
18+
19+
// Initialize result array to zero
20+
for (inti=0;i<temperaturesSize;++i)result[i]=0;
21+
22+
23+
for (inti=temperaturesSize-1;i >=0;--i) {
24+
intj=i+1;
25+
26+
while (j<temperaturesSize&&temperatures[j] <=temperatures[i]) {
27+
if (result[j] <=0)
28+
break;
29+
j+=result[j];
30+
}
31+
32+
// If a day with higher temperature found, update result for that index
33+
if (j<temperaturesSize&&temperatures[j]>temperatures[i]) {
34+
result[i]=j-i;
35+
}
36+
}
37+
38+
returnresult;
39+
}

‎c/875-Koko-Eating-Bananas.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
/*
2-
Givena array of bananas piles containing differing amounts of bananas and
2+
Givenan array of bananas piles containing differing amounts of bananas and
33
'h' hours to eat all of them.
4-
Determine the minimum speed (i.e.numberbananas per-hour) possible.
4+
Determine the minimum speed (i.e.number of bananas per-hour) possible.
55
66
Ex. piles = [3,6,7,11], h = 8 -> 4
77

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp