OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

clang-format and clang-tidy fixes for b24ca86e

Browse Source
This commit is contained in:
David 2022-09-23 13:28:49 +00:00
parent bcf2f69c9f
commit 613a55174f
1 changed files with 8 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
search/median_search2.cpp
View File

@ -28,10 +28,10 @@
* Definition for singly-linked list.
*/
struct ListNode {
int val; ///< the value stored in the node
ListNode* next; ///< pointer to the next node
ListNode() : val(0), next(nullptr) {} ///< default constructor
ListNode(int x)
int val{0}; ///< the value stored in the node
ListNode* next{nullptr}; ///< pointer to the next node
ListNode() {} ///< default constructor
explicit ListNode(int x)
: val(x),
next(nullptr) {} ///< constructor with value for node->val provided
ListNode(int x, ListNode* next)
@ -57,11 +57,12 @@ namespace median_search2 {
* @returns Median node of the linked list.
*/
ListNode* middleNode(ListNode* head) {
if (!head)
if (!head) {
return nullptr;
}
// Fast and slow pointers
ListNode* fastptr;
ListNode* fastptr = nullptr;
ListNode* slowptr = fastptr = head;
// fast jumps 2 while slow jumps 1
@ -79,7 +80,7 @@ ListNode* middleNode(ListNode* head) {
* @returns void
*/
static void test() {
ListNode* head = new ListNode;
auto* head = new ListNode;
head->val = 1;
ListNode* temp1 = head;