leetcode刷题数学运算及其他 C++（剑指offer10个）

最新推荐文章于 2022-10-24 20:30:00 发布

along_0

最新推荐文章于 2022-10-24 20:30:00 发布

阅读量227

点赞数

分类专栏： leetcode 刷题 C++

本文链接：https://blog.csdn.net/yiluyouni19/article/details/115150167

版权

leetcode 刷题 C++ 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

剑指 Offer 16. 数值的整数次方 50. Pow(x, n)

剑指 Offer 17. 打印从1到最大的n位数太难了

54. 螺旋矩阵剑指 Offer 29. 顺时针打印矩阵

59. 螺旋矩阵 II

剑指 Offer 43. 1～n 整数中 1 出现的次数数学法

剑指 Offer 44. 数字序列中某一位的数字数学

剑指 Offer 61. 扑克牌中的顺子排序 + 遍历

剑指 Offer 64. 求1+2+…+n 递归逻辑运算符

剑指 Offer 65. 不用加减乘除做加法负数补码还是没看懂

剑指Offer（五十四）：字符流中第一个不重复的字符 leetcode上没找到，在拓跋阿秀上看到的

unsigned int 0～4294967295
int -2147483648～2147483647
unsigned long 0～4294967295
long -2147483648～2147483647
long long的最大值：9223372036854775807
long long的最小值：-9223372036854775808
unsigned long long的最大值：18446744073709551615

__int64的最大值：9223372036854775807
__int64的最小值：-9223372036854775808
unsigned __int64的最大值：18446744073709551615

剑指 Offer 16. 数值的整数次方 50. Pow(x, n)

难度中等633

实现 pow(x, n) ，即计算 x 的 n 次幂函数（即，xn）。

递归提前铺垫通过一道面试题目，讲一讲递归算法的时间复杂度！

class Solution {
public:
    double quickMul(double x, long long N) {
        if (N == 0) {
            return 1.0;
        }
        double y = quickMul(x, N / 2);
        return N % 2 == 0 ? y * y : y * y * x;
    }

    double myPow(double x, int n) {
        long long N = n;
        return N >= 0 ? quickMul(x, N) : 1.0 / quickMul(x, -N);
    }
};

//n=-2147483648的时候，-n就是2147483648，超出了2的31次方-1的范围，所以N要用long long .

剑指 Offer 17. 打印从1到最大的n位数太难了

https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/solution/jian-zhi-offer-17-da-yin-cong-1dao-zui-d-ngm4/

https://zhuanlan.zhihu.com/p/364571011

https://www.bilibili.com/video/BV1nX4y1M7FM?from=search&seid=17493246989948908995

https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/solution/fei-zi-jie-ti-ku-jian-17-jian-dan-da-yin-cong-1dao/

54. 螺旋矩阵 剑指 Offer 29. 顺时针打印矩阵

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        if (matrix.size() == 0 || matrix[0].size() == 0) {
            return {};
        }

        int rows = matrix.size(), columns = matrix[0].size();
        vector<int> order;
        int left = 0, right = columns - 1, top = 0, bottom = rows - 1;
        while (left <= right && top <= bottom) {
            for (int column = left; column <= right; column++) {
                order.push_back(matrix[top][column]);
            }
            for (int row = top + 1; row <= bottom; row++) {
                order.push_back(matrix[row][right]);
            }
            if (left < right && top < bottom) {
                for (int column = right - 1; column > left; column--) {
                    order.push_back(matrix[bottom][column]);
                }
                for (int row = bottom; row > top; row--) {
                    order.push_back(matrix[row][left]);
                }
            }
            left++;
            right--;
            top++;
            bottom--;
        }
        return order;
    }
};

59. 螺旋矩阵 II

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        int num = 1;
        vector<vector<int>> matrix(n, vector<int>(n));
        int left = 0, right = n - 1, top = 0, bottom = n - 1;
        while (left <= right && top <= bottom) {
            for (int column = left; column <= right; column++) {
                matrix[top][column] = num;
                num++;
            }
            for (int row = top + 1; row <= bottom; row++) {
                matrix[row][right] = num;
                num++;
            }
            if (left < right && top < bottom) {
                for (int column = right - 1; column > left; column--) {
                    matrix[bottom][column] = num;
                    num++;
                }
                for (int row = bottom; row > top; row--) {
                    matrix[row][left] = num;
                    num++;
                }
            }
            left++;
            right--;
            top++;
            bottom--;
        }
        return matrix;
    }
};

剑指 Offer 43. 1～n 整数中 1 出现的次数数学法

//LL 表示long long，64位长整型，C++11标准中新定义的，用法就是范围更大的整型
int countDigitOne(int n)
{
    int countr = 0;
    for (long long i = 1; i <= n; i *= 10) {
        long long divider = i * 10;
        countr += (n / divider) * i + min(max(n % divider - i + 1, 0LL), i);
    }
    return countr;
}

剑指 Offer 44. 数字序列中某一位的数字数学

主站 400 题相同：https://leetcode-cn.com/problems/nth-digit/

https://leetcode-cn.com/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/solution/zhe-shi-yi-dao-shu-xue-ti-ge-zhao-gui-lu-by-z1m/

class Solution {
public:
    int findNthDigit(int n) {
        // 计算该数字由几位数字组成，由1位：digits = 1；2位：digits = 2...
        long base = 9,digits = 1;
        while (n - base * digits > 0){
            n -= base * digits;
            base *= 10;
            digits ++;
        }

        // 计算真实代表的数字是多少
        int idx = n % digits;  // 注意由于上面的计算，n现在表示digits位数的第n个数字
        if (idx == 0)idx = digits;
        long number = 1;
        for (int i = 1;i < digits;i++)
            number *= 10;
        number += (idx == digits)? n/digits - 1:n/digits;

        // 从真实的数字中找到我们想要的那个数字
        for (int i=idx;i<digits;i++) number /= 10;
        return number % 10;
    }
};

剑指 Offer 61. 扑克牌中的顺子排序 + 遍历

https://leetcode-cn.com/problems/bu-ke-pai-zhong-de-shun-zi-lcof/solution/mian-shi-ti-61-bu-ke-pai-zhong-de-shun-zi-ji-he-se/

class Solution {
public:
    bool isStraight(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int joker = 0;
        for(int i = 0; i < 4; i++) {
            if(nums[i] == 0) joker++; // 统计大小王数量
            else if(nums[i] == nums[i + 1]) return false; // 若有重复，提前返回 false
        }
        return nums[4] - nums[joker] < 5; // 最大牌 - 最小牌 < 5 则可构成顺子   
    }
};

剑指 Offer 64. 求1+2+…+n 递归逻辑运算符

class Solution {
public:
    int sumNums(int n) {
        n && (n += sumNums(n-1));
        return n;
    }
};

剑指 Offer 65. 不用加减乘除做加法负数补码还是没看懂

https://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking&tab=answerKey


class Solution {
public:
    int add(int a, int b) {
        while(b!=0){
            int sum = a ^ b ;
             // 负数左移会在低位补1，所以转化为无符号整数
            int carry = ((unsigned int)(a & b))<<1;
            a = sum;
            b= carry;
        }
        return a;
    }
};

剑指Offer（五十四）：字符流中第一个不重复的字符 leetcode上没找到，在拓跋阿秀上看到的

class Solution {
public: 
    //Insert one char from stringstream 
    void Insert(char ch)
     { 
        v.push_back(ch); 
        result[ch]++; 
    }
        //return the first appearence once char in current stringstream 
    char FirstAppearingOnce()
         { for (auto &ch:v) 
            {
             if (result[ch] == 1) return ch; 
                }
            return '#';
         }
       vector<char> v; 
    unordered_map<char,int> result; 
};