mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-21 21:11:57 +03:00
Code Issues Packages Projects Releases Wiki Activity

feat: add Rectangle Area LeetCode problem (#1147)

Browse Source
This commit is contained in:
Alexander Pantyukhin 2022-11-22 01:09:27 +04:00 committed by GitHub
parent 0bcabd6897
commit a2b1983e57
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 25 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
leetcode/DIRECTORY.md
View File

@ -56,6 +56,7 @@
| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [C](./src/206.c) | Easy |
| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [C](./src/215.c) | Medium |
| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [C](./src/217.c) | Easy |
| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area/) | [C](./src/223.c) | Medium |
| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [C](./src/226.c) | Easy |
| 231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C](./src/231.c) | Easy |
| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [C](./src/234.c) | Easy |

24
leetcode/src/223.c Normal file
View File

@ -0,0 +1,24 @@
#define min(X, Y) ((X) < (Y) ? (X) : (Y))
int intersectionSize(int p11, int p12, int p21, int p22){
if (p11 >= p22 || p12 <= p21){
return 0;
}
if (p11 < p21){
return min(p12 - p21, p22 - p21);
}
return min(p22 - p11, p12 - p11);
}
// Calculation area of the A, then area of the B then minus intersection of A and B
// Runtime: O(1)
// Space: O(1)
int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2){
int areaA = (ay2 - ay1) * (ax2 - ax1);
int areaB = (by2 - by1) * (bx2 - bx1);
int areaInteresection = intersectionSize(ax1, ax2, bx1, bx2) * intersectionSize(ay1, ay2, by1, by2);
return areaA + areaB - areaInteresection;
}