剑指offer

1、在一个二维数组中（每个一维数组的长度相同），每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。

[

 [1,2,8,9],
 [2,4,9,12],
 [4,7,10,13],
 [6,8,11,15]

]

题解：

#include<iostream>
#include <vector>
using namespace std;

class Solution {
public:
    bool fun(vector<vector<int>> numbers,int target) {
        if (numbers.empty() || numbers[0].empty()) return false;
        int col = numbers[0].size();   //4
        int row = numbers.size();    //5
        cout << row << " " << col << endl;
        int r = col - 1, c = 0;
        while (r >= 0 && c < row) {
            if (numbers[c][r] > target) {
                r--;
            }
            else if (numbers[c][r] < target) {
                c++;
            }
            else return true;
        }
        return false;
    }
};

int main() {
    vector<vector<int>> numbers = { {1, 2, 8, 9} ,{2, 4, 9, 12},{4, 7, 10, 13},{6, 8, 11, 15},{8, 9, 15, 20} };
    int k = 3;
    Solution s;
    bool res = s.fun(numbers,k);
    cout << res;
    
}

2、请实现一个函数，将一个字符串中的每个空格替换成“%20”。例如，当字符串为We Are Happy.则经过替换之后的字符串为We%20Are%20Happy。

#include<iostream>
#include <vector>
using namespace std;

class Solution {
public:
    void fun(string& str,int len) {
        int splitNums = 0;
        for (int i = 0; i < len; i++) {
            if (str[i] == ' ') {
                splitNums++;
            }
        }
        str.resize(len + 2 * splitNums);
        for (int i = str.size()-1; i >=0; i--) {
            if (str[len-1] != ' ') {
                str[i] = str[len-1];
            }
            else {
                str[i] = '0';
                str[i - 1] = '2';
                str[i - 2] = '%';
                i = i - 2;
            }
            len--;
        }
    }
};

int main() {
    string str = "We Are Happy";
    int len = str.size();
    Solution s;
    s.fun(str,len);
    cout << str;
    
}

3、输入一个链表，按链表从尾到头的顺序返回一个ArrayList。

#include<iostream>
#include <vector>
using namespace std;

struct ListNode {
    int val;
    ListNode* next;
    ListNode(int _val) :val(_val), next(nullptr) {}
};
ListNode* reverse1(ListNode* head) {
    ListNode* prev = nullptr;
    ListNode* cur = head;
    while (cur) {
        ListNode* tmp = cur->next;
        cur->next = prev;
        prev = cur;
        cur = tmp;
    }
    return prev;
}
vector<int> readListNode(ListNode* head) {
    /*ListNode* revHead = reverse1(head);
    vector<int> res;
    while (revHead) {
        res.push_back(revHead->val);
        revHead = revHead->next;
    }
    return res;*/
    vector<int> res;
    while (head) {
        res.push_back(head->val);
        head = head->next;
    }
    reverse(res.begin(), res.end());
    return res;
}

int main() {
    cout << "hello world!" << endl;
    ListNode* node1 = new ListNode(1);
    ListNode* node2 = new ListNode(2);
    ListNode* node3 = new ListNode(4);

    node1->next = node2;
    node2->next = node3;
    node3->next = nullptr;

    vector<int> ret = readListNode(node1);
    for (int i : ret) {
        cout << i << " ";
    }
}

4、No4、重建二叉树 | 阿秀的学习笔记

5、用两个栈实现一个队列，完成队列的Push和Pop操作。 队列中的元素为int类型

class Solution
{
public:
    void push(int node) {
        stack1.push(node);
    }

    int pop() {
        while (stack2.empty()) {
            while (!stack1.empty()) {
                stack2.push(stack1.top());
                stack1.pop();
            }
        }
        int value = stack2.top();
        stack2.pop();
        return value;
        
    
    }

private:
    stack<int> stack1;
    stack<int> stack2;
};

6、把一个数组最开始的若干个元素搬到数组的末尾，我们称之为数组的旋转。

输入一个非递减排序的数组的一个旋转，输出旋转数组的最小元素。例如数组{3,4,5,1,2}为{1,2,3,4,5}的一个旋转，该数组的最小值为1。

NOTE：给出的所有元素都大于0，若数组大小为0，请返回0。

int minNumOfArray(vector<int> num) {
	int minNum = num[0];
	for (int i = 1; i < num.size(); i++) {
		if (num[i] < minNum) {
			minNum = num[i];
		}
	}
	return minNum;
}

7、现在要求输入一个整数n，请你输出斐波那契数列的第n项（从0开始，第0项为0，第1项是1）。

int fibonacci(int num) {
	if (num == 0) return 0;
	if (num == 1) return 1;
	int first = 0, second = 1, third;
	for (int i = 2; i <= num; i++) {
		third = first + second;
		first = second;
		second = third;
	}
	return third;
}