3 wineandchord



TA的排名 7w+

stanford cs143 Compilers 7.2 First Sets

2020-05-31 07:49:25

stanford cs143 Compilers 7.1 PredictiveParsing

2020-05-30 07:46:05

NCE4 L6 The sporting spirit

Lesson 6 The sporting spirit 体育的精神sportingsport n. 可数 country sports 乡间体育活动 athletic sports 体育运动u.不可数 I’m found of sport.sporting activities 体育活动a sporting magazine 体育杂志the sporting world 体育世界It’s very sporting of you to give me such an advantage.

2020-05-30 07:26:59

stanford cs143 Compilers 6.3/4/5 Recursive Descent Parsing/Algorithm&Limitation/Left Recursion

2020-05-26 08:19:32

leetcode 21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Example:Input: 1->2->4, 1->3->4Output: 1->1->2->3->4->4用递归写/** * Definition for si

2020-05-24 23:24:06

leetcode 20. Valid Parentheses

Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of brackets.Open brackets must be closed in the correct order

2020-05-23 22:24:18

stanford cs143 Compilers 6.2 Abstract Syntax Trees

2020-05-23 22:15:27


这一章主要介绍 CUDA 编程模型的主要概念,详细描述在第三章:programming interface 里。文章目录KernelsThread HierarchyKernelsCUDA C++ 通过 kernel 的概念来对 C++ 进行扩展,其特点是:调用时会在 N 个不同的 CUDA 线程上并行执行 N 次。kernel 定义的时候用 __global__ 来指定,执行时的 CUDA 线程数通过 <<<...>>> 来进行配置(execution conf

2020-05-22 08:59:16

leetcode 19. Remove Nth Node From End of List 链表

Given a linked list, remove the n-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the linked list becomes 1->2->3->5.Note:Given n wi

2020-05-22 08:50:17

stanford cs143 Compilers 6.1 Error Handling

2020-05-22 08:04:04

泛函分析 第二章 2 完备的赋范空间 (2)

2020-05-22 07:47:46

leetcode 18. 4Sum 双指针

Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:The solution set must not contain duplicate q

2020-05-21 12:02:39

stanford cs143 Compilers 5.3/4 Derivations/Ambiguity

2020-05-21 09:33:37

泛函分析 第二章 2 完备的赋范空间 (1)

a.e 是几乎处处

2020-05-21 09:09:07

mit 6.824 Distributed Systems L2 RPC and Threads

6.824 2020 Lecture 2: Infrastructure: RPC and threadsToday:Threads and RPC in Go, with an eye towards the labs文章目录Why Go?ThreadsThread = "thread of execution"Why threads?Is there an alternative to threads?Threading challenges:Why Go?good support for t

2020-05-20 15:15:56

leetcode 17. Letter Combinations of a Phone Number

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.Examp

2020-05-20 10:38:26

stanford cs143 Compilers 5.2 Context-Free Grammars

2020-05-20 08:25:44

泛函分析 第二章 1 赋范空间的基本概念

式 2.1.2 叫做平移不变性赋范空间是线性空间,因此一般的距离空间并不一定是赋范空间

2020-05-20 08:09:16

A Tour of Go 笔记

https://tour.golang.org/list文章目录BasicsPackagesImportsExported namesFunctionsMultiple resultsNamed return valuesVariablesVariables with initializersShort variable declarationsBasic typesZero valuesType conversionsType inferenceConstantsNumeric ConstantsBa

2020-05-19 20:18:17

leetcode 16. 3Sum Closest

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.Example:Given array nums = [

2020-05-19 19:17:15


勋章 我的勋章
  • 持之以恒
  • 勤写标兵Lv4
  • 学习力
    《原力计划【第二季】》第一期主题勋章 ,第一期活动已经结束啦,小伙伴们可以去参加第二期打卡挑战活动获取更多勋章哦。