1028 List Sorting (25 point(s))
思路：利用 map 处理不同条件，若条件相同，则利用set 处理。1028 List Sorting (25 point(s))Excel can sort records according to any column. Now you are supposed to imitate this function.Input Specification:Each input file contains one test case. For each case, the first li.
1029 Median (25 point(s))
思路：计算的出中位数的位置，然后比较两个数组，得出中位数，时间复杂度为 O(n+m)1029 Median (25 point(s))Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10
matlab中fftshift与ifftshift的区别？
matlab中fftshift与ifftshift的区别？两者实际上是不同的。fftshift就是对换数据的左右两边：x=[1 2 3 4] fftshift(x) ->[3 4 1 2]ifftshift是为了当数据不是偶数长度时加出来的一个函数：x=[1 2 3 4 5] ifftshift(x) ->[4 5 3 1 2]（1）ifftshift和fftshift执行的都是圆周位移的操作。fftshift是将数组或矩阵按正方向（向右和向下）做圆周位移，而ifftshift是按负
如何在MATLAB上用GPU加速计算
（1）首先，GPU设备确认，Matlab目前只支持Nvidia的显卡。想知道自己的电脑有没有这个能力，在Matlab中运行 gpuDevice。只要数据格式是gpuArray格式的，那么计算过程会自动的调用GPU进行计算。（2）GPU和CPU之间数据传递①将CPU内存数据传到GPU内存中：gpuArray1）在使用GPU计算的时候，只需要将CPU的数据复制到GPU中即可，可以对数据的名称做了修改，也可以直接进行重新赋值。例如：G = gpuArray(M);或，M = gpuArray(M);注
Matlab Cody学习笔记 day1
Matlab Cody学习笔记—改进方案Problem 3. Find the sum of all the numbers of the input vector求矩阵元素之和：function y = vecsum(x)y = sum(x);end改进为：function ans = vecsum(x)! echo “function assert(~)” > ./assert.m% Cody Team, please restric usage of regexp and !
matlab cody学习笔记 day2
一些心得：（1）else和elseif的区别。如果只要两种可能，在if后，只能用else。若需要2个或以上的if语句，使用elseif，表示条件判断为假时，再次进行条件判断。两者不能混用，须注意区别！（2）在进行判断的时候，例如判断奇偶数，能mod(n,2)==0就不要mod(n,2)~=0。直观方便。（3）一个很简单的程序：返回输入向量的所有奇数向量，例如：Input x = [5 9 3 2 2 0 -1]Output y is [5 3 2 -1]我用了if判断x(i)是否为偶数，再对y
matlab cody学习笔记 day3
一些心得：（1）将矩阵A的n列删除的一种简单方法：A(:,n)=[];不需要循环即可解决。(2)matlab里面可以定义字母，例如a=‘yes’;(3)三角数这个题目很有意思：Triangle numbers are the sums of successive integers. So 6 is a triangle number because6 = 1 + 2 + 3which can be displayed in a triangular shape like so** **
matlab cody学习笔记 day4
(1)在我感慨活用find函数能把matlab善于矩阵处理的特性好好发挥的时候，竟然有更简单不用find的方式。例如将数组x里小于0，大于10的数替换为Nan，大家一般都用循环在对x(i)进行判断，我用find寻找：temp = find(x<0 |x>10);x(temp) = Nan;其实，完全可以简化为：x(x < 0 | x > 10) = NaN;(2)矩阵的最后一列/行为end，可以不用知道具体数。学会用end很方便。(3)构造棋盘矩阵Given an i
matlab cody学习笔记 day5
一些学习笔记：（1）数组的简单赋值：例如：Input n = 5Output m is [ 1 2 3 4 52 4 6 8 103 6 9 12 154 8 12 16 205 10 15 20 25 ]两个循环的源代码：function m = timestables(n)m = ones(n,n);for i = 1:nfor j = 1
matlab cody学习笔记 day6 isempty和intersect函数的用法
一些学习心得：（1）圆柱表面积：圆柱的表面积=侧面积+两个底面积=2πrh+2πr^2（2）华氏度与摄氏度的转换：C = (F–32) * 5/9；（3）寻找完美的平方Given a vector of numbers, return true if one of the numbers is a square of one of the other numbers. Otherwise return false.Example:Input a = [2 3 4]Output b is
matlab cody学习笔记 day7
(1)Problem 25. Remove any row in which a NaN appearsGiven the matrix A, return B in which all the rows that have one or more NaNs have been removed. So forA = [ 1 5 8-3 NaN 140 6 NaN ];thenB = [ 1 5 8 ]答：function B = remove_nan_rows(A)
matlab cody学习笔记 day8
(1)Back and Forth RowsGiven a number n, create an n-by-n matrix in which the integers from 1 to n^2 wind back and forth along the rows as shown in the examples below.Examples:Input n = 3Output a = [ 1 2 36 5 47 8 9 ]Input n = 4Output a =
matlab cody学习笔记 day9
（1）Summing digitsGiven n, find the sum of the digits that make up 2^n.Example:Input n = 7Output b = 11since 2^7 = 128, and 1 + 2 + 8 = 11..答：function b = sumDigits(n)pow = 2^n;b = 0;while pow~=0b = b +mod(pow,10);pow = floor(pow/.
matlab cody学习笔记 day10
(1)Check if number exists in vectorReturn 1 if number a exists in vector b otherwise return 0.a = 3;b = [1,2,4];Returns 0.a = 3;b = [1,2,3];Returns 1.这道题目还是很简单的，第一眼就觉得用find函数，但是还需要加判断。答：if true(find(b == a))y = 1elsey = 0end答：y = ~isempty(b
matlab cody学习笔记 day11
想到要开学，要离开家，哭了一晚上，我想我妈妈！（1）Problem 30. Sort a list of complex numbers based on far they are from the origin.Given a list of complex numbers z, return a list zSorted such that the numbers that are farthest from the origin (0+0i) appear first.So if z is
matlab cody学习笔记 day12
(1)The Goldbach ConjectureThe Goldbach conjecture asserts that every even integer greater than 2 can be expressed as the sum of two primes.Given the even integer n, return primes p1 and p2 that satisfy the condition n = p1 + p2. Note that the primes are
matlab cody学习笔记 day13
感觉现在的题目越来越难了，好想每日鸡汤激励一下自己好好学习，不要怕!(1)Which values occur exactly three times?Return a list of all values (sorted smallest to largest) that appear exactly three times in the input vector x. So ifx = [1 2 5 2 2 7 8 3 3 1 3 8 8 8]theny = [2 3]一些函数的学习：C
今日推荐
周排行