- 博客(33)
- 收藏
- 关注
RSS订阅原创 vscode远程调试配置
ctrl+shift+p，搜索Remote-SSH:Connect to Host... ，选择Add New SSH Host... ，输入ssh -p port 用户名@目标服务器ip -A ，然后等待它为目标主机安装vscode-server。"program": "/home/jingyu/test/code/main.go", //自己的main函数位置。ssh-copy-id -i ~/.ssh/id_rsa.pub 用户名@目标服务器ip。1.本地生成一组公私钥。
2023-07-28 17:25:12
1124
原创 使用正则记录
查找 id = "xxx"查找内容INSERT INTO datav_data_source( uuid, category_uuid, category_sid, title, `desc`, `in`, `type`, content, css, is_build_in, create_user, create_time, update_user, update_time) VALUES("03JX1MN4E1NQ9XM5", "", "xsxitg", "监控项实时数据2", "", "[{\
2021-05-06 14:17:04
102
原创 【项目管理】-任务拆分
记一次领导的任务拆分改革。目的1.需求的了解。对每个需求大致需要做哪些工作，有足够的思考，让排期更准。2.任务的细化。任务拆分的足够细，能知道每天做什么，并且能更好地了解进度，进行风险把控。3.信息互通。在一开始多进行需求细节讨论，和设计方案的确认，能避免做完后的东西出现偏差，再返工的情况。任务拆分步骤：1.每个迭代开始前两天，固定为修改bug和拆分任务的时间2.对每个需求，在经过了需求评审后，细化出： a.大致完整的设计方案 b.完成步骤 c.每个步骤需要划...
2021-04-22 10:15:04
1258
原创 goland-live template
首先进入setting->Editor->Live templates 首先选择一个添加模板的文件夹，比如在go代码块中的模板选择Go文件夹，在结构体定义中的模板选择Go Struct Tag。点开选择的we上角文件夹后，点击"+"按钮进行添加。 一般需要配置的包括Abbreviation，Description，Template text，Appl...
2020-01-21 16:25:43
2945
1
原创 使用window批处理bat文件，对go程序批量进行git拉取，编译，提交
1、批量拉取for /d %%i in (folder1,folder2) do @cd %cd%\%%i && @git pullfor /d遍历了当前文件夹下的所有子文件夹in (folder1,folder2)对子文件夹进行了过滤%cd%\%%i分别进入了folder1,folder2git pull在每个进入的文件夹进行了拉取操作2、批量...
2019-08-08 15:02:32
676
原创 goland快捷键
1.编辑选中 扩展：Ctrl +W跳转 代码块前后: Ctrl+]/[ 行前后：shift +Up/Down 行最后：End 切换代码视图：Alt+ left/right 切换代码视图 在方法间快速移动定位：Alt+ Up/Down删除 行：Ctrl+Y 单词前后：Ctrl+Ba...
2019-07-30 20:46:25
307
原创 go 时间戳和时间格式的相互转换
1.日期->时间戳timestamp := time.now().Unix() //转化为时间戳 类型是int642.时间戳->日期timeNow := time.Unix(time.Now().Unix(),0)3.日期->字符串timeLayout := "2006-01-02 15:04:05" //转化所需模板 timeString ...
2019-07-29 11:29:42
1206
原创 eclipse常用快捷键
1. ctrl+shift+r：打开资源2. Ctrl+Shift+T：打开类型3. ctrl+T：列出所有实现此接口的类4. ctrl+e：快速转换编辑器5. ctrl+m：编辑器窗口最大化6. Alt+Enter：显示当前选择资源的属性7. ctrl+shift+o：自动引入包和删除无用包8. Ctrl+Shift+F：格式化当前代码9. Ctrl+/、Ctrl
2017-07-11 17:27:32
148
原创 课后习题8.3-证明
8.3 吝啬SAT是如下的问题：给定一组子句（每个都是文字的析取）和一个整数k，若存在一个其中最多有k个变量为真的满足赋值式，找出它。证明吝啬SAT是NP-完全问题。证明：吝啬SAT 的解是可在多项式时间内验证的，因此属于NP。另外，很容易可以将SAT 归约到STINGY SAT（将k 设为所有变量的总个数即可），于是可知STINGY SAT 为NP 完全问题。
2017-07-03 16:30:54
301
原创 week18- NO.128. Longest Consecutive Sequence
题目Total Accepted: 1025Total Submissions: 282227Difficulty: HardContributor: LeetCodeGiven an unsorted array of integers, find the length of the longest consecutive elements sequence.For
2017-06-19 10:06:27
198
原创 week17- NO.495. Teemo Attacking
题目Total Accepted: 12023Total Submissions: 23167Difficulty: MediumContributors:love_FawnIn LLP world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned con
2017-06-19 09:53:32
196
原创 week16- NO.560. Subarray Sum Equals K
题目Total Accepted: 7722Total Submissions: 18808Difficulty: MediumContributors:love_FawnGiven an array of integers and an integer k, you need to find the total number of continuous subarrays w
2017-06-19 09:39:39
215
原创 week15- NO.402. Remove K Digits
题目Total Accepted: 18524Total Submissions: 70922Difficulty: MediumContributor: LeetCodeGiven a non-negative integer num represented as a string, remove k digits from the number so that the ne
2017-06-18 22:05:11
153
原创 week14- Dynamic Programming-NO.152. Maximum Product Subarray
题目Total Accepted: 97998Total Submissions: 388053Difficulty: MediumContributor: LeetCodeFind the contiguous subarray within an array (containing at least one number) which has the largest
2017-06-06 15:10:20
227
原创 week13- Dynamic Programming-NO.279. Perfect Squares
题目Total Accepted: 73644Total Submissions: 203690Difficulty: MediumContributor: LeetCodeGiven a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9
2017-06-06 14:47:25
212
原创 week12- Dynamic Programming-NO.300. Longest Increasing Subsequence
题目Total Accepted: 73943Total Submissions: 194897Difficulty: MediumContributor: LeetCodeGiven an unsorted array of integers, find the length of longest increasing subsequence.For example,
2017-05-15 14:07:22
161
原创 week11- Dynamic Programming-NO.322. Coin Change
题目Total Accepted: 56540Total Submissions: 215251Difficulty: MediumContributor: LeetCodeYou are given coins of different denominations and a total amount of money amount. Write a function
2017-05-07 12:24:43
209
原创 week10- Dynamic Programming-NO.343. Integer Break
题目Total Accepted: 20701Total Submissions: 59053Difficulty: MediumContributor: LeetCodeA sequence of numbers is called a wiggle sequence if the differences between successive numbers strict
2017-04-19 09:52:53
285
原创 week9- Dynamic Programming-NO.377. Combination Sum IV
题目Total Accepted: 31882Total Submissions: 76495Difficulty: MediumContributor: LeetCodeGiven an integer array with all positive numbers and no duplicates, find the number of possible comb
2017-04-19 08:57:49
218
原创 week8- Dynamic Programming-NO.416. Partition Equal Subset Sum
题目Total Accepted: 17754Total Submissions: 46276Difficulty: MediumContributor: LeetCodeGiven a non-empty array containing only positive integers, find if the array can be partitioned into two
2017-04-13 10:01:09
202
原创 week7- Dynamic Programming-NO.516. Longest Palindromic Subsequence
题目Total Accepted: 6936Total Submissions: 16445Difficulty: MediumContributors:Stomach_acheGiven a string s, find the longest palindromic subsequence's length in s. You may assume that the max
2017-04-08 15:52:14
167
原创 京东编程笔试题
给定n辆车的横坐标和长度，可以打两枪，打中车的任何部分都算打中。问最多能打中几辆车。例：42 23 15 27 3输出：4题解：#include#includeint a[205],b[205],c[205];bool q(int w,int e){ return a[e]=a[w];}int n;int s
2017-04-07 21:21:14
222
原创 week6-NO.392.Is Subsequence
题目Total Accepted: 27326Total Submissions: 61741Difficulty: MediumContributor: LeetCodeGiven a string s and a string t, check if s is subsequence of t.You may assume that there is only lo
2017-03-31 10:21:47
176
原创 week5-NO.455. Assign Cookies
题目Total Accepted: 19294Total Submissions: 40961Difficulty: EasyContributors: µsic_foreverAssume you are an awesome parent and want to give your children some cookies. But, you should give ea
2017-03-25 11:00:39
182
原创 week4-NO.494. Target Sum
题目Total Accepted: 11746Total Submissions: 26572Difficulty: MediumContributors: kevin.xinzhao@gmail.comYou are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you
2017-03-15 16:56:42
260
原创 week4-NO.513. Find Bottom Left Tree Value
题目Total Accepted: 8467Total Submissions: 15077Difficulty: MediumContributors: abhijeet17Given a binary tree, find the leftmost value in the last row of the tree.Example 1:Input:
2017-03-15 15:39:35
326
原创 week3-NO.515. Find Largest Value in Each Tree Row
题目Total Accepted: 7094Total Submissions: 13444Difficulty: MediumContributors: µsic_foreverYou need to find the largest value in each row of a binary tree.Example:Input:
2017-03-10 10:54:43
247
原创 week3-NO.257. Binary Tree Paths
题目Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]
2017-03-10 09:35:34
198
原创 week2-NO.169. Majority Element
题目https://leetcode.com/problems/majority-element/?tab=Description思路一开始并没有一个明确的分治的思路，因为把n个数据分成两半以后，出现最多的数据可能全出现在其中的一半，而在另一半几乎不出现。考虑把数据分成两半后可能出现的所有情况。设出现最多的数为x，x在所有数据中出现的次数为C（x），x在左边的数据中出现的次
2017-03-01 16:17:00
230
原创 week1-NO.1 Two Sum
题目题目链接思路由于很长时间没有编程，所以就按顺序选择了这道难度为easy的题练练手。这道题难度很低，很容易解答，唯一的一点难度就是对vector容器的正确使用。源程序class Solution {public: vector twoSum(vector& nums, int target) { vector answer;
2017-02-26 11:16:22
236
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人