Question 48. Rotate Image Solution 把这个二维数组(矩阵)看成一个一个环,循环每个环,循环每条边,每个边上的点进行旋转 public void rotate(int[][] matrix) { int n = matrix.length; for (int i = 0; i < n / 2; i++) { change(matrix, i); } } private void change(int[][] matrix, int i) { int n = mat…

You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up:Could you do this in-place? Solution: void rotate(vector<vector<int> > &matrix) { int n = matrix.size(); ; i < n / ; i ++) { -…

Given a list, rotate the list to the right by k places, where k is non-negative. For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL. 题目大意:给一个链表和一个非负整数k,把链表向右循环移位k位. 解题思路:踩了个坑,k有可能比链表的长度还长,比如长度为3的链表,k=2…

Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Note:Try to come up as many solutions as you can, there are at least 3 different ways to solve this pro…

题目: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 题解: 这道题就是考察很直白的旋转坐标.要in place的.画个图自己算算就出来了. 代码如下:                                                          …

题目: Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL. 题解: 这道题主要先理解题意,就是倒着数k个node,从那开始到结尾和之前那部分对调,那个例子就是,4->5拿前面来,…

Question 189. Rotate Array Solution 题目大意:数组中最后一个元素移到第一个,称动k次 思路:用笨方法,再复制一个数组 Java实现: public void rotate(int[] nums, int k) { int[] numsCopy = Arrays.copyOf(nums, nums.length); for (int i=0; i<nums.length; i++) { nums[(i+k)%nums.length] = numsCopy[i];…

Question 796. Rotate String Solution 题目大意:两个字符串匹配 思路:Brute Force Java实现: public boolean rotateString(String A, String B) { if (A.length() != B.length()) return false; if (A.length() == 0) return true; // Brute Force for (int i=0; i<A.length(); i++) {…

/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* rotateRight(struct ListNode* head, int k) { struct ListNode *sentry,*p,*temp,*tail; ,index; if(head==NULL)return NULL; sentry=(s…

最近在准备找工作的算法题,刷刷LeetCode,以下是我的解题报告索引,每一题几乎都有详细的说明,供各位码农参考.根据我自己做的进度持续更新中......                              本文地址 LeetCode:Reverse Words in a String LeetCode:Evaluate Reverse Polish Notation LeetCode:Max Points on a Line LeetCode:Sort List LeetCode:Ins…