3 Bungehurst

尚未进行身份认证

我要认证

极限尤可突破,至臻亦不可止

等级
TA的排名 5w+

TLC549与STM32通信实验

【课程设计】TLC549与STM32通信实验系统框图接口板设计TLC549管脚定义原理图通信时序可以看到,时序很简单。只需要给出时钟信号,然后读取返回数据即可。STM32通信程序uint8_t Get_549_Data(void){ uint8_t temp = 0x00; CS = 1; CLOCK = 0; CS = 0; delay_us(2); for(int i = 0; i < 8; i++){ temp <<= 1; temp

2020-07-09 23:34:20

从零搭建麦轮小车

从零搭建麦轮小车绘制3D模型(Solidworks建模)全图部件图电机共轴器麦克纳姆轮实物图硬件电路搭建驱动器选用的是BLDC300W24V直流无刷控制器,有霍尔版本。通过PWM占空比控制速度接线示意图驱动器端电机端实物连接图...

2020-07-09 12:33:19

卡尔曼滤波算法

卡尔曼滤波算法非常喜欢这个配图,先贴出来出处:http://www.bzarg.com/p/how-a-kalman-filter-works-in-pictures/卡尔曼滤波的五个公式

2020-06-01 15:27:49

RoboMaster开发板 C型

RoboMaster开发板 C型接口说明注意,开发板上UART接口编号与STM32不对应!!!Micro USBSWD烧录接口UART注意,该接口只支持3/5V电平,RS485/RS232需要外加电平转换芯片。DBUS波特率100kbpsCAN最大传输速度1MADC电压检测惯性单元BMI088 六轴陀螺仪加速度计SPI通信,最大10MHZ恒温电路IST8310 磁力计IIC通信,最大400KHZ,地址0x0EFPC 数字摄像头DCMI,F

2020-05-31 14:10:14

Keil修改配色文件【vscode配色】

Keil修改配色文件【vscode配色】找到目录:\Keil_v5\UV4\文件名:global.prop替换原有文件即可。配色方案如下所示:global.prop文件内容如下:# properties for all file typesindent.automatic=1virtual.space=0view.whitespace=0view.endofline=0code.page=65001caretline.visible=1highlight.matchingbrac

2020-05-28 23:14:52

[Easy] 268. Missing Number

268. Missing NumberGiven an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.Example 1:Input: [3,0,1]Output: 2Example 2:Input: [9,6,4,2,3,5,7,0,1]Output: 8SolutionBit OperationRuntime: 36

2020-05-22 09:09:28

[Easy] 263. Ugly Number

263. Ugly NumberWrite a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.Example 1:Input: 6Output: trueExplanation: 6 = 2 × 3Example 2:Input: 8Output: trueExplan

2020-05-22 08:22:27

[Easy] 258. Add Digits

258. Add DigitsGiven a non-negative integer num, repeatedly add all its digits until the result has only one digit.Example:Input: 38Output: 2 Explanation: The process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.

2020-05-22 07:21:23

[Easy] 257. Binary Tree Paths

257. Binary Tree PathsGiven a binary tree, return all root-to-leaf paths.Note: A leaf is a node with no children.Example:Input: 1 / \2 3 \ 5Output: ["1->2->5", "1->3"]SolutionDFSRuntime: 4 ms, faster than 79.62% of C++ onl

2020-05-21 07:23:01

[Easy] 242. Valid Anagram

242. Valid AnagramGiven two strings s and t , write a function to determine if t is an anagram of s.Example 1:Input: s = "anagram", t = "nagaram"Output: trueExample 2:Input: s = "rat", t = "car"Output: falseNote:You may assume the string contain

2020-05-21 06:51:51

[Easy] 237. Delete Node in a Linked List

237. Delete Node in a Linked ListWrite a function to delete a node (except the tail) in a singly linked list, given only access to that node.Given linked list – head = [4,5,1,9], which looks like following:Example 1:Input: head = [4,5,1,9], node = 5O

2020-05-21 06:39:15

[Easy] 235. Lowest Common Ancestor of a Binary Search Tree

235. Lowest Common Ancestor of a Binary Search TreeGiven a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two n

2020-05-20 10:50:59

[Easy] 234. Palindrome Linked List

234. Palindrome Linked ListGiven a singly linked list, determine if it is a palindrome.Example 1:Input: 1->2Output: falseExample 2:Input: 1->2->2->1Output: trueSolutionRecursiveRuntime: 36 ms, faster than 13.84% of C++ online submis

2020-05-20 08:34:20

[Easy] 232. Implement Queue using Stacks

232. Implement Queue using StacksImplement the following operations of a queue using stacks.push(x) – Push element x to the back of queue.pop() – Removes the element from in front of queue.peek() – Get the front element.empty() – Return whether the qu

2020-05-19 09:39:42

[Easy] 231. Power of Two

231. Power of TwoGiven an integer, write a function to determine if it is a power of two.Example 1:Input: 1Output: true Explanation: 20 = 1Example 2:Input: 16Output: trueExplanation: 24 = 16Example 3:Input: 218Output: falseSolutionBrute Fo

2020-05-19 09:02:26

[Easy] 226. Invert Binary Tree

226. Invert Binary TreeInvert a binary tree.Example:Input: 4 / \ 2 7 / \ / \1 3 6 9Output: 4 / \ 7 2 / \ / \9 6 3 1SolutionRuntime: 8 ms, faster than 38.86% of C++ online submissions for Invert Binar

2020-05-19 08:40:01

[Easy] 225. Implement Stack using Queues

225. Implement Stack using QueuesImplement the following operations of a stack using queues.push(x) – Push element x onto stack.pop() – Removes the element on top of the stack.top() – Get the top element.empty() – Return whether the stack is empty.Ex

2020-05-19 08:11:08

[Easy] 219. Contains Duplicate II

219. Contains Duplicate IIGiven an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.Example 1:Input: nums = [1,2

2020-05-18 09:42:37

[Easy] 217. Contains Duplicate

217. Contains DuplicateGiven an array of integers, find if the array contains any duplicates.Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.Example 1:Input: [1,

2020-05-17 09:44:23

[Easy] 206. Reverse Linked List

206. Reverse Linked ListReverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLSolutionStackRuntime: 8 ms, faster than 79.52% of C++ online submissions for Reverse Linked List.Memory

2020-05-17 09:39:15

查看更多

勋章 我的勋章
  • 签到新秀
    签到新秀
    累计签到获取,不积跬步,无以至千里,继续坚持!
  • 阅读者勋章Lv1
    阅读者勋章Lv1
    授予在CSDN APP累计阅读博文达到3天的你,是你的坚持与努力,使你超越了昨天的自己。
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!
  • 勤写标兵Lv4
    勤写标兵Lv4
    授予每个自然周发布9篇以上(包括9篇)原创IT博文的用户。本勋章将于次周周三上午根据用户上周的博文发布情况由系统自动颁发。
  • 学习力
    学习力
    《原力计划【第二季】》第一期主题勋章 ,第一期活动已经结束啦,小伙伴们可以去参加第二期打卡挑战活动获取更多勋章哦。
  • 分享学徒
    分享学徒
    成功上传1个资源即可获取