随笔档案「2017年6月」 - 云胡同学

66. Plus One

摘要：题目描述Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not... 阅读全文

posted @ 2017-06-25 17:56 云胡同学阅读(171) 评论(0) 推荐(0)

摘要：题目描述Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice?For example, Given sorted array nums = [1,1,1,2,2,... 阅读全文

posted @ 2017-06-23 14:38 云胡同学阅读(80) 评论(0) 推荐(0)

摘要：题目描述Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allo... 阅读全文

posted @ 2017-06-22 18:50 云胡同学阅读(112) 评论(0) 推荐(0)

27. Remove Element

摘要：题目描述Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for ... 阅读全文

posted @ 2017-06-22 17:18 云胡同学阅读(92) 评论(0) 推荐(0)

个人信息管理

摘要：#include "stdafx.h"#include#include#include#define maxstudent 40//最大的学生数40typedef struct student{ int num; int classid; int y... 阅读全文

posted @ 2017-06-20 21:56 云胡同学阅读(156) 评论(0) 推荐(0)

求期望方差

摘要：#include#includeusing namespace std;int main(){ double a[100], sum = 0, expect = 0, variance = 0; int n; scanf("%d",&n); f... 阅读全文

posted @ 2017-06-13 20:05 云胡同学阅读(168) 评论(0) 推荐(0)

01背包

摘要：#includeusing namespace std;int max(int a, int b){ if(a > b) return a; else return b;}int main(){ int t, n, v,k... 阅读全文

posted @ 2017-06-02 02:16 云胡同学阅读(78) 评论(0) 推荐(0)

云胡