摘要:
上代码先:问题代码来源:http://blog.csdn.net/v_JULY_v // MaxSum.cpp : 定义控制台应用程序的入口点。////copyright@ July//July、updated,2011.05.25。#include "stdafx.h"#include usi... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(160)
评论(0)
推荐(0)
摘要:
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occ... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(139)
评论(0)
推荐(0)
摘要:
Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(103)
评论(0)
推荐(0)
摘要:
Remove all elements from a linked list of integers that have valueval.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(104)
评论(0)
推荐(0)
摘要:
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 我的解决方案:... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(172)
评论(0)
推荐(0)
摘要:
Easy OpenCL with Python 原文 http://www.drdobbs.com/open-source/easy-opencl-with-python/240162614 OpenCL与python联合工作:与CUDA的前景分析http://www.opengpu.org/... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(501)
评论(0)
推荐(0)
摘要:
项目主页:http://grinninglizard.com/tinyxml2docs/index.html tinyxml2.h /*Original code by Lee Thomason (www.grinninglizard.com)This software is provided... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(511)
评论(0)
推荐(0)
摘要:
Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1-... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(121)
评论(0)
推荐(0)
摘要:
Maximum Depth of Binary Tree Total Accepted: 63668 Total Submissions: 141121 My Submissions Question Solution Given a binary tree, find it... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(127)
评论(0)
推荐(0)
摘要:
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers.Have you thought about this?... 阅读全文
posted @ 2017-11-17 22:27
wangyaning
阅读(106)
评论(0)
推荐(0)
浙公网安备 33010602011771号