case when then的用法-leetcode交换工资

### LeetCode C++ Problems and Solutions #### Square Root Calculation Implementation For calculating the square root of a number `x` on LeetCode using C++, one approach involves utilizing mathematical functions such as logarithms and exponentials. The implementation checks if `x` is zero to handle edge cases directly returning 0 when true. For other values, it calculates an approximate integer value by taking half the natural logarithm of `x`, then applying exponential function[^1]. Verification ensures that `(ans + 1)` squared does not exceed `x`; otherwise, returns `ans`. ```cpp class Solution { public: int mySqrt(int x) { if (x == 0) { return 0; } int ans = exp(0.5 * log(x)); return ((long long)(ans + 1) * (ans + 1) <= x ? ans + 1 : ans); } }; ``` #### Array Rotation Methodology Regarding array rotation within LeetCode's problem set implemented in C++, this solution rotates elements efficiently without additional space complexity beyond O(1). By reversing parts of the vector after computing effective rotations needed (`k % size`), three reversals achieve desired outcome: full reversal followed by segment-specific ones up until index `k` and from `k` onwards respectively[^2]. ```cpp #include <iostream> #include <vector> using namespace std; class Solution { public: void rotate(vector<int>& nums, int k) { int n = nums.size(); k %= n; reverse(nums.begin(), nums.end()); reverse(nums.begin(), nums.begin() + k); reverse(nums.begin() + k, nums.end()); } }; // Note: Test case verification code omitted for brevity. ``` #### Daily Temperatures Problem Approach In solving the "Daily Temperatures" challenge presented at LeetCode with C language adaptation available but focusing here conceptually similar methods apply including stack-based algorithms or optimized iteration techniques aimed at minimizing node traversals while maintaining efficiency standards expected during interviews preparation phase[^3].