Leetcode / Leetcode
.odt231. Power of Two
public class Solution {
public bool IsPowerOfTwo(int n) {
return n > 0 && (n & (n - 1)) == 0;
}
}
1752. Check if Array Is Sorted and Rotated
public class Solution {
public bool Check(int[] nums) {
int count = 0;
int n = nums.Length;
for (int i = 0; i < n - 1; i++) {
if (nums[i] > nums[i + 1]) {
count++;
}
}
if (nums[n - 1] > nums[0]) {
count++;
}
return count <= 1;
}
}
3151. Special Array I
public class Solution {
public bool IsArraySpecial(int[] nums) {
for (int i = 0; i < nums.Length - 1; i++) {
if ((nums[i] % 2) == (nums[i + 1] % 2)) {
return false;
}
}
return true;
}
}
1800. Maximum Ascending Subarray Sum
public class Solution {
public int MaxAscendingSum(int[] nums) {
if (nums.Length == 0) return 0;
int currentSum = nums[0];
int maxSum = nums[0];
for (int i = 1; i < nums.Length; i++) {
if (nums[i] > nums[i - 1]) {
currentSum += nums[i];
} else {
maxSum = Math.Max(maxSum, currentSum);
currentSum = nums[i];
}
}
maxSum = Math.Max(maxSum, currentSum);
return maxSum;
}
}
50. Pow(x, n)
public class Solution {
public double MyPow(double x, int n) {
long N = n;
if (N < 0) {
x = 1 / x;
N = -N;
}
double result = 1;
double currentProduct = x;
for (long i = N; i > 0; i /= 2) {
if (i % 2 == 1) {
result *= currentProduct;
}
currentProduct *= currentProduct;
}
return result;
}
}
9. Palindrome Number
public class Solution {
public bool IsPalindrome(int x) {
if (x < 0) {
return false;
}
int original = x;
int reversed = 0;
while (x != 0) {
int digit = x % 10;
reversed = reversed * 10 + digit;
x /= 10;
}
return original == reversed;
}
}
