LeetCode //C - 65. Valid Number
nglish letters (both uppercase and lowercase), digits (0-9), plus ‘+’, minus ‘-’, or dot ‘.’. From: LeetCode Link: 65. Valid Number Solution: Ideas: 1. Flag Variables: numSeen: This flag indicates whether at ...
LeetCode //C - 60. Permutation Sequence
permutation sequence. Example 1: Example 2: Example 3: Constraints: 1 <= n <= 91 <= k <= n! From: LeetCode Link: 60. Permutation Sequence Solution: Ideas: Factorial Calculation: The function starts by calcu...
LeetCode //C - 7. Reverse Integer
: Example 3: Constraints: − 2 31 < = x < = 2 31 − 1 -2^{31} <= x <= 2^{31} - 1 −231<=x<=231−1 From: LeetCode Link: 7. Reverse Integer Solution: Ideas: 1. Initialize a result variable (reversed) to zero: This ...
LeetCode //C - 47. Permutations II
in any order. Example 1: Example 2: Constraints: 1 <= nums.length <= 8-10 <= nums[i] <= 10 From: LeetCode Link: 47. Permutations II Solution: Ideas: 1. Sorting the Array: The function starts by sorting the...
【leetcode面试经典150题】74. 填充每个节点的下一个右侧节点指针 II(C++)
【题目描述】 给定一个二叉树: struct Node { int val; Node *left; Node *right; Node *next;} 填充它的每个 next 指针,让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点,则将 next 指针设置为 NULL 。 初始状态下,所有 next 指针都被设置为 NULL 。 【示例一】 输入:root = [1,2,3,4,5,null,7]...
LeetCode //C - 38. Count and Say Medium Topics Companies
th} nth term of the count-and-say sequence. Example 1: Example 2: Constraints: 1 <= n <= 30 From: LeetCode Link: 38. Count and Say Solution: Ideas: Base Case: If n is 1, the function returns the string “1”,...
【Leetcode】vector刷题
🔥个人主页:Quitecoder 🔥专栏:Leetcode刷题 目录 1.只出现一次的数字2.杨辉三角3.删除有序数组中的重复项4.只出现一次的数字II5.只出现一次的数字III6.电话号码的字母组合 1.只出现一次的数字 这道题很简单,我们只需要遍历一遍数组,利用异或操作的性质(一个数与自身异或结果为0,任何数与0异或还是其本身) class Solution {public: int singleNumb...
LeetCode //C - 37. Sudoku Solver
= 9board[i][j] is a digit or ‘.’.It is guaranteed that the input board has only one solution. From: LeetCode Link: 29. Divide Two Integers Solution: Ideas: Sudoku Rules: To solve Sudoku, the code must respect...
LeetCode //C - 29. Divide Two Integers
2 31 − 1 -2^{31} <= dividend, divisor <= 2^{31} - 1 −231<=dividend,divisor<=231−1divisor != 0 From: LeetCode Link: 29. Divide Two Integers Solution: Ideas: Handle Signs: Compute the sign of the result based o...
【代码随想录刷题记录】LeetCode367有效的完全平方数
题目地址 1. 思路 这个题就用二分查找的思想,比LeetCode69x的平方根要简单一些,那个还要处理开平方不是整数的情况,这个直接就按左闭右闭,middle的平方是num就返回true,否则继续迭代二分直到找到middle的平方是num的情况返回true,或者找不到跳出循环返回false. 2. 代码 class Solution {public: //左闭右闭 bool isPerfectSquare(...