mfocko/LeetCode
mfocko/LeetCode
1
0
Fork 0
Code Issues Pull requests Wiki Activity

chore: format sources

Browse source 
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2022-07-23 13:12:05 +02:00
parent b59f949d8f
commit 917aecb33f
Signed by: mfocko
GPG key ID: 7C47D46246790496
2 changed files with 13 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
problems/can-place-flowers.cpp
View file

@ -4,8 +4,9 @@
using std::vector; using std::vector;
class Solution { class Solution {
public: public:
bool canPlaceFlowers(vector<int> &flowerbed, int n) { bool canPlaceFlowers(vector<int>& flowerbed, int n)
{
int count = 0; int count = 0;
int left = 0, right; int left = 0, right;
@ -24,20 +25,21 @@ class Solution {
} }
}; };
int main() { int main()
{
Solution s; Solution s;
std::vector flowers{1, 0, 0, 0, 1}; std::vector flowers { 1, 0, 0, 0, 1 };
assert(s.canPlaceFlowers(flowers, 1)); assert(s.canPlaceFlowers(flowers, 1));
assert(!s.canPlaceFlowers(flowers, 2)); assert(!s.canPlaceFlowers(flowers, 2));
flowers = {1, 0, 0, 0, 0, 1}; flowers = { 1, 0, 0, 0, 0, 1 };
assert(!s.canPlaceFlowers(flowers, 2)); assert(!s.canPlaceFlowers(flowers, 2));
flowers = {1, 0, 0, 0, 1, 0, 0}; flowers = { 1, 0, 0, 0, 1, 0, 0 };
assert(s.canPlaceFlowers(flowers, 2)); assert(s.canPlaceFlowers(flowers, 2));
flowers = {0, 0, 1, 0, 0}; flowers = { 0, 0, 1, 0, 0 };
assert(s.canPlaceFlowers(flowers, 1)); assert(s.canPlaceFlowers(flowers, 1));
return 0; return 0;

7
problems/middle-of-the-linked-list.cpp
View file

@ -10,10 +10,11 @@
*/ */
class Solution { class Solution {
public: public:
ListNode* middleNode(ListNode* head) { ListNode* middleNode(ListNode* head)
{
auto slow = head; auto slow = head;
auto fast = head ? head->next : nullptr; auto fast = head ? head->next : nullptr;
while (fast != nullptr) { while (fast != nullptr) {
slow = slow->next; slow = slow->next;
fast = fast->next; fast = fast->next;
@ -21,7 +22,7 @@ public:
fast = fast->next; fast = fast->next;
} }
} }
return slow; return slow;
} }
}; };