摘要:There is a function signFunc(x) that returns: 1 if x is positive. -1 if x is negative. 0 if x is equal to 0. You are given an integer array nums. Let  阅读全文
posted @ 2021-05-03 16:28 Makerr 阅读(8) 评论(0) 推荐(0) 编辑
摘要:You are given an array points where points[i] = [xi, yi] is the coordinates of the ith point on a 2D plane. Multiple points can have the same coordina 阅读全文
posted @ 2021-05-03 15:48 Makerr 阅读(13) 评论(0) 推荐(0) 编辑
摘要:Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nu 阅读全文
posted @ 2021-05-03 14:41 Makerr 阅读(8) 评论(0) 推荐(0) 编辑
摘要:C++提供了两种字符串的表示形式 C风格字符串 C++引入的string类型 1、延续C风格 字符串实际上是使用null字符\0终止的一维字符数组,因此字符数组大小比字符串的字符数多一个 声明和初始化创建一个字符串 char site[7] = {'R', 'U', 'N', 'O', 'O', ' 阅读全文
posted @ 2021-04-23 00:00 Makerr 阅读(4) 评论(0) 推荐(0) 编辑
摘要:源自:廖雪峰Git教程:https://www.liaoxuefeng.com/wiki/896043488029600 Git和GitHub是什么? Git是版本控制工具,GitHub是储存代码的网站 Git官方文档:https://git-scm.com/ 创建版本库/仓库,repository 阅读全文
posted @ 2021-04-21 17:00 Makerr 阅读(6) 评论(0) 推荐(0) 编辑
摘要:Given an m x n matrix, return all elements of the matrix in spiral order. Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [1,2,3,6,9,8,7, 阅读全文
posted @ 2021-04-21 10:12 Makerr 阅读(5) 评论(0) 推荐(0) 编辑
摘要:Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root n 阅读全文
posted @ 2021-04-21 08:53 Makerr 阅读(0) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the lef 阅读全文
posted @ 2021-04-20 15:45 Makerr 阅读(6) 评论(0) 推荐(0) 编辑
摘要:Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. Follow up: Could you implement a solution 阅读全文
posted @ 2021-04-20 14:39 Makerr 阅读(10) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return the sum of values of nodes with even-valued grandparent. (A grandparent of a node is the parent of its parent, if it exist 阅读全文
posted @ 2021-04-17 16:39 Makerr 阅读(11) 评论(0) 推荐(0) 编辑