- 博客(41)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 内网穿透利器 n2n 搭建指南
n2n 是 C/S 架构的开源内网穿透服务，相比 FRP 和 ZeroTier 有自己的优势。本文讲解了 n2n 服务端+客户端 的搭建和使用。
2024-03-18 22:31:33
9258
原创 ZeroTier 和 FRP 速度对比实验（附搭建方法）
对比 ZeroTier 和 FRP 的 下载/上传 速度，延迟，抖动。附搭建教程。
2022-07-06 13:50:35
44144
15
原创 在家搭建 Minecraft 服务器，和远程小伙伴一起联机
文章目录构建服务端运行服务端内网穿透构建服务端系统环境是windows10 (Linux也适用，自行改动相关步骤)服务端选用Spigot (Java)，服务端版本选用1.16.5，Java版本选用16下载Spigot Build Toolshttps://www.spigotmc.org/downloads - build Tools下载最新支持 java16 的 Build Tool下载安装git工具https://git-scm.com/Cmder自带git，如果使用的终端是
2021-05-15 20:36:02
1551
原创 Anaconda+Pycharm环境下的PyTorch配置方法
写给新手的话pycharm是什么，为什么让我指定interpreter记事本最开始写C语言代码的时候，人们使用vi，记事本等软件写代码，写完了之后用GCC编译，然后运行编译结果，就是二进制文件。python也可以这样做，用记事本写完代码，保存成如test.py的文件后，通过命令python test.py可以运行这一文件。最初的C语言代码都是通过这种方式写的。但是人们很快发现了一个问题，就是...
2019-04-16 19:08:41
68955
17
原创 R代理服务器设置，CRAN默认镜像设置
1、R代理服务器在Rgui.exe的快捷方式后面加上：http_proxy=http://user:password@proxy:port/其中proxy是代理服务器地址，port是代理服务器端口，user是用户名，password是密码2、CRAN默认镜像R根目录下./etc/Rprofile.site# set a CRAN mirror local(
2015-06-27 15:45:05
9055
原创 For CHESHEN
#if 1#include #include #include#include#include#includeusing namespace std;int res = 0,step = 0, position=0; int maxdiclen = 0,flag = 0;bool _first_of(string &src,string &com){ if(com.size
2015-06-11 01:35:16
610
原创 百度之星 2015 初赛(2) 1005 序列变换
序列变换 Accepts: 695 Submissions: 3322 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description我们有一个数列A1,A2...An，你现在要求修改数量最少的
2015-05-31 19:10:03
1621
原创 百度之星 2015 初赛(2) 1003 棋盘占领
棋盘占领 Accepts: 937 Submissions: 2201 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description百小度最近迷恋上了一款游戏，游戏里有一个n*m的棋盘，每个方
2015-05-31 19:05:25
1455
原创 百度之星 2015 初赛(1) 1003 序列变换
序列变换 Accepts: 816 Submissions: 3578 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description给定序列A={A1,A2,...,An}, 要求改变序列
2015-05-31 13:57:59
2220
原创 百度之星 2015 初赛(1) 1002 找连续数
找连续数 Accepts: 401 Submissions: 1911 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description小度熊拿到了一个无序的数组，对于这个数组，小度熊想知道是否能
2015-05-31 13:45:43
1762
2
原创 For Beibi
http://www.ra.cs.uni-tuebingen.de/SNNS/http://www.ra.cs.uni-tuebingen.de/SNNS/UserManual/node52.html#SECTION00540000000000000000http://www.ra.cs.uni-tuebingen.de/SNNS/UserManual/node306.html#SEC
2015-05-20 14:57:03
480
原创 For JingJing
#加载程序包library(randomForest)#加载数据包data(iris)##生成随机森林，进行predictind <- sample(2, nrow(iris), replace = TRUE, prob=c(0.8, 0.2))iris.rf <- randomForest(Species ~ ., data=iris[ind == 1,])iris.pred <
2015-05-12 16:47:45
444
原创 LeetCode ZigZag Conversion
ZigZag ConversionThe string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P
2015-02-06 13:07:53
346
原创 LeetCode 3Sum
3SumGiven an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:El
2015-02-04 20:13:25
340
原创 LeetCode Rotate Image
Rotate ImageYou are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?class Solution {public:
2015-02-04 20:11:07
386
原创 LeetCode Search a 2D Matrix
Search a 2D MatrixWrite an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left
2015-02-02 19:50:38
374
原创 LeetCode Search for a Range
Search for a RangeGiven a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log
2015-02-02 19:46:00
296
原创 LeetCode Search in Rotated Sorted Array II
Search in Rotated Sorted Array IIFollow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function t
2015-02-02 19:43:34
373
原创 LeetCode Search in Rotated Sorted Array
Search in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a targe
2015-01-29 23:42:23
344
原创 LeetCode Unique Paths
Unique PathsA robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The r
2015-01-29 21:28:07
337
原创 LeetCode Search Insert Position
Search Insert PositionGiven a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume
2015-01-29 20:48:05
311
原创 LeetCode Set Matrix Zeroes
Set Matrix Zeroes Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up:Did you use extra space?A straight forward solution using O(m
2015-01-26 21:04:45
395
原创 LeetCode Container With Most Water
Container With Most WaterGiven n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line
2015-01-26 19:46:42
363
原创 LeetCode 3Sum Closest
3Sum ClosestGiven an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that e
2015-01-24 19:47:46
367
原创 LeetCode Two Sum
Two Sum Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up
2015-01-24 18:50:25
342
原创 Ubuntu下搭建Spark+Scala+idea-IC+R+Rstudio实践记录
一、基本命令lssudo -i二、Ubuntu系统软件/插件安装1、右键菜单“在终端中打开...”sudo apt-get install nautilus-open-terminal2、小工具：“以管理员方式运行……”sudo apt-get install gksu3、Vimsudo apt-get install vim注：以下安装到/opt目录下的操
2015-01-22 00:14:42
3351
原创 LeetCode Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements fro
2015-01-20 17:42:46
357
原创 LeetCode Pascal's Triangle & Pascal's Triangle II
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]class Solution {public:
2015-01-19 20:11:46
429
原创 LeetCode Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.class Solution {pub
2015-01-19 17:05:27
419
原创 LeetCode Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with
2015-01-18 21:14:16
327
原创 LeetCode Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.c
2015-01-18 20:05:28
381
原创 [旧版] LeetCode 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact
2014-12-10 22:45:50
383
原创 [旧版] LeetCode Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.E
2014-12-10 12:14:47
407
原创 [旧版] LeetCode Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe
2014-12-09 21:29:15
385
原创 BUPTOJ 0092统计节点个数
超时了N长时间，最后检查发现是数据量大，我的算法不够好的缘故。for循环里的比较操作多了一次，直接导致超时，优化掉这一次操作，时间锐减到400ms。。。TIPS：1.memset，很方便将一段内存置为同一个值的方法，C语言扔了这么多年，这个函数感觉好面生。2.cin，cout确实比scanf，printf要慢上一些。3.把数组定义放在循环里面也是不明智的行为，因为反复申请释放内
2014-03-29 11:56:37
676
原创 BUPTOJ 0091 文件系统
很基础的树题。因为不熟C++语法和特性，卡了相当一阵子。Java用惯了，还真是不习惯C++的内存管理。Java中内存管理是由垃圾回收机制负责的，以后用不到的，它自动收回，以后还会用到的，你不用担心它的内存会被占用。但是C++不一样，出了函数域，你再留着它局部变量的指针又如何，该给你占用还给你占用，根本没人管。搞了半天才懂，哦，这里要用malloc。弄了个左孩子右兄弟二叉树来模拟树形目录
2014-03-28 17:07:06
834
原创 BUPTOJ 0090 字符串转换
上午做的，目测是个动态规划。勉强学会了使用Map，也没优化算法，就按第一感觉来了。先统计字符串的字符集keys和每个字符出现次数，然后根据字符集和次数计算代价矩阵price，代价矩阵内容a[i][j]为把字符串中keys[i]全部转化为keys[j]所需要的代价。代价矩阵的每一个竖向加和就是一个总代价，比较总代价，最小的那个就是结果。40多ms，大神们都是个位数= =/*USER_ID:
2014-03-28 17:02:44
900
原创 BUPTOJ 0087-0089
这三道略水，做得很顺利。BUPTOJ 0087日期/*USER_ID: test#aa3615058PROBLEM: 87SUBMISSION_TIME: 2014-03-19 21:08:42*/#include #include using namespace std; bool isLeapYear(int year); int main() { i
2014-03-28 16:59:12
736
原创 BUPTOJ85 Three Points On A Line
考研党200年没码过代码了，没想到一上手这么生，还是和ACM大牛们没法比啊╮(╯▽╰)╭但好歹也是技术流，码代码还算有点自信。。。为了准备复试，抱着把北邮OJ上所有题刷一遍的心情就去了。。PS：居然在论坛听说，有考研400分的大神，不、会、写、代、码！！BUPT83 A+B 无压力秒杀！！！First Blood！！BUPT84 Single Number 本来以为能轻松Doubl
2014-03-17 23:29:55
2607
3
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人