La influencia de las redes sociales en la casa puede variar. Primero puede ser bueno porque podemos usar las redes sociales para ver recetas de cocina para hacer en casa. Segundo puede ser malo porque las personas de la casa podrían sufrir acoso cibernético .
You got to "insert" and then you go to "shapes" and then you find the symbol you like and you drag and drop it onto the page. Then you can resize to the size and angle you would like it at.
Answer:
- def check_subset(l1, l2):
- status = False
- count = 0
- if(len(l1) > len(l2)):
- for x in l2:
- for y in l1:
- if x == y:
- count += 1
-
- if(count == len(l2)):
- return True
- else:
- return False
-
- else:
- for x in l1:
- for y in l2:
- if x==y:
- count += 1
-
- if(count == len(l1)):
- return True
- else:
- return False
-
- print(check_subset([1,4,6], [1,2,3,4,5,6]))
- print(check_subset([2,5,7,9,8], [7,8]))
- print(check_subset([1, 5, 7], [1,4,6,78,12]))
Explanation:
The key idea of this solution is to create a count variable to track the number of the elements in a shorter list whose value can be found in another longer list.
Firstly, we need to check which list is shorter (Line 4). If the list 2 is shorter, we need to traverse through the list 2 in an outer loop (Line 5) and then create another inner loop to traverse through the longer list 1 (Line 6). If the current x value from list 2 is matched any value in list 1, increment the count variable by 1. After finishing the outer loop and inner loop, we shall be able to get the total count of elements in list 2 which can also be found in list 1. If the count is equal to the length of list 2, it means all elements in the list 2 are found in the list 1 and therefore it is a subset of list 1 and return true (Line 10-11) otherwise return false.
The similar process is applied to the situation where the list 1 is shorter than list 2 (Line 15-24)
If we test our function using three pairs of input lists (Line 26-28), we shall get the output as follows:
True
True
False
Answer:
See explaination
Explanation:
java code:
class DONALD
{
static class Node
{
int data;
Node next;
}
static Node head=null;
static int largestElement(Node head)
{
Int max=Integer.MIN_VALUE;
while(head!=null)
{
if(max<head.data)
max=head.data;
head=head.next;
}
return max;
}
static int smallestElement(Node head)
{
int min=Integer.MAX_VALUE;
while(head!=null)
{
if(min>head.data)
min=head.data;
head=head.next;
}
return min;
}
static void push(int data)
{
Node newNode=new Node();
newNode.data= data;
newNode.next=(head);
(head)=newNode;
}
static void printList(Node head)
{
while(head!=null)
{
System.out.println(head.data + " -> ");
head=head.next;
}
System.out.println("NULL");
}
public static void main(String[] args)
push(15);
push(14);
push(13);
push(22);
push(17);
System.out.println("Linked list is : ");
printList(head);
System.out.println("Maximum element in linked list: ");
System.out.println(largestelement(head));
System.out.print("Maximum element in Linked List: " );
System.out.print(smallestElement(head));
}
}
