原创 一條sql語句添加多個字段
Forbiden: Merge the alter statement for table 'app_info' to ONE. 需要給表中添加兩個字段，之前寫了兩句： alter table app_info add software
2019-10-25 22:28:18
原创 基於舊的master開發的分支，之後master更新了版本應該怎麼平滑過度？
基於舊的master開發的分支，之後更新了master以後，需要把feature分支rebase到新的master。 假設feature分支名爲hellodake， 切換到master-VCS-git-pull，拉取當前master最新版
2019-09-26 21:08:36
原创 git拉取本地不存在的分支
一、首先 git branch -a 查看全部分支： 二、git fetch 獲取遠程所有分支 三、git branch -r 可以看到所有遠程分支，假設要拉取的是分支update 四、git checkout update 會在本地創
2019-09-26 21:08:36
原创 com.mysql.jdbc.exceptions.jdbc4.MySQLSyntaxErrorException: You have an error in your SQL syntax;
一、 com.xiaomi.miliao.dal.DAOException: com.mysql.jdbc.exceptions.jdbc4.MySQLSyntaxErrorException: You have an error i
2019-09-26 21:08:36
原创 [leetcode]78. Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not co
2019-08-28 22:26:06
原创 [leetcode]238. Product of Array Except Self
Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of a
2019-07-16 20:35:54
原创 [ERROR]ubuntu18.04安裝Postman報錯
解壓完成以後，進入解壓目錄，執行./Postman，提示： ./Postman: error while loading shared libraries: libgconf-2.so.4: cannot open shared obje
2019-07-16 20:35:44
原创 [leetcode]22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, gi
2019-07-16 20:35:44
原创 [leetcode]206. Reverse Linked List
Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Follow up: A linked list
2019-07-16 20:35:44
原创 [leetcode]347. Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nums = [1,1,1,2,2,3], k =
2019-07-16 20:35:44
原创 [leetcode]237. Delete Node in a Linked List
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Given link
2019-07-16 20:35:44
原创 [leetcode]46. Permutations
Given a collection of distinct integers, return all possible permutations. Example: Input: [1,2,3] Output: [ [1,2,3
2019-07-02 21:47:43
原创 [leetcode]94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \
2019-06-28 22:22:48
1
原创 [leetcode]412. Fizz Buzz
Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should out
2019-06-28 22:22:38
原创 [leetcode]136. Single Number
Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algor
2019-06-27 22:08:25