UVa Coding Practice
Snail_Walker
Google Senior Machine Learning Tech Lead | 行胜于言
展开
-
UVa: 133
#include <stdio.h>#include <stdlib.h>#include <string.h>static int find_next(int *tag, int num, int cur_pos, int step, int ope_kind){ int divider = num + 1; int acc = 0; int ind = (cur_p原创 2017-01-08 14:40:36 · 450 阅读 · 0 评论 -
UVa 725: Division
我觉得我想的算法不错,复杂度比较低,之前好几种都是速度太慢了。#include <iostream>#include <vector>#include <set>#include <string>#include <map>#include <sstream>using namespace std;int main(){ // produce the solution for n原创 2017-01-08 15:02:49 · 529 阅读 · 0 评论 -
UVa 12657:Boxes in a Line
这里我用了head和tail记录链表的头和尾,在进行操作的时候要考虑head和tail,以及swap的时候考虑X,Y是否是相邻的。#include <iostream>using namespace std;struct element{ int left; int right;}NODE;static void movingBoxUVa12657(void); stati原创 2017-01-10 15:50:28 · 443 阅读 · 0 评论 -
UVa679: dropping balls
第一种做法是直接模拟,但是会超时。#include <iostream>#include <cmath>#include <cstring>static void ProcessDepthDAndIthBallDrop(int Depth, int I); //int ball_num = pow(2, Depth - 1) + 1; int ball_tree[524288];int mai原创 2017-01-08 14:37:09 · 560 阅读 · 0 评论 -
UVa122:Trees on the level
题目描述建立节点,并使用BFS输出。代码实现#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <queue>#define maxn 256using namespace std;// (11,LL) (7,LLL) (8,R) (5, ) (4, L) (13, RL) (2, LLR) (1, RRR) (4, RR) ()原创 2017-02-24 01:07:10 · 737 阅读 · 0 评论 -
Zenefits面试题
Problem Description难度:简单 / 中等a. 给出一系列以 a1/b1,a2/b2 这样表示的分数,返回它们的和约分后的形式。b. 给定一个一维数组 a,求满足 i < j 并且 a[i] < a[j] 的元素对中 a[j] - a[i] 的最大值。Implementationa. 给出一系列以 a1/b1,a2/b2 这样表示的分数,返回它们的和约分后的形式。string Fra原创 2017-08-02 11:16:48 · 360 阅读 · 0 评论 -
Zocodc/Zillow/Qualtrics面试题
Zocodc:难度:中等 / 困难 给一个长为 n 的整型数组 nums,返回一个数组 output 满足 output[i] = nums 中除 nums[i] 以外的元素的乘积。要求在线性时间内解决,并且不使用除法。class Solution {public: vector<int> productExceptSelf(vector<int>& nums) { int原创 2017-08-02 14:45:39 · 610 阅读 · 0 评论 -
403. Snapchat面试题:青蛙过河/653. Two Sum IV - Input is a BST/655. Print Binary Tree
Problem Description想象有一只青蛙要过河。河面用一个一维 0/1 数组表示,0 表示这一格是水,1 表示这一格是石头。这只青蛙不会游泳,但可以在石头之间跳跃,不过要满足:假设上一次跳跃的距离为d,这次跳跃的距离必须是 d-1、d 和 d-1 之一的数值。给定这个一维数组,请编程确定这只青蛙是否能顺利过河?注意跳跃的距离不能为负,也就是说不能回头。这道题目也是Leetcode的403原创 2017-08-07 08:26:13 · 727 阅读 · 0 评论 -
C++ STL erase in for loop
unsafe method: if it is the end, it++ will cause segment fault. for (vector<int>::iterator it = test1.begin(); it != test1.end(); ) { if (*it == 3) { test1.erase(it++); }原创 2017-10-07 23:06:00 · 564 阅读 · 0 评论 -
Leetcode 刷题之数组类
入门级283. Move Zeroesclass Solution {public: void swap(vector<int>& nums, int a, int b) { int tmp = nums[a]; nums[a] = nums[b]; nums[b] = tmp; } void moveZeroes(vector原创 2017-12-21 06:09:21 · 539 阅读 · 0 评论 -
UVa 11059: maximum product
记录负数,因为这种不到最后都不知道负数有可能转正。#include <iostream>void MaximumProduct(int n, int* seq, int num_case);int main(){ int n; int num_case = 1; while(std::cin >> n) { int *seq_n = new int[n原创 2017-01-08 15:00:33 · 654 阅读 · 0 评论 -
UVa 514: Rails
怎么进来就想想它怎么回去。#include <iostream>#include <stack>using namespace std;int main(){ stack<int> in_station; int num_carriage; while(cin >> num_carriage && num_carriage != 0) { if(nu原创 2017-01-08 14:58:34 · 488 阅读 · 0 评论 -
UVa 489: Hangman Judge
#include <stdio.h>#include <stdlib.h>#include <string.h>#define DIGITNUM 26#define WIN 0#define LOSE 1#define CHICHKENED 2typedef struct { int ans_map[26]; int unguess_num;}ANS_MAP;void原创 2017-01-08 14:43:02 · 505 阅读 · 0 评论 -
UVa 1339: Ancient Cipher
#include <stdio.h>#include <stdlib.h>#include <string.h>int cmp(const void *a, const void *b){ return *(int *)a - *(int *)b;}int main(){ char strA[100]; char strB[100]; char *tmp =原创 2017-01-08 14:44:53 · 753 阅读 · 0 评论 -
UVa 139: Ugly Numbers
#include <iostream>#include <queue>#include <set>#include <vector>#include <functional>using namespace std;typedef long long LL;int main(){ const int coeff[3] = {2, 3, 5}; priority_queue<L原创 2017-01-08 14:46:58 · 448 阅读 · 0 评论 -
UVa 540: Team Queue
#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <deque>#include <cstring>#include <map>#include <string>#define OPEN_DEBUG 1using namespace std;/*map for elements and teams nums.deque原创 2017-01-08 14:48:43 · 829 阅读 · 0 评论 -
UVa 12096: math problem
#include <iostream>#include <map>#include <cmath>using namespace std;map<int, int> result[10001]; int main(){ int k; for(k = 1; k <= 10000; k++) { int x, y; int x1, x2;原创 2017-01-08 14:49:54 · 334 阅读 · 0 评论 -
UVa 10815: Andy's First Dictionary
#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <sstream>#include <string>#include <set>#include <cstring>using namespace std;int main(){ set<string> dict; string in_s; while原创 2017-01-08 14:51:39 · 703 阅读 · 0 评论 -
UVa 101: The Blocks Problem
#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <vector>#include <string>#define OPEN_DEBUG 1using namespace std;int main(){ int n; const string quit_flag = "quit"; const str原创 2017-01-08 14:54:14 · 721 阅读 · 0 评论 -
UVa 10474: Where is the Marble
#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <algorithm>using namespace std;int main(){ int N, Q; int case_num = 1; while(cin >> N >> Q) { if (N == 0 && Q == 0)原创 2017-01-08 14:55:37 · 545 阅读 · 0 评论 -
UVa 442: Matrix Chain Multiplication
#include <iostream>#include <map>#include <stack>#include <cctype>#include <string>using namespace std;typedef struct{ int m_row; int m_column; char m_identy;}Matrix; int countMultiTi原创 2017-01-08 14:56:53 · 818 阅读 · 0 评论 -
Leetcode 刷题之Hash and Tree
滑动窗口哈希表LeetCode 748 Shortest Completing WordSentence SimilarityLongest Word in Dictionarytrees滑动窗口349. Intersection of Two Arraysclass Solution {public: vectorint> interse原创 2017-12-21 22:26:13 · 329 阅读 · 0 评论