2020.03专题
2020.03.03
总是吃着碗里的看着锅里的，怎么都不香怎么成，要学的东西多，一步步来，慢慢都学 人情世故，精益，敏捷，管理，云 不要太想着未来 太远了没谱，走好现在的每一步，努力走好每一步。
206. Reverse Linked List（Leetcode每日一题-2020.03.02）
Problem Reverse a singly linked list. Example Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Solution Solution1 三指针迭代 /*** Definition for singly-linked list.* struct ListNode {*
面试题40. 最小的k个数(Leetcode每日一题-2020.03.20)
Problem 输入整数数组 arr ，找出其中最小的 k 个数。例如，输入4、5、1、6、2、7、3、8这8个数字，则最小的4个数字是1、2、3、4。 限制： 0 <= k <= arr.length <= 10000 0 <= arr[i] <= 10000 Example1 输入：arr = [3,2,1], k = 2 输出：[1,2] 或者 [2,1] Example2
409. Longest Palindrome(Leetcode每日一题-2020.03.19)
Problem Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This is case sensitive, for example “Aa” is
695. Max Area of Island(Leetcode每日一题-2020.03.15)
Problem Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid a
169. Majority Element(Leetcode每日一题-2020.03.13)
Problem Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority ele
1071. Greatest Common Divisor of Strings(Leetcode每日一题-2020.03.12)
Problem For strings S and T, we say “T divides S” if and only if S = T + … + T (T concatenated with itself 1 or more times) Return the largest string X such that X divides str1 and X divides str2.
1013. Partition Array Into Three Parts With Equal Sum(Leetcode每日一题-2020.03.11)
Problem Given an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums. Formally, we can partition the array if we can find indexes i+
225. Implement Stack using Queues(Leetcode每日一题-2020.03.01)
Problem Implement 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 w
Anaconda环境中PyTorch GPU版本安装（2020.03最新+避坑+全面）
一、前期准备 1. Anaconda 安装 历史版本anaconda下载，推荐下载3-5.2.0版本，该版本对应python3.6。 ps 下载慢的同学： 链接：https://pan.baidu.com/s/1IhKgm5cEPmtj0yos7xpTpw 提取码：h2ob 检测anaconda是否安装成功： 在开始菜单出，左击 Anaconda Prompt （如果开始菜单中没
2020.03,29日常总结
洛谷P3627 [APIO2009]抢掠计划 \color{green}{\text{洛谷P3627\ \ \ \ \ [APIO2009]抢掠计划}} 洛谷P3627 [APIO2009]抢掠计划 【题意】： \color{blue}{\text{【题意】：}} 【题意】： Siruseri 城中的道路都是 单向 \color{red}{\text{单向}} 单向 的。不