日本的十月

-

上海飞大阪

                      ✈️候机室大厅清晨的光







奈良





超多好吃的街

奈良站街边好吃的炸猪排












奈良美术馆的屋顶花园



春日大寺









































大阪











京都






同学寻到一家评分很高的手打乌冬面



























































在山腰歇息


山腰小卖部买的冰汽水






下山







黄昏，喝了一杯饮料，带着三分醉意，去爬山，造访清水寺




















黄昏时分，却还有些许热浪，在水雾下寻找清凉












































参观京都大学


















































夜幕降临下的鸭川

















































































































































































远处的京都塔

















































































坐在鸭川边上


























清晨的鸭川









东京待续。。。








晴空塔












浅草寺








上野公园水池边休憩的人们











东京之行最大的惊喜是逛了东京博物馆 看了很多明治维新时代的历史物件，想起了同时代对岸洋务运动却失败了 

























镰仓高校前



江之岛的小小咖啡厅坐下发呆









江之岛的日落






Location: 日本

Comments

Post a Comment

Popular posts from this blog

77.combinations

-
/* Tags backtracking * @lc app=leetcode id=77 lang=java * * [77] Combinations * * https://leetcode.com/problems/combinations/description/ * * algorithms * Medium (69.56%) * Likes: 7886 * Dislikes: 206 * Total Accepted: 822.7K * Total Submissions: 1.2M * Testcase Example: '4\n2' * * Given two integers n and k, return all possible combinations of k numbers * chosen from the range [1, n]. * * You may return the answer in any order. * * * Example 1: * * * Input: n = 4, k = 2 * Output: [[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]] * Explanation: There are 4 choose 2 = 6 total combinations. * Note that combinations are unordered, i.e., [1,2] and [2,1] are considered * to be the same combination. * * * Example 2: * * * Input: n = 1, k = 1 * Output: [[1]] * Explanation: There is 1 choose 1 = 1 total combination. * * * * Constraints: * * * 1 <= n <= 20 * 1 <= k <= n * * */ // @lc code=start import java . util . ArrayList ; impor...
Read more

90.subsets-ii

-
  /* * @lc app=leetcode id=90 lang=java * * [90] Subsets II * * https://leetcode.com/problems/subsets-ii/description/ * * algorithms * Medium (56.68%) * Likes: 9237 * Dislikes: 265 * Total Accepted: 819.4K * Total Submissions: 1.4M * Testcase Example: '[1,2,2]' * * Given an integer array nums that may contain duplicates, return all possible * subsets (the power set). * * The solution set must not contain duplicate subsets. Return the solution in * any order. * * * Example 1: * Input: nums = [1,2,2] * Output: [[],[1],[1,2],[1,2,2],[2],[2,2]] * Example 2: * Input: nums = [0] * Output: [[],[0]] * * * Constraints: * * * 1 <= nums.length <= 10 * -10 <= nums[i] <= 10 * * * * 思路：使用回溯算法, 对unique数组的全排列的变种 * 问题拆分成 从n个元素的数组中选者k个元素的素全组合 * , 再收集所有子组合时去重即可 * */ // @lc code=start import java . util . ArrayList ; import java . util . List ; class Solution { public List < List < Integer >> subsetsWithDup...
Read more

40.Combination Sum II

-
/* * @lc app=leetcode id=40 lang=java * * [40] Combination Sum II * * https://leetcode.com/problems/combination-sum-ii/description/ * * algorithms * Medium (53.88%) * Likes: 9859 * Dislikes: 261 * Total Accepted: 861.2K * Total Submissions: 1.6M * Testcase Example: '[10,1,2,7,6,1,5]\n8' * * Given a collection of candidate numbers (candidates) and a target number * (target), find all unique combinations in candidates where the candidate * numbers sum to target. * * Each number in candidates may only be used once in the combination. * * Note: The solution set must not contain duplicate combinations. * * * Example 1: * * * Input: candidates = [10,1,2,7,6,1,5], target = 8 * Output: * [ * [1,1,6], * [1,2,5], * [1,7], * [2,6] * ] * * * Example 2: * * * Input: candidates = [2,5,2,1,2], target = 5 * Output: * [ * [1,2,2], * [5] * ] * * * * Constraints: * * * 1 <= candidates.length <= 100 * 1 <= candida...
Read more