力扣练习661-

661. 图片平滑器

vector<vector<int>> imageSmoother(vector<vector<int>>& img)
{
	vector<vector<int>> ans(img.size(), vector<int>(img[0].size()));

	for (int i = 0; i < img.size(); ++i)
	{
		for (int j = 0; j < img[0].size(); ++j)
		{
			int sum = 0;
			int neibor = 0;
			neibor++;
			sum += img[i][j];
			if (j > 0 && j < img[0].size())//have left
			{
				neibor++;
				sum += img[i][j - 1];
			}
			if (j < img[0].size() - 1)//have right
			{
				neibor++;
				sum += img[i][j + 1];
			}
			if (i>0&&i<img.size())//have top
			{
				neibor++;
				sum += img[i - 1][j];
			}
			if (i < img.size() - 1)//have bottom
			{
				neibor++;
				sum += img[i + 1][j];
			}
			if (j > 0 && j < img[0].size() && i>0 && i < img.size())
			{
				neibor++;
				sum += img[i - 1][j - 1];
			}
			if (j > 0 && j < img[0].size() && i < img.size() - 1)
			{
				neibor++;
				sum += img[i + 1][j - 1];
			}
			if (j < img[0].size() - 1 && i>0 && i < img.size())
			{
				neibor++;
				sum += img[i - 1][j + 1];
			}
			if (j < img[0].size() - 1 && i < img.size() - 1)
			{
				neibor++;
				sum += img[i + 1][j + 1];
			}
			ans[i][j] = sum / neibor;
		}
	} 
	return ans;
}

674. 最长连续递增序列

int findLengthOfLCIS(vector<int>& nums) {
int ans = 1;
	int length = 1;
	for (int i = 1; i < nums.size(); ++i)
	{
		if (nums[i] > nums[i - 1])
		{
			length++;
			ans = length > ans ? length : ans;
		}
		else
			length = 1;
	}
	re

682. 棒球比赛分数记录

int calPoints(vector<string>& ops) {
	vector<int> ans;
	for (int i = 0; i < ops.size(); ++i)
	{
		if (ops[i] == "+")
			ans.push_back(ans[ans.size() - 1] + ans[ans.size() - 2]);
		else if (ops[i] == "D")
			ans.push_back(ans.back() * 2);
		else if (ops[i] == "C")
			ans.pop_back();
		else ans.push_back(atoi(ops[i].c_str()));
	}
	int result = 0;
	for (int i = 0; i < ans.size(); ++i)
		result += ans[i];
	return result;
    }

690. 员工的重要性

unordered_map<int, Employee*> mp;

int dfsImportance(int id)
{
	Employee* em = mp[id];
	int total = em->importance;
	for (int i = 0; i < em->subordinates.size(); ++i)
		total += dfsImportance(em->subordinates[i]);
	return total;
}

int getImportance(vector<Employee*> employees, int id)
{
	for (int i = 0; i < employees.size(); ++i)
		mp[employees[i]->id] = employees[i];
	return dfsImportance(id);
}

700. 二叉搜索树中的搜索

TreeNode* searchBST(TreeNode* root, int val)
{//迭代
	if (root->val == val) return root;
	TreeNode* cur = root;
	while (cur->val != val)
	{
		if (cur->val > val)
			cur = cur->left;
		else if (cur->val < val)
			cur = cur->right;
		if (cur == NULL) return NULL;
		if (cur->val == val)
			return cur;
	}
	return NULL;
}
TreeNode* searchBST(TreeNode* root, int val)
{//递归
	if (root == NULL)return NULL;
	else if (root->val == val) return root;
	else if (root->val > val) return searchBST(root->left, val);
	else return searchBST(root->right, val);
}