OJ
落难的清哇
这个作者很懒,什么都没留下…
展开
-
Uva201 Squares
*未按照题目的格式。/*整体思路:枚举法,扫描全部的点,用size代表每次检查的正方形边长,依次检查是否满足题意*/#includeusing namespace std;int H[10][10];int V[10][10];void Edge(char Edge,int i,int j){ if (Edge == 'H'){ H[i][j] = 1; } if (原创 2016-02-06 18:52:31 · 275 阅读 · 0 评论 -
[LeetCode 151] Reverse Words in a String
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".语言使用python:整体思路:使用spilit()函数把以空格区分的字符串列表分割 然后倒置列表,最后写入字符串中并且添加空格原创 2016-04-25 16:35:11 · 392 阅读 · 0 评论 -
LeetCode 191 number of 1 bits
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 000000原创 2016-03-28 23:17:37 · 283 阅读 · 0 评论 -
LeetCode 231 Power of Two(三解)
231. Power of TwoGiven an integer, write a function to determine if it is a power of two.我的方法是暴力求解,循环让1一直乘以2,如果结果等于n,且n大于0则输出true。这是最容易想到的方法class Solution {public: bool isPowerOfTwo(int原创 2016-03-28 23:37:34 · 313 阅读 · 0 评论 -
[LeetCode 58]Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2016-05-04 19:32:01 · 474 阅读 · 0 评论 -
[LeetCode] Ugly Number
题目描述:Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ug原创 2016-05-06 15:45:35 · 625 阅读 · 0 评论 -
[LeetCode 338] Counting Bits
LeetCode 338. Counting BitsGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an ar原创 2016-04-24 13:24:12 · 539 阅读 · 0 评论 -
[LeetCode 80]Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first fi原创 2016-06-01 18:53:55 · 643 阅读 · 0 评论 -
[LeetCode26] Remove Duplicates from Sorted Array
作为LeetCode:80的先导题,不会做80的先看这题。Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another ar原创 2016-06-01 18:56:28 · 852 阅读 · 0 评论 -
[LeetCode28]
字符串匹配:Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Subscribe to see which companies asked this question原创 2016-05-06 15:09:56 · 706 阅读 · 0 评论 -
[leetcode 1]TwoSum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example:Given nums =原创 2016-06-04 10:30:46 · 608 阅读 · 0 评论 -
[leetcode 128]Longest consecutive sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3原创 2016-06-04 10:21:48 · 557 阅读 · 0 评论 -
Uva 1585
UVA的OJ 题目:给你一个X和O组成的串,每个O有一个分,而且连续的O的积分就是连续出现的个数,求所有O的分数和。举例:OOXXOXXOOO 1+2+0+0+1+0+0+1+2 +3=10代码如下#include #includeusing namespace std;int main() { int score[80]; int Courage = 0;原创 2016-02-03 10:22:56 · 304 阅读 · 0 评论 -
LeetCode 136 single number
题目:给定一个数组,每个元素都出现2次除了其中的一个,找出只出现一次的数字注意:算法必须是线性时间复杂度,不使用额外的空间。提示:利用亦或运算的性质。#include#includeusing namespace std;int single(vector&num){//A XOR A =0; int result = 0; for (int i = 0; i != num原创 2016-03-14 21:01:41 · 234 阅读 · 0 评论 -
Leetcode266 Palindrome Permutation
QuestionGiven a string, determine if a permutation of the string could form a palindrome.For example, “code” -> False, “aab” -> True, “carerac” -> True.Hint:Consider the palindromes原创 2016-03-14 11:32:45 · 325 阅读 · 0 评论 -
UVA 455
/* Page57 3-4 */#include #includeusing namespace std;int main() { int time = 1, times = 0; //周期, 以及测试用的时间 string A; cin >> A; for (int i = 1; i != A.size(); i++) { if (A[0] != A[i])原创 2016-02-03 10:25:30 · 284 阅读 · 0 评论 -
UVA227
题目:给你一个字母组成的矩阵,其中有一个空位,给你移动的规则(类似平面的一种拼图游戏); 问是否操作合法,合法时输出移动后的结果。思路比较简单清晰,二维数组模拟方阵,然后空格的移动实际就是swap。有一点疑惑的是 在swap的时候,如果是swap(Puz[x][y], Puz[x][++y]) 则没有移动swap(Puz[x][y], Puz[x][y+原创 2016-02-03 11:06:14 · 300 阅读 · 0 评论 -
LeetCode 258. Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has on原创 2016-03-15 22:15:31 · 311 阅读 · 0 评论 -
Uva 202
#include #include#define max 3000using namespace std;int main(){ int result[max]; int a, b, m; cin >> a >> b; m = a%b; for (int i = 0; i != 3000; i++){//模仿除法笔算,记录小数部分3000位 m *= 10; result原创 2016-02-03 20:01:38 · 297 阅读 · 0 评论 -
Uva1588
/*Page 59 3-11 齿轮啮合 */#include using namespace std;int main(){ char Up[100], Down[100]; while (scanf("%s%s", Up, Down) != EOF) { int Length1 = 0, Length2 = 0; //不同移动方向产生的长度 int memory = 0; /原创 2016-02-04 12:49:28 · 523 阅读 · 0 评论 -
Uva10340
#include #includeusing namespace std;int main(){ int score = 0; string s, t; cin >> s >> t; for (int i = 0; i < s.size(); i++){ for (int j = score; j < t.size(); j++) { if (s[i] ==原创 2016-02-03 20:04:56 · 372 阅读 · 0 评论 -
LeetCode 202 Happy number
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2016-03-16 19:59:12 · 360 阅读 · 0 评论 -
LeetCode 217 Contains Duplicate
题目:Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every eleme原创 2016-03-30 17:49:10 · 298 阅读 · 0 评论 -
LeetCode137 Single Number II
question:Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement i原创 2016-03-21 10:16:00 · 297 阅读 · 0 评论 -
LeetCode 3 Longest Substring Without Repeating Characters
题目: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length原创 2016-04-01 15:34:18 · 230 阅读 · 0 评论 -
[LeetCode 238] Product of Array Except Self
题目:Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division原创 2016-04-04 15:48:56 · 558 阅读 · 0 评论 -
Leetcode 120 Triangle(图解)
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent(相邻的) numbers on the row below.For example, given the following triangle[ [2], [3,4],原创 2016-03-26 10:40:36 · 444 阅读 · 0 评论