xhstar

题解

/ 注册

全部文章 / 题解（共17篇）

题解 | #在字符串中找出连续最长的数字串#

// 找到所有的子串，并存入容器中 // 找子串的方法：遍历字符串，如果是数字就追加numStr，如果不是数字就清空，遍历过程中记录下最长子串的长度和所有子串 #include <iostream> #include <vector> #include <string&...

C++

2022-03-05

0 437

题解 | #二进制中1的个数#

class Solution { public: int NumberOf1(int n) { const int ref = 1 << 32; int counter = 0; while(n != 0) ...

C++

2021-10-14

0 355

题解 | #碰撞的蚂蚁#

class Ants { public: double antsCollision(int n) { //只有所有蚂蚁同向时才不会相撞 return 1 - pow(0.5, n-1); } };

C++

2021-10-13

2 537

题解 | #整数转化#

class Transform { public: int calcCost(int A, int B) { // A 和 B 异或后统计结果中的1的个数 int temp = A ^ B; int counter = 0; w...

C++

2021-10-13

0 473

题解 | #判断二叉树是否相等#

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ class Solution { public: /** * * @...

C++ 二叉树

2021-10-13

1 448

题解 | #平衡二叉树#

class Solution { public: bool IsBalanced_Solution(TreeNode* pRoot) { int leftDeepth = 0; int rightDeepth = 0; //空树直接返回true ...

C++

2021-10-03

0 387

题解 | #二叉树的深度#

/* struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) { } };*/ class ...

C++

2021-10-02

0 330

题解 | #二叉树的前序、中序、后序遍历#

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ class Solution { public: /** * * @...

C++

2021-10-02

0 418

题解 | #反转字符串#

class Solution {public: /** * 反转字符串 * @param str string字符串 * @return string字符串 */ string solve(string str) { for(int i = ...

2021-09-01

0 487

题解 | #判断链表中是否有环#

/** Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; /class Solution {public:...

2021-08-30

0 449