- 博客(30)
- 资源 (20)
- 收藏
- 关注
原创 2016级计算机C++助教工作(10)第三次第四次上机题注意事项
各位同学,当你们队逻辑和代码的掌控能力不强的时候,切忌使用动态声明数组的方法用全局变量然后是常数大小(保证足够大)如: int a[100000];不要在函数中声明大于10^5的数组第三次:A:这道题呢,其实没有什么坑,就是在一条线段上,走到两端的蚂蚁会掉下去,算最少需要多少时间能让所有蚂蚁掉下去,以及最多多久所有蚂蚁能掉下去。B:这道题有测试数据,全过了就没什么问题,不过数组开大
2016-11-30 10:47:34 712
转载 深度学习(9) 计算机专业方面的期刊介绍
转载自:http://www.cnblogs.com/growup/archive/2011/02/22/1971534.html计算机专业方面的期刊介绍一、计算机科学期刊介绍计算机科学的publication最大特点在于:极度重视会议,而期刊则通常只用来做re-publication。大部分期刊文章都是会议论文的扩展版,首发就在
2016-11-28 16:51:03 13868
原创 小提琴学习(1) 五线谱
学习视频:http://v.youku.com/v_show/id_XOTI0NTQ1ODA=.html?&f=26354086&from=y1.2-3.4.4&spm=a2h0j.8191423.item_XOTI0NTQ1ODA=.A第四天:节、拍谱号:高音谱、低音谱调号:拍号:
2016-11-28 16:49:21 1612
原创 leetcode 190. Reverse Bits
class Solution {public: uint32_t reverseBits(uint32_t n) { uint32_t x=0; for(int i = 0;i < 32 ;i++){ x<<=1; x|=n&1; n>>=1; } re
2016-11-24 10:58:46 279
原创 leetcode 447. Number of Boomerangs
class Solution {public: int numberOfBoomerangs(vector>& points) { unordered_map haha; int ans = 0; for(int i = 0;i < points.size(); i++){ haha.clear();
2016-11-24 10:50:38 409
原创 leetcode 67. Add Binary
class Solution {public: string addBinary(string a, string b) { if(a.length() < b.length()) swap(a,b); int i = a.length()-1,j=b.length()-1; for(;j>=0;i--,j--){
2016-11-24 10:27:09 293
原创 leetcode 401. Binary Watch
class Solution {public: vector readBinaryWatch(int num) { vector res[11]; vector ans[11]; vector result; if(num > 10 || num < 0) return result; for(int i =
2016-11-23 21:59:30 394
原创 leetcode 463. Island Perimeter
class Solution {public: int islandPerimeter(vector>& grid) { int h = grid.size(); int w = grid[0].size(); int ans = 0; int dir[4][2]={ 0,1,
2016-11-23 21:08:23 309
原创 leetcode 455. Assign Cookies
class Solution {public: int findContentChildren(vector& g, vector& s) { sort(g.begin(),g.end()); sort(s.begin(),s.end()); int ans = 0; int i = g.size()-1;
2016-11-23 20:56:44 304
原创 leetcode 136. Single Number
class Solution {public: int singleNumber(vector& nums) { int x = 0; for(int i = 0;i < nums.size(); i++) x ^= nums[i]; return x; }};
2016-11-23 19:53:51 360
原创 leetcode 453. Minimum Moves to Equal Array Elements
class Solution {public: int minMoves(vector& nums) { int x = nums[0]; for(int i = 0;i < nums.size() ;i++) x = min(x,nums[i]); int sum = 0; for(int i =
2016-11-23 19:48:00 353
原创 leetcode 389. Find the Difference
class Solution {public: char findTheDifference(string s, string t) { int x[26]={0}; for(int i = 0;i < s.length(); i++) x[s[i]-'a']++; for(int i = 0;i < t.lengt
2016-11-23 19:42:43 262
原创 leetcode 409. Longest Palindrome
class Solution {public: int longestPalindrome(string s) { int hehe[128]={0}; for(int i = 0;i < s.length(); i++) hehe[s[i]]++; int flag = 0; int sum = 0
2016-11-23 19:36:58 251
原创 leetcode 404. Sum of Left Leaves
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas
2016-11-23 19:32:49 356
原创 leetcode 387. First Unique Character in a String
class Solution {public: int firstUniqChar(string s) { int x[26]={0}; for(int i = s.length()-1; i >= 0; i--){ if(x[s[i]-'a'] == 0) x[s[i]-'a'] = i+1; else i
2016-11-23 19:29:42 318
原创 leetcode 412. Fizz Buzz
class Solution {public: vector fizzBuzz(int n) { vector ans; for(int i = 1; i<=n; i++){ string res=""; if(i % 3 == 0) res +="Fizz";
2016-11-23 19:22:43 489
原创 leetcode 415. Add Strings
class Solution {public: string addStrings(string num1, string num2) { string &a =num1; string &b = num2; if(a.length() < b.length()) swap(a,b); int x1
2016-11-23 19:17:39 271
原创 leetcode 405. Convert a Number to Hexadecimal
class Solution {public: string toHex(int num) { if(num == 0) return "0"; string ans = ""; unsigned int x = num; while(x > 0){ int f = x %
2016-11-23 19:08:25 278
原创 leetcode 459. Repeated Substring Pattern
class Solution {public: bool repeatedSubstringPattern(string str) { if(str.length() == 1) return false; cout<<str.length()<<endl; int *pre = new int[str.length
2016-11-23 18:59:48 341
原创 leetcode 437. Path Sum III
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas
2016-11-23 18:32:47 255
原创 leetcode 441. Arranging Coins
class Solution {public: int arrangeCoins(int n) { long long m = sqrt(1.0*n*2); if((m+1)*m/2 < n) m++; if((m+1)*m/2 > n) m--; return m; }};
2016-11-23 17:44:37 292
原创 438. Find All Anagrams in a String
class Solution {public: vector findAnagrams(string s, string p) { int num[26]={0}; for(int i = 0;i < p.length(); i++) num[p[i]-'a']++; int f = 0; for(i
2016-11-23 17:36:20 307
原创 leetcode 234. Palindrome Linked List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: bool isPalin
2016-11-23 16:39:04 208
原创 leetcode 58. Length of Last Word
class Solution {public: int lengthOfLastWord(string s) { int be = s.length()-1,end = s.length()-1; for(;end >= 0;){ if(s[end] != ' ') break; end--;
2016-11-23 15:18:57 237
原创 leetcode 203. Remove Linked List Elements
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* re
2016-11-23 15:15:06 211
原创 leetcode 14. Longest Common Prefix
class Solution {public: string longestCommonPrefix(vector& strs) { if(strs.size() == 0) return ""; int ans = 0; for(;;ans++){ if(strs[0].size() ==
2016-11-23 15:07:12 263
原创 Leetcode 400. Nth Digit
class Solution {public: int findNthDigit(int n) { int digit = 1; long long t = 1; int ans = 0; while(true){ if(digit * 9 * t < n){ n =
2016-11-23 14:53:49 269
原创 VMware-ESX-Server 5 制作U盘启动并安装到物理机上
下载地址:https://pan.baidu.com/s/1miFG46c有三个文件,其中.iso文件是要用于安装到物理机上的。首先用VMware在虚拟机中模拟安装教程地址:http://jingyan.baidu.com/article/f25ef254745c8a482c1b82d9.html 百度教程用VMware安装的过程挺简单的。安装完成以后,也可
2016-11-17 21:35:07 4296
原创 深度学习(8) 基础知识和链接
对线性回归、逻辑回归、各种回归的概念学习 http://blog.csdn.net/viewcode/article/details/8794401特征选择常用算法综述 http://www.cnblogs.com/heaad/archive/2011/01/02/1924088.html
2016-11-14 21:09:30 357
原创 2016级计算机C++助教工作(9)第三次上课内容
1. cin.peek() cin.get() (LJP同学的方法)int peek();Peek next characterReturns the next character in the input sequence, without extracting it: The character is left as the next character t
2016-11-02 21:20:17 595
中国县级和以下行政区编码2013年版本
2016-03-29
编译技术工具
2014-05-16
数据库系统基础教程课后习题答案
2013-12-16
javaform小程序
2013-03-31
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人